HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

A Modal Lambda Calculus with Iteration and Case Constructs

Pierre Leleu 1
1 CROAP - Design and Implementation of Programming Tools
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : An extension of the simply-typed $\lambda$-calculus allowing iteration and casereasoning over terms defined by means of higher order abstract syntax has recently been introduced by Joëlle Despeyroux, Frank Pfenning and Carsten Schürmann. This thorny mixing is achieved thanks to the help of the operator `$\Bf modal logic IS4. Here we give a new presentation of their system, with reduction rules, instead of evaluation judgments, that compute the canonical forms of terms. Our presentation is based on a modal $\lambda$-calcu- lus that is better from the user's point of view, is more concise and we do not impose a particular strategy of reduction during the computation. Our system enjoys the decidability of typability, soundness of typed reduction with respect to typing rules, the Church-Rosser and strong normalization properties. Finally itis a conservative extension of the simply-typed $\lambda$-calculus.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 12:38:12 PM
Last modification on : Friday, February 4, 2022 - 3:18:53 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:52:20 PM


  • HAL Id : inria-00073367, version 1



Pierre Leleu. A Modal Lambda Calculus with Iteration and Case Constructs. RR-3322, INRIA. 1997. ⟨inria-00073367⟩



Record views


Files downloads