Results 1  10
of
82,015
Discriminating Coded Lambda Terms
, 1994
"... A coding for a (typefree) lambda term M is a lambda term pMq in normal form such that M (and its parts) can be reconstructed from pMq in a lambda definable way. Kleene[1936] defined a coding pMq K and a selfinterpreter E K 2 ffi such that 8M2 ffi E K pMq K = M: (1) In this style one ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A coding for a (typefree) lambda term M is a lambda term pMq in normal form such that M (and its parts) can be reconstructed from pMq in a lambda definable way. Kleene[1936] defined a coding pMq K and a selfinterpreter E K 2 ffi such that 8M2 ffi E K pMq K = M: (1) In this style one
Counting and generating lambda terms
, 2013
"... Lambda calculus is the basis of functional programming and higher order proof assistants. However, little is known about combinatorial properties of lambda terms, in particular, about their asymptotic distribution and random generation. This paper tries to answer questions like: How many terms of a ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Lambda calculus is the basis of functional programming and higher order proof assistants. However, little is known about combinatorial properties of lambda terms, in particular, about their asymptotic distribution and random generation. This paper tries to answer questions like: How many terms of a
On counting untyped lambda terms
, 2012
"... Despite λcalculus is now three quarters of a century old, no formula counting λterms has been proposed yet, and the combinatorics of λcalculus is considered a hard problem. The difficulty lies in the fact that the recursive expression of the numbers of terms of size n with at most m free variable ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
variables contains the number of terms of size n−1 with at most m+1 variables. This leads to complex recurrences that cannot be handled by classical analytic methods. Here based on de Bruijn indices (another presentation of λcalculus) we propose several results on counting untyped lambda terms, i
Describing Lambda Terms in Context Unification
 in &quot;5th International Conference on Logical Aspects in Computational Linguistics&quot;, LNAI, vol. 3492, SV
, 2005
"... The constraint language for lambda structures (CLLS) is a description language for lambda terms. CLLS provides parallelism constraints to talk about the tree structure of lambda terms, and lambda binding constraints to specify variable binding. Parallelism constraints alone have the same express ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The constraint language for lambda structures (CLLS) is a description language for lambda terms. CLLS provides parallelism constraints to talk about the tree structure of lambda terms, and lambda binding constraints to specify variable binding. Parallelism constraints alone have the same
Enumeration of generalized BCI lambdaterms
, 2013
"... We investigate the asymptotic number of elements of size n in a particular class of closed lambdaterms (socalled BCI(p)terms) which are related to axiom systems of combinatory logic. By deriving a differential equation for the generating function of the counting sequence we obtain a recurrence re ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We investigate the asymptotic number of elements of size n in a particular class of closed lambdaterms (socalled BCI(p)terms) which are related to axiom systems of combinatory logic. By deriving a differential equation for the generating function of the counting sequence we obtain a recurrence
Separability of Infinite Lambda Terms
"... Abstract. Infinite lambda calculi extend finite lambda calculus with infinite terms and transfinite reduction. In this paper we extend some classical results of finite lambda calculus to infinite terms. The first result we extend to infinite terms is Böhm Theorem which states the separability of two ..."
Abstract
 Add to MetaCart
Abstract. Infinite lambda calculi extend finite lambda calculus with infinite terms and transfinite reduction. In this paper we extend some classical results of finite lambda calculus to infinite terms. The first result we extend to infinite terms is Böhm Theorem which states the separability
Almost Affine Lambda Terms
, 2014
"... I prove that a λterm that has a negatively nonduplicated typing is always βηequal to an almost affine λterm. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
I prove that a λterm that has a negatively nonduplicated typing is always βηequal to an almost affine λterm.
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
Tradeoffs in the Intensional Representation of Lambda Terms
 Rewriting Techniques and Applications (RTA 2002), volume 2378 of LNCS
, 2002
"... Higherorder representations of objects such as programs, specifications and proofs are important to many metaprogramming and symbolic computation tasks. Systems that support such representations often depend on the implementation of an intensional view of the terms of suitable typed lambda calculi. ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Higherorder representations of objects such as programs, specifications and proofs are important to many metaprogramming and symbolic computation tasks. Systems that support such representations often depend on the implementation of an intensional view of the terms of suitable typed lambda calculi
Results 1  10
of
82,015