Results 1  10
of
92,974
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
On Constructor Rewrite Systems and the LambdaCalculus
, 2009
"... We prove that orthogonal constructor term rewrite systems and lambdacalculus with weak (i.e., no reduction is allowed under the scope of a lambdaabstraction) callbyvalue reduction can simulate each other with a linear overhead. In particular, weak callbyvalue betareduction can be simulated by ..."
Abstract
 Add to MetaCart
We prove that orthogonal constructor term rewrite systems and lambdacalculus with weak (i.e., no reduction is allowed under the scope of a lambdaabstraction) callbyvalue reduction can simulate each other with a linear overhead. In particular, weak callbyvalue betareduction can be simulated
Semantics of typed lambdacalculus with constructors
 Logical Methods in Computer Science
"... Vol. 7 (1:2) 2010, pp. 1–24 www.lmcsonline.org ..."
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
of LPT are introduced for reasoning about partial terms with a restriction operator (LPT + ¯), monotonic partial functions (monLPT), terms ( p calculus) and Yterms ( p ¯Ycalculus). The expressive powers of some (in)equational fragments are compared in LPT and its variants. Two equational formal
Trust in the LambdaCalculus
, 1995
"... . This paper introduces trust analysis for higherorder languages. Trust analysis encourages the programmer to make explicit the trustworthiness of data, and in return it can guarantee that no mistakes with respect to trust will be made at runtime. We present a confluent calculus with explicit tr ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
. This paper introduces trust analysis for higherorder languages. Trust analysis encourages the programmer to make explicit the trustworthiness of data, and in return it can guarantee that no mistakes with respect to trust will be made at runtime. We present a confluent calculus with explicit
The LambdaCalculus with Multiplicities
, 1993
"... We introduce a refinement of the λcalculus, where the argument of a function is a bag of resources, that is a multiset of terms, whose multiplicities indicate how many copies of them are available. We show that this "λcalculus with multiplicities" has a natural functionality theory, simi ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
We introduce a refinement of the λcalculus, where the argument of a function is a bag of resources, that is a multiset of terms, whose multiplicities indicate how many copies of them are available. We show that this "λcalculus with multiplicities" has a natural functionality theory
Orthogonality and Algebraic LambdaCalculus
"... Directly encoding lambdaterms on quantum strings while keeping a quantum interpretation is a hard task. As shown by van Tonder (2004), requiring a unitary reduction forces the lambdaterms in superposition to be mostly equivalent. Following instead (Arrighi and DíazCaro, 2009), we show in this not ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
in this note how one can conceive a lambdacalculus with algebraic features and that admits a general notion of orthogonality among lambdaterms, by providing a compiler of the system into unitary maps. 1
An Illative LambdaCalculus
"... This is an approach to illative lambdacalculi via construction of an infinitary calculus in a wellfounded set theory. Created 2010/09/07 ..."
Abstract
 Add to MetaCart
This is an approach to illative lambdacalculi via construction of an infinitary calculus in a wellfounded set theory. Created 2010/09/07
Confluence of the Coinductive LambdaCalculus
, 2003
"... Abstract The coinductive *calculus \Lambda co arises by a coinductive interpretation of the grammar of the standard *calculus \Lambda and contains nonwellfounded *terms. An appropriate notion of reduction is analyzed and proven to be confluent by means of a detailed analysis of the usual Tait/Ma ..."
Abstract
 Add to MetaCart
Abstract The coinductive *calculus \Lambda co arises by a coinductive interpretation of the grammar of the standard *calculus \Lambda and contains nonwellfounded *terms. An appropriate notion of reduction is analyzed and proven to be confluent by means of a detailed analysis of the usual Tait
Typing of Selective lambdaCalculus
, 1993
"... Record calculi have recently been a very active field of research, but its reciprocal, i.e. the use of keywords in functions, is still ignored. Selective calculus is a conservative extension of lambda calculus which, by labeling abstractions and applications, enables some form of commutation betwee ..."
Abstract
 Add to MetaCart
Record calculi have recently been a very active field of research, but its reciprocal, i.e. the use of keywords in functions, is still ignored. Selective calculus is a conservative extension of lambda calculus which, by labeling abstractions and applications, enables some form of commutation
Results 1  10
of
92,974