Add to ORKGAbstract: : 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 programming languages. We show how to perform some arithmetical computations using the lambda calculus and how to dene recursive functions, even though functions in lambda calculus are not given names and thus cannot refer explicitly to themselves
We consider the interaction of recursion with extensional data types in several typed functional pro...
We introduce a concept of computability relative to a structure, which specifies which functions on ...
We show that the full PCF language can be encoded in L_rec, a syntactically linear λ-calculus extend...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
In this master thesis we investigate lambda calculus and the theory of combinatory logic. Two comput...
This paper introduces a sequence of lambda-expressions, modelling the binaryexpansion of integers. W...
The earliest statement of Church’s Thesis, from Church (1936) p356 is\ud \ud We now define the notio...
The lambda calculus has frequently been used as an intermediate representation for programming langu...
This paper introduces a sequence of lambda-expressions modelling the binary expansion of integers. W...
Giuseppe Longo. The Lambda-Calculus: connections to higher type Recursion Theory, Proof-Theory, Cat...
Lambda račun sve više i više postaje tema istraživanja kako u matematici tako i u računarstvu. Teor...
untyped lambda calculus was introduced around 1930 by Church [11] as part of an investigation in the...
Lambda-calculus is a language introduced by Church in 1930 aiming to build a logical basis for mathe...
AbstractAn implementation oriented modification of lambda-calculus is presented together with some a...
In recent work, Swarup, Reddy, and Ireland defined a formal system called Imperative Lambda Calculus...
We consider the interaction of recursion with extensional data types in several typed functional pro...
We introduce a concept of computability relative to a structure, which specifies which functions on ...
We show that the full PCF language can be encoded in L_rec, a syntactically linear λ-calculus extend...
The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathemati...
In this master thesis we investigate lambda calculus and the theory of combinatory logic. Two comput...
This paper introduces a sequence of lambda-expressions, modelling the binaryexpansion of integers. W...
The earliest statement of Church’s Thesis, from Church (1936) p356 is\ud \ud We now define the notio...
The lambda calculus has frequently been used as an intermediate representation for programming langu...
This paper introduces a sequence of lambda-expressions modelling the binary expansion of integers. W...
Giuseppe Longo. The Lambda-Calculus: connections to higher type Recursion Theory, Proof-Theory, Cat...
Lambda račun sve više i više postaje tema istraživanja kako u matematici tako i u računarstvu. Teor...
untyped lambda calculus was introduced around 1930 by Church [11] as part of an investigation in the...
Lambda-calculus is a language introduced by Church in 1930 aiming to build a logical basis for mathe...
AbstractAn implementation oriented modification of lambda-calculus is presented together with some a...
In recent work, Swarup, Reddy, and Ireland defined a formal system called Imperative Lambda Calculus...
We consider the interaction of recursion with extensional data types in several typed functional pro...
We introduce a concept of computability relative to a structure, which specifies which functions on ...
We show that the full PCF language can be encoded in L_rec, a syntactically linear λ-calculus extend...