Correctness of a higher-order removal transformation through a relational reasoning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2895, Issue , 2003, Pages 358-375

  Nishimura, Susumu ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

HIGHER-ORDER REMOVAL; LOGICAL RELATIONS; PROGRAM TRANSFORMATIONS; PROOF METHODS; RELATIONAL REASONING;

SYNTACTICS;

EID: 0345445926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40018-9_24     Document Type: Article

References (20)

1. W.-N. Chin. Safe fusion of functional expressions II: Further improvements. Journal of Functional Programming, 4(4):515-555, 1994.
2. J. Engelfriet and H. Vogler. Macro tree transducers. Journal of Computer and System Sciences, 31:71-146, 1985.
3. H. Ganzinger and R. Giegerich. Attribute coupled grammars. In Proceedings of the ACM SIGPLAN '84 Symposium on Compiler Construction, volume 19(6) of SIGPLAN Notices, pages 157-170, June 1984.
4. A. Gill, J. Launchbury, and S. Peyton Jones. A short cut to deforestation. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture, pages 223-232. ACM Press, June 1993.
5. The Haskell home page, http://www.haskell.org/.
6. P. Johann. Short cut fusion: Proved and improved. In Semantics, Applications, and Implementation of Program Generation, Second International Workshop: SAIG 2001, volume 2196 of Lecture Notes in Computer Science, pages 47-71. Springer Verlag, 2001.
7. X. Leroy. Unboxed objects and polymorphic typing. In Conference record of the 19th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming, pages 177-188. ACM Press, 1992.
8. Y. Minamide and J. Garrigue. On the runtime complexity of type-directed unboxing. In Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP98), pages 1-12. ACM Press, 1998.
9. J. C. Mitchell. Foundations for Programming Languages. Foundation of Computing Series. The MIT Press, 1996.
10. L. R. Nielsen. A denotational investigation of defunctionalization. Technical Report RS-00-47, BRICS, 2000.
11. S. Nishimura. Deforesting in accumulating parameters via type-directed transformations. In Informal proceedings of Asian Workshop on Programming Languages and Systems 2002 (APLAS'02), 2002. electronic version: http://www.math.kyoto-u.ac.jp/~susumu/papers/aplas02.ps.gz.
12. S. Nishimura. Correctness of a higher-order removal transformation through a relational reasoning. Technical Report Kyoto-Math 2003-06, Kyoto University, 2003. electronic version: http://www.math.kyoto-u.ac.jp/~susumu/papers/aplas03-long.ps.gz.
13. O. Ore. Galois connexions. Transactions of American Mathematical Society, 55:493-513, 1944.
14. A. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10(3):321-359, 2000.
15. J. C. Reynolds. Definitional interpreters for higher-order programming languages. Higher-Order Symbolic Computation, 11(4):363-397, 1998.
16. Reprint from the Proc. of the 25th ACM National Conference (1972).
17. th ACM SIGPLAN/SIGARCH Int. Conf. on Functional Programming Languages and Computer Architecture, FPCA'93, Copenhagen, Denmark, 9-11 June 1993, pages 233-242. ACM Press, 1993.
18. th International Conference on Functional Programming Languages and Computer Architecture, pages 306-313, La Jolla, California, June 1995. ACM SIGPLAN/SIGARCH and IFIP WG2.8, ACM Press.
19. J. Voigtländer. Using circular programs to deforest in accumulating parameters. In K. Asai and W.-N. Chin, editors, ASIAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 126-137. ACM Press, 2002.
20. P. Wadler. Deforestation: transforming programs to eliminate trees. Theoretical Computer Science, 73(2):231-248, June 1990.