Free theorems in the presence of seq

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn 31, Issue , 2004, Pages 99-110

  Johann, Patricia ^a   Voigtländer, Janis ^b  

^a RUTGERS UNIVERSITY   (United States)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Controlling strict evaluation; Correctness proofs; Denotational semantics; Haskell; Logical relations; Parametricity; Program transformations; Short cut fusion; Theorems for free

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL MODELS; PERFORMANCE; PROBLEM SOLVING; THEOREM PROVING;

FREE THEOREMS; PARAMETRIC POLYMORPHISMS; PROGRAM TRANSFORMATIONS; SHORT CUT FUSIONS;

COMPUTER SCIENCE;

EID: 2442615040     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/964001.964010     Document Type: Conference Paper

References (24)

1. The Haskell Mailing List Archive (http://wwv.mail-archive.com/ haskell@haskell.org).
2. The Types Forum List Archive (http://www.cis.upenn.edu/~bcpierce/types/ archives), message/current/msg00847.html.
3. O. Chitil. Type inference builds a short cut to deforestation. In ICFP'99, Proc., pages 249-260. ACM Press.
4. S. Cosmadakis, A. Meyer, and J. Riecke. Completeness for typed lazy inequalities. In LICS'90, Proc., pages 312-320. IEEE Computer Society Press.
5. H. Friedman. Equality between functionals. In Logic Colloquium '72-73, Proc., pages 22-37. Springer-Verlag.
6. A. Gill, J. Launchbury, and S. Peyton Jones. A short cut to deforestation. In FPCA'93, Proc., pages 223-232. ACM Press.
7. J.-Y. Girard. Interprétation functionelle et élimination des coupures dans l'arithmétique d'ordre supérieure. PhD thesis, Université Paris VII, 1972.
8. P. Johann. On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi. To appear in Math. Struct, in Comp. Sci.
9. P. Johann. A generalization of short-cut fusion and its correctness proof. Higher-Order and Symb. Comp., 15:273-300, 2002.
10. P. Johann. Short cut fusion is correct. J. Funct. Prog., 13:797-814, 2003.
11. J. Launchbury and R. Paterson. Parametricity and unboxing with unpointed types. In ESOP'96, Proc., pages 204-218. Springer-Verlag.
12. S. Peyton Jones, editor. Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, 2003.
13. S. Peyton Jones, J. Launchbury, M. Shields, and A. Tolmach. Bridging the gulf: A common intermediate language for ML and Haskell. In POPL'98, Proc., pages 49-61. ACM Press.
14. A. Pitts. Parametric polymorphism and operational equivalence. Math. Struct. in Comp. Sci., 10:321-359, 2000.
15. G. Plotkin. Lambda-definabilcity and logical relations. Memorandum SAI-RM-4, University of Edinburgh, 1973.
16. J. Reynolds. Towards a theory of type structure. In Colloque sur la Programmation '74, Proc., pages 408-423. Springer-Verlag.
17. J. Reynolds. Types, abstraction and parametric polymorphism. In Information Processing '83, Proc., pages 513-523. Elsevier Science Publishers B.V.
18. D. Schmidt. Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, 1986.
19. R. Statman. Logical relations and the typed lambda-calculus. Inf. and Control, 65:85-97, 1985.
20. J. Svenningsson. Shortcut fusion for accumulating parameters & zip-like functions. In/CFP'02, Proc., pages 124-132. ACM Press.
21. P. Trinder, K. Hammond, H.-W. Loidl, and S. Peyton Jones. Algorithm + Strategy = Parallelism. /. Funct. Prog., 8:23-60, 1998.
22. J. Voigtländer. Concatenate, reverse and map vanish for free. In ICFP'02, Proc., pages 14-25. ACM Press.
23. P. Wadler. Theorems for free! In FPCA'89, Proc., pages 347-359. ACM Press.
24. P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad hoc. In POPL'89, Proc., pages 60-76. ACM Press.