A lambda-calculus with constructors - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

A lambda-calculus with constructors

Résumé

We present an extension of the lambda(eta)-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.
Fichier principal
Vignette du fichier
clam-short.pdf (302.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00150884 , version 1 (03-06-2007)

Identifiants

  • HAL Id : hal-00150884 , version 1

Citer

Ariel Arbiser, Alexandre Miquel, Alejandro Ríos. A lambda-calculus with constructors. RTA'06, 2006, Seattle, United States. pp.181-196. ⟨hal-00150884⟩
55 Consultations
207 Téléchargements

Partager

Gmail Facebook X LinkedIn More