Results 1  10
of
625,186
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise
Explicit Substitutions for the LambdaMu Calculus
, 1994
"... We present a confluent rewrite system which extents a previous calculus of explicit substitutions for the lambdacalculus [HaLe89] to Parigot's untyped lambdamucalculus [Par91]. This extension embeds the lambdamucalculus as a subtheory, and provides the basis for a theoretical framework to ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present a confluent rewrite system which extents a previous calculus of explicit substitutions for the lambdacalculus [HaLe89] to Parigot's untyped lambdamucalculus [Par91]. This extension embeds the lambdamucalculus as a subtheory, and provides the basis for a theoretical framework
Explicit Substitutions for the LambdaMu Calculus
, 1994
"... We present a con uent rewrite system which extents a previous calculus of explicit substitutions for the lambdacalculus [HaLe89] to Parigot's untyped lambdamucalculus [Par91]. This extension embeds the lambdamucalculus as a subtheory, and provides the basis for a theoretical framework to ..."
Abstract
 Add to MetaCart
We present a con uent rewrite system which extents a previous calculus of explicit substitutions for the lambdacalculus [HaLe89] to Parigot's untyped lambdamucalculus [Par91]. This extension embeds the lambdamucalculus as a subtheory, and provides the basis for a theoretical framework
The theory of calculi with explicit substitutions revisited
 CSL 2007
, 2007
"... Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good computational behaviour of the original systems (with metalevel substitutions) they were implementing. In this paper we fi ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
first survey previous work in the domain by pointing out the motivations and challenges that guided the development of such calculi. Then we use very simple technology to establish a general theory of explicit substitutions for the lambdacalculus which enjoys fundamental properties such as simulation
Fundamental Properties of Lambdacalculus
, 2009
"... 1 Basic definitions of Lambdacalculus 4 1.1 Lambdaterms in de Bruijn notation and substitution.... 4 1.2 Betareduction.......................... 4 ..."
Abstract
 Add to MetaCart
1 Basic definitions of Lambdacalculus 4 1.1 Lambdaterms in de Bruijn notation and substitution.... 4 1.2 Betareduction.......................... 4
Combinatory Reduction Systems with Explicit Substitution
 REWRITING TECHNIQUES AND APPLICATIONS (RTA), LECTURE NOTES IN COMPUTER SCIENCE
, 1996
"... We generalise the notion of explicit substitution from the lambdacalculus to higher order rewriting, realised by combinatory reduction systems (CRS). In this general framework this is achieved by identifying the "explicit" subclass of CRSs within which rewriting can be implemented effici ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
We generalise the notion of explicit substitution from the lambdacalculus to higher order rewriting, realised by combinatory reduction systems (CRS). In this general framework this is achieved by identifying the "explicit" subclass of CRSs within which rewriting can be implemented
The Partial LambdaCalculus
, 1988
"... This thesis investigates various formal systems for reasoning about partial functions or partial elements, with particular emphasis on lambda calculi for partial functions. Beeson's (intuitionistic) logic of partial terms (LPT) is taken as the basic formal system and some of its metamathematica ..."
Abstract

Cited by 35 (4 self)
 Add to MetaCart
This thesis investigates various formal systems for reasoning about partial functions or partial elements, with particular emphasis on lambda calculi for partial functions. Beeson's (intuitionistic) logic of partial terms (LPT) is taken as the basic formal system and some of its
The Algebraic LambdaCalculus
 UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE
, 2009
"... We introduce an extension of the pure lambdacalculus by endowing the set of terms with a structure of vector space, or more generally of module, over a fixed set of scalars. Terms are moreover subject to identities similar to usual pointwise definition of linear combinations of functions with value ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
We introduce an extension of the pure lambdacalculus by endowing the set of terms with a structure of vector space, or more generally of module, over a fixed set of scalars. Terms are moreover subject to identities similar to usual pointwise definition of linear combinations of functions
Twolevel Lambdacalculus
 Electron. Notes Theor. Comput. Sci
, 2009
"... Twolevel lambdacalculus is designed to provide a mathematical model of capturing substitution, also called instantiation. Instantiation is a feature of the ‘informal metalevel’; it appears pervasively in specifications of the syntax and semantics of formal languages. The twolevel lambdacalculus ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Twolevel lambdacalculus is designed to provide a mathematical model of capturing substitution, also called instantiation. Instantiation is a feature of the ‘informal metalevel’; it appears pervasively in specifications of the syntax and semantics of formal languages. The twolevel lambdacalculus
Sharing in the weak lambdacalculus
 In Processes, Terms and Cycles: Steps on the Road
, 2005
"... Abstract. Despite decades of research in the λcalculus, the syntactic properties of the weak λcalculus did not receive great attention. However, this theory is more relevant for the implementation of programming languages than the usual theory of the strong λcalculus. In fact, the frameworks of w ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
of weak explicit substitutions, or computational monads, or λcalculus with a let statement, or supercombinators, were developed for adhoc purposes related to programming language implementation. In this paper, we concentrate on sharing of subterms in a confluent variant of the weak λcalculus. We
Results 1  10
of
625,186