Results 1  10
of
1,262
Explicit substitutions
, 1996
"... The λσcalculus is a refinement of the λcalculus where substitutions are manipulated explicitly. The λσcalculus provides a setting for studying the theory of substitutions, with pleasant mathematical properties. It is also a useful bridge between the classical λcalculus and concrete implementatio ..."
Abstract

Cited by 438 (15 self)
 Add to MetaCart
The λσcalculus is a refinement of the λcalculus where substitutions are manipulated explicitly. The λσcalculus provides a setting for studying the theory of substitutions, with pleasant mathematical properties. It is also a useful bridge between the classical λcalculus and concrete
Linear Explicit Substitutions
 In Proc. of Westapp'98
, 1998
"... The oecalculus adds explicit substitutions to the calculus so as to provide a theoretical framework within which the implementation of functional programming languages can be studied. This paper generalises the oecalculus to provide a linear calculus of explicit substitutions, called xDILL, which ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
The oecalculus adds explicit substitutions to the calculus so as to provide a theoretical framework within which the implementation of functional programming languages can be studied. This paper generalises the oecalculus to provide a linear calculus of explicit substitutions, called x
Explicit Substitutions and Programming Languages
 In 19th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS
, 1999
"... Abstract. The λcalculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get finer properties with respect to gradual implementations of substitutions as effectively done in runtimes of progr ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Abstract. The λcalculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get finer properties with respect to gradual implementations of substitutions as effectively done in runtimes
Explicit Substitutions for Objects and Functions
, 1998
"... This paper proposes an implementation of objects and functions via a calculus with explicit substitutions which is confluent and preserves strong normalization. The source calculus corresponds to the combination of the \sigmacalculus of Abadi and Cardelli [AC96] and the \lambdacalculus, and the ta ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper proposes an implementation of objects and functions via a calculus with explicit substitutions which is confluent and preserves strong normalization. The source calculus corresponds to the combination of the \sigmacalculus of Abadi and Cardelli [AC96] and the \lambda
Explicit Substitutions and All That
, 2000
"... Explicit substitution calculi are extensions of the lambdacalculus where the substitution mechanism is internalized into the theory. This feature makes them suitable for implementation and theoretical study of logic based tools as strongly typed programming languages and proof assistant systems. In ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Explicit substitution calculi are extensions of the lambdacalculus where the substitution mechanism is internalized into the theory. This feature makes them suitable for implementation and theoretical study of logic based tools as strongly typed programming languages and proof assistant systems
Explicit Substitutions and Reducibility
 Journal of Logic and Computation
, 2001
"... . We consider reducibility sets dened not by induction on types but by induction on sequents as a tool to prove strong normalization of systems with explicit substitution. To illustrate this point, we give a proof of strong normalization (SN) for simplytyped callbyname ~calculus enriched with op ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
. We consider reducibility sets dened not by induction on types but by induction on sequents as a tool to prove strong normalization of systems with explicit substitution. To illustrate this point, we give a proof of strong normalization (SN) for simplytyped callbyname ~calculus enriched
Intersection types for explicit substitutions
, 2003
"... We present a new system of intersection types for a compositionfree calculus of explicit substitutions with a rule for garbage collection, and show that it characterizes those terms which are strongly normalizing. This system extends previous work on the natural generalization of the classical inte ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
We present a new system of intersection types for a compositionfree calculus of explicit substitutions with a rule for garbage collection, and show that it characterizes those terms which are strongly normalizing. This system extends previous work on the natural generalization of the classical
Categorical models for explicit substitutions
 Proc. of FoSSaCS'99
, 1999
"... This paper concerns itself with the categorical semantics ofcalculi extended with explicit substitutions. For the simplytypedcalculus, indexed categories seem to provide the right categorical framework but because these structures are inherently nonlinear, alternate models are needed for linear ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper concerns itself with the categorical semantics ofcalculi extended with explicit substitutions. For the simplytypedcalculus, indexed categories seem to provide the right categorical framework but because these structures are inherently nonlinear, alternate models are needed for linear
Explicit substitutions for control operators
, 1997
"... Abstract. The calculus is a calculus with a local operator closely related to normalisation procedures in classical logic and control operators in functional programming. We introduce exp, an explicit substitution calculus for , show it preserves strong normalisation and that its simply typed ve ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The calculus is a calculus with a local operator closely related to normalisation procedures in classical logic and control operators in functional programming. We introduce exp, an explicit substitution calculus for , show it preserves strong normalisation and that its simply typed
Dependent Types and Explicit Substitutions
, 1999
"... We present a dependenttype system for a #calculus with explicit substitutions. In this system, metavariables, as well as substitutions, are firstclass objects. We show that the system enjoys properties like type uniqueness, subject reduction, soundness, confluence and weak normalization. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present a dependenttype system for a #calculus with explicit substitutions. In this system, metavariables, as well as substitutions, are firstclass objects. We show that the system enjoys properties like type uniqueness, subject reduction, soundness, confluence and weak normalization.
Results 1  10
of
1,262