The -λ Calculus with constructors: Syntax, confluence and separation

Journal of Functional Programming

Volumn 19, Issue 5, 2009, Pages 581-631

  Arbiser, Ariel ^a   Miquel, Alexandre ^b   Ros, Alejandro ^a  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CHURCH-ROSSER PROPERTY; CONSTRUCTION PERMITS; DIVIDE-AND-CONQUER TECHNIQUE; REDUCTION RULES; SEMI-AUTOMATICS; SEPARATION THEOREM;

PATTERN MATCHING;

CALCULATIONS;

EID: 74049112161     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796809007369     Document Type: Article

References (17)

1. Arbiser, A., Miquel, A. & Ŕios, A. (2006) A λ-calculus with constructors. In Lecture Notes in Computer Science Volume4098. International Conference of Rewriting Techniques and Applications. Springer-Verlag.
2. Baader, F. & Nipkow, T. (1999) Rewriting and All That. Addison-Wesley.
3. Barendregt, H. (1984) The lambda calculus: Its syntax and semantics., In Studies in Logic and The Foundations of Mathematics, J. Barwise, D. Kaplan, H. J. Keisler, P. Suppes and A. S. Troelstra (eds), vol.103. North-Holland.
4. B̈ohm, C., Dezani-Ciancaglini, M., Peretti, P. & Ronchi Della Rocha, S. (1979) A discrimination algorithm inside lambda-beta-calculus. Theor. Comput. Sci., 8 (3): 265-291.
5. Cerrito, S. & Kesner, D. (1999) Pattern matching as cut elimination. In Logics In Computer Science (LICS'99), IEEE Computer Society, pp. 98-108.
6. Church, A. (1941) The calculi of lambda-conversion. In Annals of Mathematical Studies, vol.6. Princeton.
7. Cirstea, H. & Kirchner, C. (1998) Rho-calculus, the rewriting calculus. In Fifth International Workshop on Constraints in Computational Logics, Jerusalem, Israel.
8. Girard, J.-Y. (2001) Locus solum: From the rules of logic to the logic of rules. Math. Struct. Comput. Sci., 11 (3): 301-506.
9. Hudak, P., Peyton-Jones, S. & Wadler, P. (1992) Report on the programming language Haskell, a non-strict, purely functional language (Version 1.2). Sigplan Notices.
10. Jay, C. B. (2004) The pattern calculus. ACM Trans. Program. Lang. Syst., 26 (6): 911-937.
11. Jay, C. B. & Kesner, D. (2006) Pure pattern calculus. In Lecture Notes in Computer Science, Sestoft, P. (ed), vol.3924. Springer, pp. 100-114.
12. Kahl, W. (2003) Basic pattern matching calculi: Syntax, reduction, confluence, and normalisation. In Technical Report 16, Software Quality Research Laboratory, McMaster University.
13. Leroy, X. et al. (2008) The Objective Caml system release 3.11. Documentation and user's manual. http://caml.inria.fr/.
14. Milner, R., Tofte, M. & Harper, R. (1990) The Definition of Standard ML. MIT Press.
15. Ŕios, A. (1993) Contribution ̀a l'́etude des λ-calculs avec substitutions explicites. PhD thesis, Universit́e Paris 7.
16. Terese. (2003) Term Rewriting Systems, Marc Bezem, Jan Willem Klop and Roel de Vrijer (eds), Cambridge University Press. Cambridge Tracts in Theoretical Computer Science 55.
17. van Oostrom, V. (1990) Lambda calculus with patterns. In Technical Report IR-228, Vrije Universiteit.