Add to ORKGThe calculus c serves as a general framework for representing contexts. Essential features are control over variable capturing and the freedom to manipulate contexts before or after hole lling, by a mechanism of delayed substitution. The context calculus c is given in the form of an extension of the lambda calculus. Many notions of context can be represented within the framework; a particular variation can be obtained by the choice of a pretyping, which we illustrate by three examples. 1
We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissi...
International audienceIn this paper, we present an explicitly typed version of the Lambda Calculus o...
These notes discuss formalizing contexts as first class objects. The basic relationships are: ist(c...
AbstractThis paper develops a typed calculus for contexts i.e., lambda terms with “holes”. In additi...
We present the Lambda Context Calculus. This simple lambda-calculus features variables ar-ranged in ...
AbstractWe present the Lambda Context Calculus. This simple lambda-calculus features variables arran...
This paper develops a typed calculus for contexts i.e., lambda terms with “holes”. In addition to or...
AbstractWe present a simple but expressive lambda-calculus whose syntax is populated by variables wh...
This paper develops a type free context calculus lxc. The calculus lxc includes contexts as first-...
We introduce a simply typed λ-calculus λκε which has both contexts and environments as first-class v...
The goal of this report is to prove correctness of a considerable subset of transformations w.r.t. c...
We present a variation of Hindley\u27s completeness theorem for simply typed lambda-calculus. It is ...
This paper presents the integration into the GIPSY of Lucx’s context calculus defined in Wan’s PhD t...
Abstract. The goal of this report is to prove correctness of a considerable subset of transformation...
(eng) We present a confluent rewriting system wich extends a previous calculus for the Lambda-Calcul...
We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissi...
International audienceIn this paper, we present an explicitly typed version of the Lambda Calculus o...
These notes discuss formalizing contexts as first class objects. The basic relationships are: ist(c...
AbstractThis paper develops a typed calculus for contexts i.e., lambda terms with “holes”. In additi...
We present the Lambda Context Calculus. This simple lambda-calculus features variables ar-ranged in ...
AbstractWe present the Lambda Context Calculus. This simple lambda-calculus features variables arran...
This paper develops a typed calculus for contexts i.e., lambda terms with “holes”. In addition to or...
AbstractWe present a simple but expressive lambda-calculus whose syntax is populated by variables wh...
This paper develops a type free context calculus lxc. The calculus lxc includes contexts as first-...
We introduce a simply typed λ-calculus λκε which has both contexts and environments as first-class v...
The goal of this report is to prove correctness of a considerable subset of transformations w.r.t. c...
We present a variation of Hindley\u27s completeness theorem for simply typed lambda-calculus. It is ...
This paper presents the integration into the GIPSY of Lucx’s context calculus defined in Wan’s PhD t...
Abstract. The goal of this report is to prove correctness of a considerable subset of transformation...
(eng) We present a confluent rewriting system wich extends a previous calculus for the Lambda-Calcul...
We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissi...
International audienceIn this paper, we present an explicitly typed version of the Lambda Calculus o...
These notes discuss formalizing contexts as first class objects. The basic relationships are: ist(c...