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
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculu...
Em publicaçãoWe study monadic translations of the call-by-name (cbn) and the call-by-value (cbv) fra...
http://www.acm.orgInternational audienceWe present the lambda-bar-mu-mu-tilde-calculus, a syntax for...
AbstractWe study normalization in the simply typed lambda-mu calculus, an extension of lambda calcul...
We study normalization in the simply typed lambda-mu calculus, an extension of lambda calculus with ...
We show that the standard normalization-by-evaluation construction for the simply-typed lambda_{bet...
We present the first typeful implementation of Normalization by Evaluation for the simply typed lamb...
We show that the standard normalization-by-evaluation construction for the simply-typed lambda_{bet...
The lambda-calculus with generalized applications is the Curry-Howard counterpart to the system of n...
The lambda-calculus with generalized applications is the Curry-Howard counterpart to the system of n...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculus...
Recently, a standardization theorem has been proven for a variant of Plotkin\u27s call-by-value lamb...
AbstractBuilding on previous work by Mints, Buchholz and Schwichtenberg, a simplified version of con...
We investigate normalization in call-by-name formulation of λC-cal-culus, a constructive analogue of...
International audienceThere is a correspondence between classical logic and programming language cal...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculu...
Em publicaçãoWe study monadic translations of the call-by-name (cbn) and the call-by-value (cbv) fra...
http://www.acm.orgInternational audienceWe present the lambda-bar-mu-mu-tilde-calculus, a syntax for...
AbstractWe study normalization in the simply typed lambda-mu calculus, an extension of lambda calcul...
We study normalization in the simply typed lambda-mu calculus, an extension of lambda calculus with ...
We show that the standard normalization-by-evaluation construction for the simply-typed lambda_{bet...
We present the first typeful implementation of Normalization by Evaluation for the simply typed lamb...
We show that the standard normalization-by-evaluation construction for the simply-typed lambda_{bet...
The lambda-calculus with generalized applications is the Curry-Howard counterpart to the system of n...
The lambda-calculus with generalized applications is the Curry-Howard counterpart to the system of n...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculus...
Recently, a standardization theorem has been proven for a variant of Plotkin\u27s call-by-value lamb...
AbstractBuilding on previous work by Mints, Buchholz and Schwichtenberg, a simplified version of con...
We investigate normalization in call-by-name formulation of λC-cal-culus, a constructive analogue of...
International audienceThere is a correspondence between classical logic and programming language cal...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculu...
Em publicaçãoWe study monadic translations of the call-by-name (cbn) and the call-by-value (cbv) fra...
http://www.acm.orgInternational audienceWe present the lambda-bar-mu-mu-tilde-calculus, a syntax for...