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

  • Authors:

  • Ariel Arbiser;Alexandre Miquel;Alejandro RÍos

  • Affiliations:

  • Departamento de computación – facultad de ciencias exactas y naturales, universidad de buenos aires, argentina (e-mail: arbiser@dc.uba.ar);Pps & université paris 7 – case 7014, 2 place jussieu, 75251 paris cedex 05, france (e-mail: alexandre.miquel@pps.jussieu.fr);Departamento de computación – facultad de ciencias exactas y naturales, universidad de buenos aires, argentina (e-mail: rios@dc.uba.ar)

  • Venue:
  • Journal of Functional Programming
  • Year:
  • 2009

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.