Results 1  10
of
2,456,748
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
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
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
Atomic lambdacalculus:
"... This version is made available in accordance with publisher policies. Please cite only the published version using the reference above. See ..."
Abstract
 Add to MetaCart
This version is made available in accordance with publisher policies. Please cite only the published version using the reference above. See
The lambdacalculus is nominal algebraic
"... The λcalculus is fundamental in the study of logic and computation. Partly this is because it is a tool to study functions and functions are an important object of study in this field. Partly this is because the λcalculus seems to be, for homo sapiens, an ergonomic formal syntax. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The λcalculus is fundamental in the study of logic and computation. Partly this is because it is a tool to study functions and functions are an important object of study in this field. Partly this is because the λcalculus seems to be, for homo sapiens, an ergonomic formal syntax.
Trust in the LambdaCalculus
 Journal of Functional Programming
, 1993
"... 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 trus ..."
Abstract
 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
..., Constructive Reals and lambdaCalculus
, 1999
"... Contents 0 Introduction 5 1 HA # and constructive reals 7 1.1 HA # (9.1.1  9.1.14) . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.1.1 #terms in HA # . . . . . . . . . . . . . . . . . . . . . . . . 11 1.1.2 The theories E HA # , I HA # . . . . . . . . . . . . . . . 12 1.1.3 Em ..."
Abstract
 Add to MetaCart
Contents 0 Introduction 5 1 HA # and constructive reals 7 1.1 HA # (9.1.1  9.1.14) . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.1.1 #terms in HA # . . . . . . . . . . . . . . . . . . . . . . . . 11 1.1.2 The theories E HA # , I HA # . . . . . . . . . . . . . . . 12 1.1.3 Embedding of HA in HA # . . . . . . . . . . . . . . . . . . 13 1.2 Constructive real numbers (5.1  5.4, 6.1) . . . . . . . . . . . . . 15 1.2.1 Introduction of Z in HA, HA # (5.1.1) . . . . . . . . . . . 15 1.2.2 Introduction of Q in HA, HA # (5.1.1) . . . . . . . . . . . 15 1.2.3 Principal ideas for embedding R into HA # (5.1.2) . . . . . 16 1.2.4 Theory in which the following can be formalized . . . . . 17 1.2.5 Introduction of<F13.3
A classical linear lambdacalculus
, 1996
"... This paper proposes and studies a typed calculus for classical linear logic. I shall give an explanation of a multipleconclusion formulation for classical logic due to Parigot and compare it to more traditional treatments by Prawitz and others. I shall use Parigot's method to devise a natural ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
This paper proposes and studies a typed calculus for classical linear logic. I shall give an explanation of a multipleconclusion formulation for classical logic due to Parigot and compare it to more traditional treatments by Prawitz and others. I shall use Parigot's method to devise a
LambdaCalculus and Functional Programming tions.
"... The lambdacalculus is a formalism for representing funcBy the second half of the nineteenth century, the concept of function as used in mathematics had reached the point at which the standard notation had become ambiguous. For example, consider the operator P defined on real functions as follows: ..."
Abstract
 Add to MetaCart
The lambdacalculus is a formalism for representing funcBy the second half of the nineteenth century, the concept of function as used in mathematics had reached the point at which the standard notation had become ambiguous. For example, consider the operator P defined on real functions as follows
Results 1  10
of
2,456,748