A lambda-calculus with constructors

Authors:
Ariel Arbiser;Alexandre Miquel;Alejandro Ríos
Affiliations:
Departamento de Computación – Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Argentina;PPS & Université Paris 7 – Case 7014, PARIS, France;Departamento de Computación – Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Argentina
Venue:
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Year:
2006

Citing 4
Cited 2

The Definition of Standard ML

The Definition of Standard ML
Pattern Matching as Cut Elimination

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Locus Solum: From the rules of logic to the logic of rules

Mathematical Structures in Computer Science
The pattern calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)

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

Journal of Functional Programming
Confluence of pattern-based calculi

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an extension of the λ(η)-calculus with a case construct that propagates through functions like a head linear substitution, and show that this construction permits to recover the expressiveness of ML-style pattern matching. We then prove that this system enjoys the Church-Rosser property using a semi-automatic ‘divide and conquer' technique by which we determine all the pairs of commuting subsystems of the formalism (considering all the possible combinations of the nine primitive reduction rules). Finally, we prove a separation theorem similar to Böhm's theorem for the whole formalism.