A Typed Pattern Calculus

Information and Computation

Volumn 124, Issue 1, 1996, Pages 32-61

  Kesner, Delia ^a   Puel, Laurence ^a   Tannen, Val ^b  

^a CNRS   (France)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037842585     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0004     Document Type: Article

References (25)

1. Abadi, M., Cardelli, L., Curien, P.-L., and Lévy, J.-J. (1990). "Explicit Substitutions," Technical Report 54, DEC Systems Research Center.
2. Abramsky, S. (1993). Computational interpretations of linear logic, Theoret. Comput. Sci. 111:3-57.
3. Breazu-Tannen, V., and Subrahmanyam (1991). Logical and computational aspects of programming with sets/bags/lists, in "Proceedings of the 18th International Colloquium on Automata, Languages, and Programming, Madrid, Spain, July 1991," pp. 60-75, Lecture Notes in Computer Science, Vol. 510, Springer-Verlag, Berlin/New York.
4. Burstall, R. M., MacQueen, D. B., and Sanella, D. T. (1980). Hope: An experimental applicative language, in "LISP Conference," pp. 136-143, Stanford University Computer Science Department.
5. Colson, T. (1989). About primitive recursive algorithms, in "Proceedings of the 16th International Colloquium on Automata, Languages, and Programming, Stresa, July 1989," pp. 194-206, Lecture Notes in Computer Science, Vol. 372, Springer-Verlag, Berlin/ New York.
6. Coquand, T. (1992). Pattern matching with dependent types, in "Proceedings of the Workshop on Types for Proofs and Programs, Baastad, June 1992," pp. 66-79; available as pub/baastad/proc.ps.Z on animal.cs.chalmers.se, by anonymous ftp.
7. Field, A., and Harrison, P. (1988). "Functional Programming," Addison-Wesley, Reading, MA.
8. Gallier, J. (1993). Constructive logics. I. A tutorial on proof systems and typed λ-calculi, Theoret. Comput. Sci. 110, 249-339.
9. Girard, J. Y., Lafont, Y., and Taylor, P. (1989). "Proofs and Types," Cambridge Univ. Press, London/New York.
10. Howard, B. T. (1992). "Fixed Points and Extensionality in Typed Functional Programming Languages," Ph.D. thesis, Stanford University, August.
11. Hudak, P., Peyton-Jones, S, Wadler, P., et al. (1992). Report on the programming language Haskell, a non-strict purely functional language. Version 1.2, Sigplan Not. 27.
12. Huet, G., and Levy, J.-J. (1991). Computations in orthogonal rewriting systems. In "Computational Logic, Essays in Honor of Alan Robinson" (Jean-Louis Lassez and Gordon Plotkin, Eds.), MIT Press, Cambridge, MA.
13. Kahn, G. (1987). In "Proceedings Symposium Theoretical Aspects of Computer Science," pp. 22-39, Lecture Notes in Computer Science, Vol. 247, Springer-Verlag, Berlin/New York.
14. Jategaonkar, L. A., and Mitchell, J. C. (1988). Ml with extended pattern matching and subtypes, in "Proceedings of the LISP and Functional Programming Conference," pp. 198-211, Assoc. Comput. Mach., New York.
15. Peyton Jones, S. (1987). "The Implementation of Functional Programming Languages," Prentice-Hall, New York.
16. Lafont, Y. (1989). "Functional Programming and Linear Logic," Lecture notes for the Summer School on Functional Programming and Constructive Logic, Glasgow, September.
17. Leroy, X. (1994). The Caml Light system, Release 0.7 - Documentation and user's manual, INRIA.
18. Milner, R., Tofte, M., and Harper, R. (1990). "The Definition of Standard ML," MIT Press, Cambridge, MA.
19. Ohori, A., and Buneman, O. P. (1988). Type inference in a database programming language, in "Proceedings ACM Conference on LISP and Functional Programming," pp. 174-183, Snowbird, UT, July.
20. van Oostrom, V. (1990). "Lambda calculus with Patterns," IR 228, Vrije Universiteit, Amsterdam, November.
21. Plotkin, G. (1981). "A Structural Approach to Operational Semantics," Technical Report DAIMI FN-19, Aarhus University.
22. Puel, L., and Suárez, A. (1993). Compiling pattern matching by term decomposition, J. Symbolic Comput. 15, No. 1.
23. Rémy, D. (1989). Typechecking records and variants in a natural extension of ml, in "ACM Conference on Principles of Programming Languages" (David MacQueen, Ed.).
24. Turner, D. A. (1985). Miranda: A non-strict functional language with polymorphic types, in "Proceedings of the Conference on Functional Programming Languages and Computer Architecture" (J.-P. Jouannaud, Ed.), pp. 1-16, Lecture Notes in Computer Science, Vol. 201, Springer-Verlag, Berlin/New York.
25. Wadler, P. (1990). Linear types can change the world! In "Programming Concepts and Methods," North-Holland.