A polymorphic type system for the lambda-calculus with constructors

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

Volumn 5608 LNCS, Issue , 2009, Pages 234-248

  Petit, Barbara ^a  

^a UNIV LYON   (France)

Author keywords

Lambda calculus; Pattern matching; Polymorphism; Strong normalisation

Indexed keywords

INTERPRETATION METHODS; INTERSECTION TYPES; LAMBDA-CALCULUS; NORMAL FORM; NORMALISATION; POLYMORPHIC TYPE SYSTEMS; SECOND ORDERS; STRONG NORMALISATION; VARIADIC;

BIOMINERALIZATION; DIFFERENTIATION (CALCULUS); PATHOLOGY; PATTERN MATCHING; POLYMORPHISM;

CALCULATIONS;

EID: 70350327556     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02273-9_18     Document Type: Conference Paper

References (18)

1. The agda proof assistant, http://wiki.portal.chalmers.se/agda/
2. Arbiser, A., Miquel, A., Ríos, A.: The lambda-calculus with constructors: Syntax, confluence and separation. To appear in JFP (2009)
3. Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and The Foundations of Mathematics, vol. 103. North-Holland, Amsterdam (1984)
4. Barthe, G., Cirstea, H., Kirchner, C., Liquori, L.: Pure patterns type systems. In: POPL, pp. 250-261 (2003)
5. Bertot, Y., Castéran, P.: Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science, vol. 25. EATCS (2004)
6. Bondi, a programming language centred on pattern-matching, http://www-staff.it.uts.edu.au/~cbj/bondi/
7. Cirstea, H., Kirchner, C.: Rho-calculus, its syntax and basic properties. In: 5th International Workshop on Constraints in Computational Logics (1998)
8. Cirstea, H., Kirchner, C., Liquori, L.: The rho cube. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 168-183. Springer, Heidelberg (2001)
9. Girard, J.-Y.: Locus solum: From the rules of logic to the logic of rules. Mathematical Structures in Computer Science 11(3), 301-506 (2001)
10. Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge University Press, Cambridge (1989)
11. Hudak, P., Peyton-Jones, S., Wadler, P.: Report on the programming language Haskell, a non-strict, purely functional language (Version 1.2). Sigplan Notices (1992)
12. Jay, C.B.: The pattern calculus. ACM Transactions on Programming Languages and Systems 26(6), 911-937 (2004)
13. Jay, C.B., Kesner, D.: Pure pattern calculus. In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol. 3924, pp. 100-114. Springer, Heidelberg (2006)
14. Leroy, X.: The objective caml system, http://caml.inria.fr/
15. Milner, R., Tofte, M., Harper, R.: The definition of Standard ML. MIT Press, Cambridge (1990)
16. Mitchell, J.C.: Polymorphic type inference and containment. Inf. Comput. 76(2/3), 211-249 (1988)
17. Riba, C.: On the stability by union of reducibility candidates. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 317-331. Springer, Heidelberg (2007)
18. Terese. Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science (2003)