Selective strictness and parametricity in structural operational semantics, inequationally

Theoretical Computer Science

Volumn 388, Issue 1-3, 2007, Pages 290-318

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

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Clean; Extensionality principles; Fixpoint recursion; Functional programming languages; Haskell; Identity extension; Lambda calculus; Logical relations; Mixing strict and nonstrict semantics; Parametric polymorphism; Program transformations; seq; Short cut fusion; Theorems for free; Types

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SOFTWARE; CONSTRAINED OPTIMIZATION; SEMANTICS; THEOREM PROVING;

EXTENSIONALITY PRINCIPLES; FIXPOINT RECURSION; HASKELL; IDENTITY EXTENSION; LAMBDA CALCULUS; LOGICAL RELATIONS; PARAMETRIC POLYMORPHISM; PROGRAM TRANSFORMATIONS; SHORT CUT FUSION; THEOREMS FOR FREE;

COMPUTER PROGRAMMING;

EID: 35748935522     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.09.014     Document Type: Article

References (49)

1. Abel A., Benke M., Bove A.L., Hughes R.J.M., and Norell U. Verifying Haskell programs using constructive type theory. Haskell Workshop, Proceedings (2005), ACM Press 62-73
2. Ahmed A. Step-indexed syntactic logical relations for recursive and quantified types. European Symposium on Programming, Proceedings. LNCS vol. 3924 (2006), Springer-Verlag 69-83
3. Bainbridge E.S., Freyd P.J., Scedrov A., and Scott P.J. Functorial polymorphism. Theoretical Computer Science 70 (1990) 35-64
4. Bainbridge E.S., Freyd P.J., Scedrov A., and Scott P.J. Functorial polymorphism. Theoretical Computer Science 71 (1990) 431 (Corrigendum)
5. Birkedal L., Møgelberg R.E., and Petersen R.L. Parametric domain-theoretic models of polymorphic intuitionistic/linear lambda calculus. Mathematical Foundations of Programming Semantics 2005, Proceedings. ENTCS vol. 155 (2006), Elsevier B.V. 191-217
6. Clean Language Report 2.0. http://www.cs.ru.nl/~clean/CleanExtra/report20/index.html
7. Danielsson N.A., Hughes R.J.M., Jansson P., and Gibbons J. Fast and loose reasoning is morally correct. Principles of Programming Languages, Proceedings (2006), ACM Press 206-217
8. Danielsson N.A., and Jansson P. Chasing bottoms - A case study in program verification in the presence of partial and infinite values. Mathematics of Program Construction, Proceedings. LNCS vol. 3125 (2004), Springer-Verlag 85-109
9. van Eekelen M., and de Mol M. Proof tool support for explicit strictness. Implementation and Application of Functional Languages 2005, Selected Papers. LNCS vol. 4015 (2006), Springer-Verlag 37-54
10. Felleisen M., Friedman D.P., Kohlbecker E., and Duba B. A syntactic theory of sequential control. Theoretical Computer Science 52 (1987) 205-237
11. Friedman H. Equality between functionals. Logic Colloquium '72-73, Proceedings (1975), Springer-Verlag 22-37
12. The Glasgow Haskell Compiler. http://www.haskell.org/ghc
13. J.-Y. Girard, Interprétation functionelle et élimination des coupures dans l'arithmétique d'ordre supérieure, Ph.D. Thesis, Université Paris VII, 1972
14. Ghani N., Johann P., Uustalu T., and Vene V. Monadic augment and generalised short cut fusion. International Conference on Functional Programming, Proceedings (2005), ACM Press 294-305
15. Gill A., Launchbury J., and Peyton Jones S.L. A short cut to deforestation. Functional Programming Languages and Computer Architecture, Proceedings (1993), ACM Press 223-232
16. Hasegawa R. Parametricity of extensionally collapsed term models of polymorphism and their categorical properties. Theoretical Aspects of Computer Software, Proceedings. LNCS vol. 526 (1991), Springer-Verlag 495-512
17. Harrison W.L., and Kieburtz R.B. The logic of demand in Haskell. Journal of Functional Programming 15 (2005) 837-891
18. The Haskell Mailing List Archive. http://www.mail-arch ive.com/haskell@haskell.org
19. R. Harper, C. Stone, An interpretation of Standard ML in type theory, Technical Report CMU-CS-97-147, Carnegie Mellon University, 1997
20. Johann P. A generalization of short-cut fusion and its correctness proof. Higher-order and Symbolic Computation 15 (2002) 273-300
21. Johann P. Short cut fusion is correct. Journal of Functional Programming 13 (2003) 797-814
22. Johann P. On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi. Mathematical Structures in Computer Science 15 (2005) 201-229
23. Johann P., and Voigtländer J. Free theorems in the presence of seq. Principles of Programming Languages, Proceedings (2004), ACM Press 99-110
24. Johann P., and Voigtländer J. The impact of seq on free theorems-based program transformations. Fundamenta Informaticae 69 (2006) 63-102
25. S.B. Lassen, Relational reasoning about functions and nondeterminism, Ph.D. Thesis, University of Aarhus, 1998
26. Leivant D. Polymorphic type inference. Principles of Programming Languages, Proceedings (1983), ACM Press 88-98
27. Launchbury J., and Paterson R. Parametricity and unboxing with unpointed types. European Symposium on Programming, Proceedings (1996), Springer-Verlag 204-218
28. Møgelberg R.E. Interpreting polymorphic FPC into domain theoretic models of parametric polymorphism. International Colloquium on Automata, Languages and Programming, Proceedings. LNCS vol. 4052 (2006), Springer-Verlag 372-383
29. Mitchell J.C., and Plotkin G.D. Abstract types have existential type. ACM Transactions on Programming Languages and Systems 10 (1988) 470-502
30. In: Peyton Jones S.L. (Ed). Haskell 98 Language and Libraries: The Revised Report (2003), Cambridge University Press
31. Pitts A.M. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science 10 (2000) 321-359
32. Pitts A.M. Typed operational reasoning. In: Pierce B.C. (Ed). Advanced Topics in Types and Programming Languages (2005), MIT Press 245-289
33. G.D. Plotkin, Lambda-definability and logical relations, Memorandum SAI-RM-4, University of Edinburgh, 1973
34. Plotkin G.D. A structural approach to operational semantics. Journal of Logic and Algebraic Programming 60-61 (2004) 17-139
35. Peyton Jones S.L., Launchbury J., Shields M.B., and Tolmach A.P. Bridging the gulf: A common intermediate language for ML and Haskell. Principles of Programming Languages, Proceedings (1998), ACM Press 49-61
36. Reynolds J.C. Towards a theory of type structure. Colloque sur la Programmation, Proceedings (1974), Springer-Verlag 408-423
37. Reynolds J.C. Types, abstraction and parametric polymorphism. Information Processing, Proceedings (1983), Elsevier Science Publishers B.V. 513-523
38. Rudiak-Gould B., Mycroft A., and Peyton Jones S.L. Haskell is not not ML. European Symposium on Programming, Proceedings. LNCS vol. 3924 (2006), Springer-Verlag 38-53
39. Robinson E.P., and Rosolini G. Reflexive graphs and parametric polymorphism. Logic in Computer Science, Proceedings (1994), IEEE Computer Society Press 364-371
40. G. Rosolini, A. Simpson, Using synthetic domain theory to prove operational properties of a polymorphic programming language based on strictness 2004 (manuscript)
41. Statman R. Logical relations and the typed lambda-calculus. Information and Control 65 (1985) 85-97
42. Svenningsson J. Shortcut fusion for accumulating parameters & zip-like functions. International Conference on Functional Programming, Proceedings (2002), ACM Press 124-132
43. Trinder P.W., Hammond K., Loidl H.-W., and Peyton Jones S.L. Algorithm + Strategy = Parallelism. Journal of Functional Programming 8 (1998) 23-60
44. Takano A., and Meijer E. Shortcut deforestation in calculational form. Functional Programming Languages and Computer Architecture, Proceedings (1995), ACM Press 306-313
45. J. Voigtländer, P. Johann, Selective strictness and parametricity in structural operational semantics, Technical Report TUD-FI06-02, Technische Universität Dresden, 2006
46. Voigtländer J. Concatenate, reverse and map vanish for free. International Conference on Functional Programming, Proceedings (2002), ACM Press 14-25
47. Vytiniotis D., Weirich S., and Peyton Jones S.L. Boxy types: Inference for higher-rank types and impredicativity. International Conference on Functional Programming, Proceedings (2006), ACM Press 251-262
48. Wadler P. Theorems for free!. Functional Programming Languages and Computer Architecture, Proceedings (1989), ACM Press 347-359
49. Wadler P., and Blott S. How to make ad-hoc polymorphism less ad hoc. Principles of Programming Languages, Proceedings (1989), ACM Press 60-76