A family of syntactic logical relations for the semantics of Haskell-like languages

Information and Computation

Volumn 207, Issue 2, 2009, Pages 341-368

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

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; PATHOLOGY; PATTERN MATCHING;

FINE-GRAINED ANALYSIS; INTERMEDIATE LANGUAGES; LAZY FUNCTIONAL LANGUAGES; LOGICAL RELATIONS; OBSERVATIONAL APPROXIMATION; OBSERVATIONAL EQUIVALENCES; PARAMETRIC POLYMORPHISM; REASONING ABOUT PROGRAMS;

SEMANTICS;

EID: 70350267543     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.11.009     Document Type: Conference Paper

References (30)

1. L. Cardelli, Typeful programming, in: E. Neuhold, M. Paul (Eds.), Formal Description of Programming Concepts, IFIP State of the Art Reports Series, Springer-Verlag, Berlin, 1991, pp. 431-507.
2. S. Peyton Jones (Ed.), Haskell 98 Language and Libraries: The Revised Report, Cambridge University Press, Cambridge, 2003.
3. C. Strachey, Fundamental concepts in programming languages, Lecture notes for a course at the International Summer School in Computer Programming, 1967, Reprint appeared in Higher-Order and Symbolic Computation 13 (1-2) (2000) 11-49.
4. L. Cardelli, P.Wegner, On understanding types, data abstraction, and polymorphism, ACM Computing Surveys 17 (4) (1985) 471-522. (Pubitemid 16612686)
5. J. Reynolds, Types, abstraction and parametric polymorphism, in: Information Processing, Proceedings, Elsevier, 1983, pp. 513-523.
6. H. Friedman, Equality between functionals, in: Logic Colloquium '72-73, Proceedings, Springer-Verlag, Berlin, 1975, pp. 22-37.
7. G. Plotkin, Lambda-definability and logical relations, memorandum SAI-RM-4, University of Edinburgh, 1973.
8. P.Wadler, Theorems for free!, in: Functional Programming Languages and Computer Architecture, Proceedings, ACM Press, 1989, pp. 347-359.
9. A. Gill, J. Launchbury, S. Peyton Jones, A short cut to deforestation, in: Functional Programming Languages and Computer Architecture, Proceedings, ACM Press, 1993, pp. 223-232.
10. O. Chitil, Type inference builds a short cut to deforestation, in: International Conference on Functional Programming, Proceedings, ACM Press, 1999, pp. 249-260.
11. J. Svenningsson, Shortcut fusion for accumulating parameters & zip-like functions, in: International Conference on Functional Programming, Proceedings, ACM Press, 2002, pp. 124-132.
12. J. Voigtländer, Concatenate, reverse and map vanish for free, in: International Conference on Functional Programming, Proceedings, ACM Press, 2002, pp. 14-25.
13. N. Ghani, P. Johann, Monadic augment and generalised short cut fusion, Journal of Functional Programming 17 (6) (2007) 731-776.
14. P. Johann, J. Voigtländer, Free theorems in the presence of seq, in: Principles of Programming Languages, Proceedings, ACM Press, 2004, pp. 99-110.
15. P. Johann, J. Voigtländer, The impact of seq on free theorems-based program transformations, Fundamenta Informaticae 69 (1-2) (2006) 63-102.
16. J. Voigtländer, P. Johann, Selective strictness and parametricity in structural operational semantics, inequationally, Theoretical Computer Science 388 (1-3) (2007) 290-318. (Pubitemid 350052445)
17. A. Pitts, Parametric polymorphism and operational equivalence, Mathematical Structures in Computer Science 10 (3) (2000) 321-359.
18. P. Johann, Short cut fusion is correct, Journal of Functional Programming 13 (4) (2003) 797-814. (Pubitemid 36880235)
19. R. Møgelberg, Interpreting polymorphic FPC into domain theoretic models of parametric polymorphism, in: International Colloquium on Automata, Languages and Programming, Proceedings, LNCS, vol. 4052, Springer-Verlag, Berlin, 2006, pp. 372-383. (Pubitemid 44113262)
20. J. Voigtländer, P. Johann, Selective strictness and parametricity in structural operational semantics, Technical Report TUD-FI06-02, Technische Universität Dresden, 2006.
21. K. Crary, R. Harper, Syntactic logical relations for polymorphic and recursive types, in: Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, ENTCS, vol. 172, Elsevier, 2007, pp. 259-299. (Pubitemid 46367779)
22. A. Ahmed, Step-indexed syntactic logical relations for recursive and quantified types, in: European Symposium on Programming, Proceedings, LNCS, vol. 3924, Springer-Verlag, Berlin, 2006, pp. 69-83. (Pubitemid 44019552)
23. 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.
24. J. Reynolds, Towards a theory of type structure, in: Colloque sur la Programmation, Proceedings, Springer-Verlag, Berlin, 1974, pp. 408-423.
25. A. Pitts, Typed operational reasoning, in: B. Pierce (Ed.), Advanced Topics in Types and Programming Languages, MIT Press, 2005, pp. 245-289.
26. A. Tolmach, An external representation for the GHC core language, Draft, 2001.
27. A. Moran, S. Lassen, S. Peyton Jones, Imprecise exceptions, Co-inductively, in: Higher Order Operational Techniques in Semantics, Proceedings, ENTCS, vol. 26, Elsevier, 1999, pp. 122-141. (Pubitemid 40702307)
28. M. Eekelen, M. Mol, Proof tool support for explicit strictness, in: Implementation and Application of Functional Languages 2005, Selected Papers, LNCS, vol. 4015, Springer-Verlag, Berlin, 2006, pp. 37-54.
29. J. Mitchell, G. Plotkin, Abstract types have existential type, ACM Transactions on Programming Languages and Systems 10 (3) (1988) 470-502.
30. S. Peyton Jones,A.Reid, C. Hoare, S.Marlow, F. Henderson,Asemantics forimprecise exceptions, in: ProgrammingLanguage Design andImplementation, Proceedings, ACM Press, 1999, pp. 25-36.