Abstract. We introduce a simply-typed λ-calculus (λ → exn) featuring an ML-like exception handling mechanism. This calculus, whose type system corresponds to classical logic through the Curry-Howard isomorphism, satifies several interesting properties: among other, Church-Rosser, subject reduction, and strong-normalisation. Moreover, its typing system ensures that the reduction of well-typed expressions cannot give rise to uncaught exceptions.
Rapport interne.We study an idealized programming language (lambda-exn) that features a static varia...
In this Version 2, minor improvements are made to Version 1.An algebraic method is used to study the...
Unhandled exceptions crash programs, so a compile-time check that exceptions are handled should in p...
We present in this paper an extension to the ML type system by which it is possible to statically es...
We introduce a typed lambda-calculus which allows the use of exceptions in the ML style. It is an ex...
The exception monad, while an adequate mechanism for providing the denotational semantics of excepti...
We add functional continuations and prompts to a language with an ML-style type system. The operator...
Texte intégral accessible uniquement aux membres de l'Université de LorraineBy analysing the way ML ...
Abstract. We present a uniform framework for defining different λ-typed λ-calculi in terms of system...
Also appears as Fox Memorandum CMU-CS-FOX-95-03. We demonstrate that in the context of statically ty...
International audienceWe introduce a typed lambda-calculus which allows the use of exceptions in the...
We demonstrate that in the context of statically typed pure functional lambda calculi, exceptions ar...
We present a static analysis to automatically generate test data that raise exceptions in the input ...
. By restriction of Felleisen's control operator F we obtain an operator \Delta and a fully co...
AbstractWe propose a new algebraic framework for exception handling which is powerful enough to cope...
Rapport interne.We study an idealized programming language (lambda-exn) that features a static varia...
In this Version 2, minor improvements are made to Version 1.An algebraic method is used to study the...
Unhandled exceptions crash programs, so a compile-time check that exceptions are handled should in p...
We present in this paper an extension to the ML type system by which it is possible to statically es...
We introduce a typed lambda-calculus which allows the use of exceptions in the ML style. It is an ex...
The exception monad, while an adequate mechanism for providing the denotational semantics of excepti...
We add functional continuations and prompts to a language with an ML-style type system. The operator...
Texte intégral accessible uniquement aux membres de l'Université de LorraineBy analysing the way ML ...
Abstract. We present a uniform framework for defining different λ-typed λ-calculi in terms of system...
Also appears as Fox Memorandum CMU-CS-FOX-95-03. We demonstrate that in the context of statically ty...
International audienceWe introduce a typed lambda-calculus which allows the use of exceptions in the...
We demonstrate that in the context of statically typed pure functional lambda calculi, exceptions ar...
We present a static analysis to automatically generate test data that raise exceptions in the input ...
. By restriction of Felleisen's control operator F we obtain an operator \Delta and a fully co...
AbstractWe propose a new algebraic framework for exception handling which is powerful enough to cope...
Rapport interne.We study an idealized programming language (lambda-exn) that features a static varia...
In this Version 2, minor improvements are made to Version 1.An algebraic method is used to study the...
Unhandled exceptions crash programs, so a compile-time check that exceptions are handled should in p...