Results 1  10
of
1,898
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 is introduced, that may jeopardise the ap ..."
Abstract

Cited by 501 (6 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 is introduced, that may jeopardise
Lambda Calculus
"... Abstract: : In this work, we present preliminary study of Lambda Calculus in the field of computability.Originally developed in order to study some mathematical properties of effectively computable functions, this formalism has provided a strong theoretical foundation for the family of functional pr ..."
Abstract
 Add to MetaCart
Abstract: : In this work, we present preliminary study of Lambda Calculus in the field of computability.Originally developed in order to study some mathematical properties of effectively computable functions, this formalism has provided a strong theoretical foundation for the family of functional
Lambda Calculus
, 1997
"... Recursive functions are representable as lambda terms, and de nability in the calculus may be regarded as a de nition of computability. This forms part of the standard foundations of computer science. Lambda calculus is the commonly accepted basis of functional programming languages; and it is folkl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Recursive functions are representable as lambda terms, and de nability in the calculus may be regarded as a de nition of computability. This forms part of the standard foundations of computer science. Lambda calculus is the commonly accepted basis of functional programming languages
Lambda Calculus
"... Alonzo Church in 1930’s introduced lambdacalculus as an alternative (with respect to recursive functions) model of computation. • Lambda Terms • Variables: x, y,... (discrete, denumerableinfinite set) • Application: if T and U are lambdaterms then (T)U is a lambdaterm • Abstraction: if x ia a va ..."
Abstract
 Add to MetaCart
Alonzo Church in 1930’s introduced lambdacalculus as an alternative (with respect to recursive functions) model of computation. • Lambda Terms • Variables: x, y,... (discrete, denumerableinfinite set) • Application: if T and U are lambdaterms then (T)U is a lambdaterm • Abstraction: if x ia a
Lambda Calculus
, 2002
"... Contents Introduction To The Lecture Notes v 1 The Untyped Lambda Calculus 1 1.1 Inductive Definitions . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Terms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 # is a Binding Operator  AlphaConversion . . . . . . . . . 3 1.4 # ..."
Abstract
 Add to MetaCart
Contents Introduction To The Lecture Notes v 1 The Untyped Lambda Calculus 1 1.1 Inductive Definitions . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Terms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 # is a Binding Operator  AlphaConversion . . . . . . . . . 3 1
The Lazy Lambda Calculus
 Research Topics in Functional Programming
, 1990
"... Introduction The commonly accepted basis for functional programming is the calculus; and it is folklore that the calculus is the prototypical functional language in puri ed form. But what is the calculus? The syntax is simple and classical; variables, abstraction and application in the pure cal ..."
Abstract

Cited by 253 (1 self)
 Add to MetaCart
Introduction The commonly accepted basis for functional programming is the calculus; and it is folklore that the calculus is the prototypical functional language in puri ed form. But what is the calculus? The syntax is simple and classical; variables, abstraction and application in the pure
The differential lambdacalculus
, 2003
"... We present an extension of the lambdacalculus with differential constructions. We state and prove some basic results (confluence, strong normalization in the typed case), and also a theorem relating the usual Taylor series of analysis to the linear head reduction of lambdacalculus. ..."
Abstract

Cited by 70 (11 self)
 Add to MetaCart
We present an extension of the lambdacalculus with differential constructions. We state and prove some basic results (confluence, strong normalization in the typed case), and also a theorem relating the usual Taylor series of analysis to the linear head reduction of lambdacalculus.
Lambda Calculus
"... Class meetings per week: 3 hours Lab meetings per week: 0 hours Course Coordinator: Dr. Homer Carlisle Date Prepared: Spring 2010 ..."
Abstract
 Add to MetaCart
Class meetings per week: 3 hours Lab meetings per week: 0 hours Course Coordinator: Dr. Homer Carlisle Date Prepared: Spring 2010
Lambda calculus: models and theories
 Proceedings of the Third AMAST Workshop on Algebraic Methods in Language Processing (AMiLP2003), number 21 in TWLT Proceedings, pages 39–54, University of Twente, 2003. Invited Lecture
"... In this paper we give an outline of recent results concerning theories and models of the untyped lambda calculus. Algebraic and topological methods have been applied to study the structure of the lattice of λtheories, the equational incompleteness of lambda calculus semantics, and the λtheories in ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper we give an outline of recent results concerning theories and models of the untyped lambda calculus. Algebraic and topological methods have been applied to study the structure of the lattice of λtheories, the equational incompleteness of lambda calculus semantics, and the λ
Demonstrating lambda calculus reduction
 The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones, number 2566 in Lecture Notes in Computer Science
, 2002
"... We describe lambda calculus reduction strategies using bigstep operational semantics and show how to efficiently trace such reductions. This is used in a webbased lambda calculus reducer, at ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We describe lambda calculus reduction strategies using bigstep operational semantics and show how to efficiently trace such reductions. This is used in a webbased lambda calculus reducer, at
Results 1  10
of
1,898