AbstractWe study normalization in the simply typed lambda-mu calculus, an extension of lambda calculus with control flow operators. Using an enriched version of the Yoneda embedding, we obtain a categorical normal form function for simply typed lambda-mu terms, which gives a special kind of a call-by-name denotational semantics particularly useful for deciding equalities in the lambda-mu calculus
Abstract. We give a decomposition of the equational theory of call-by-value λ-calculus into a conflu...
We present the first typeful implementation of Normalization by Evaluation for the simply typed lamb...
We present fully abstract encodings of the call-by-name lambda-calculus into HOcore, a minimal highe...
We study normalization in the simply typed lambda-mu calculus, an extension of lambda calculus with ...
AbstractWe study normalization in the simply typed lambda-mu calculus, an extension of lambda calcul...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculus...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculu...
(eng) We investigate some fundamental properties of the reduction relation in the untyped term calcu...
We investigate normalization in call-by-name formulation of λC-cal-culus, a constructive analogue of...
Starting with the idea of reflexive objects in Selinger’s control categories, we define three differ...
We show that the standard normalization-by-evaluation construction for the simply-typed lambda_{bet...
We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a ...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
This is an informal explanation of the main concepts and results of [Sev96]. We consider typed and u...
We introduce a call-by-name lambda-calculus lambdaJ with generalized applications which integrates a...
Abstract. We give a decomposition of the equational theory of call-by-value λ-calculus into a conflu...
We present the first typeful implementation of Normalization by Evaluation for the simply typed lamb...
We present fully abstract encodings of the call-by-name lambda-calculus into HOcore, a minimal highe...
We study normalization in the simply typed lambda-mu calculus, an extension of lambda calculus with ...
AbstractWe study normalization in the simply typed lambda-mu calculus, an extension of lambda calcul...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculus...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculu...
(eng) We investigate some fundamental properties of the reduction relation in the untyped term calcu...
We investigate normalization in call-by-name formulation of λC-cal-culus, a constructive analogue of...
Starting with the idea of reflexive objects in Selinger’s control categories, we define three differ...
We show that the standard normalization-by-evaluation construction for the simply-typed lambda_{bet...
We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a ...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
This is an informal explanation of the main concepts and results of [Sev96]. We consider typed and u...
We introduce a call-by-name lambda-calculus lambdaJ with generalized applications which integrates a...
Abstract. We give a decomposition of the equational theory of call-by-value λ-calculus into a conflu...
We present the first typeful implementation of Normalization by Evaluation for the simply typed lamb...
We present fully abstract encodings of the call-by-name lambda-calculus into HOcore, a minimal highe...