Results 1  10
of
49,501
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
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
the algorithm to find it. This, combined with the fact selective calculus extends naturally lambda calculus, giving numeric labels their intuitive meaning, provides us with a keyword extension for polymorphically typed languages like ML, compatible with the original syntax, where unlabeled abstractions
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
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
A LambdaCalculus for Dynamic Binding
 Theoretical Computer Science
, 1997
"... This paper proposes N , a compact extension of the calculus to model dynamic binding, where variables are labelled by names, and where arguments are passed to functions along named channels. The resulting formalism preserves familiar properties of the calculus, has a Currystyle type inference sys ..."
Abstract

Cited by 36 (2 self)
 Add to MetaCart
This paper proposes N , a compact extension of the calculus to model dynamic binding, where variables are labelled by names, and where arguments are passed to functions along named channels. The resulting formalism preserves familiar properties of the calculus, has a Currystyle type inference
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
A theory of type polymorphism in programming
 Journal of Computer and System Sciences
, 1978
"... The aim of this work is largely a practical one. A widely employed style of programming, particularly in structureprocessing languages which impose no discipline of types, entails defining procedures which work well on objects of a wide variety. We present a formal type discipline for such polymorp ..."
Abstract

Cited by 1081 (1 self)
 Add to MetaCart
for such polymorphic procedures in the context of a simple programming language, and a compile time typechecking algorithm w which enforces the discipline. A Semantic Soundness Theorem (based on a formal semantics for the language) states that welltype programs cannot “go wrong ” and a Syntactic Soundness Theorem
A labelselective lambdacalculus with optional arguments and its compilation method
 RIMS Preprint 1041, Research Instit. for Mathematical Sciences, Kyoto Univ
, 1995
"... The use of labels for argument passing has proved to be a useful extension to programming languages, particularly when we introduce optional arguments. We propose here an adaptation of such a system, as can be found in Common LISP, to stronglytyped curried functional languages. For this we extend M ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
MLstyle polymorphic typing to labeled arguments, outoforder application, and optional arguments. We also provide a compilation method towards polymorphic lambdacalculus, which is proved syntactically sound for free reduction, and semantically correct for callbyname semantics. We implemented it
A Security Kernel Based on the LambdaCalculus
, 1995
"... 2 A Security Kernel Based on the LambdaCalculus by Jonathan Allen Rees ..."
Results 1  10
of
49,501