This paper develops a type free context calculus lxc. The calculus lxc includes contexts as first-class values andhole-filling as an explicit operation. In lxc holes arerepresented by ordinary variables and hole-filling is represented bythe usual application together with a new abstraction mechanism whichrepresents the variables intended to be bound after filling in thehole. We show that this calculus has desirable properties such asconfluence conservativity over lambda beta calculus and has thepreservation of strong normalization (PSN) property.This paper develops a type free context calculus lxc. The calculus lxc includes contexts as first-class values andhole-filling as an explicit operation. In lxc, holes arerepresented by ordin...
In this paper, we present an explicit substitution calculus which distinguishes between ordinary bou...
We introduce a call-by-name lambda-calculus lambdaJ with generalized applications which integrates a...
International audienceWe present the first typeful implementation of Normalization by Evaluation for...
AbstractThis paper develops a typed calculus for contexts i.e., lambda terms with “holes”. In additi...
This paper develops a typed calculus for contexts i.e., lambda terms with “holes”. In addition to or...
We introduce a simply typed λ-calculus λκε which has both contexts and environments as first-class v...
AbstractWe present the Lambda Context Calculus. This simple lambda-calculus features variables arran...
We present the Lambda Context Calculus. This simple lambda-calculus features variables ar-ranged in ...
The calculus c serves as a general framework for representing contexts. Essential features are contr...
We present a variation of Hindley\u27s completeness theorem for simply typed lambda-calculus. It is ...
AbstractWe present a simple but expressive lambda-calculus whose syntax is populated by variables wh...
(eng) We investigate some fundamental properties of the reduction relation in the untyped term calcu...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
Abstract. We present a formal treatment of normalization by evalua-tion in type theory. The involved...
Ariola et al defined a call-by-need λ-calculus with control, together with a sequent calculus presen...
In this paper, we present an explicit substitution calculus which distinguishes between ordinary bou...
We introduce a call-by-name lambda-calculus lambdaJ with generalized applications which integrates a...
International audienceWe present the first typeful implementation of Normalization by Evaluation for...
AbstractThis paper develops a typed calculus for contexts i.e., lambda terms with “holes”. In additi...
This paper develops a typed calculus for contexts i.e., lambda terms with “holes”. In addition to or...
We introduce a simply typed λ-calculus λκε which has both contexts and environments as first-class v...
AbstractWe present the Lambda Context Calculus. This simple lambda-calculus features variables arran...
We present the Lambda Context Calculus. This simple lambda-calculus features variables ar-ranged in ...
The calculus c serves as a general framework for representing contexts. Essential features are contr...
We present a variation of Hindley\u27s completeness theorem for simply typed lambda-calculus. It is ...
AbstractWe present a simple but expressive lambda-calculus whose syntax is populated by variables wh...
(eng) We investigate some fundamental properties of the reduction relation in the untyped term calcu...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
Abstract. We present a formal treatment of normalization by evalua-tion in type theory. The involved...
Ariola et al defined a call-by-need λ-calculus with control, together with a sequent calculus presen...
In this paper, we present an explicit substitution calculus which distinguishes between ordinary bou...
We introduce a call-by-name lambda-calculus lambdaJ with generalized applications which integrates a...
International audienceWe present the first typeful implementation of Normalization by Evaluation for...