An intuitionistic lambda-calculus with exceptions
Résumé
We introduce a typed lambda-calculus which allows the use of exceptions in the ML style. It is an extension of the system AF2 of Krivine and Leivant ((Krivine, 1990a), (Leivant, 1983)). We show its main properties : confuence, strong normalization and weak subject reduction. The system satisfies the "the proof as program" paradigm as in AF2 . Moreover, the underlined logic of our system is intuitionistic logic.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...