Results 271 to 280 of about 230,472 (297)
Some of the next articles are maybe not open access.
An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus
2012 27th Annual IEEE Symposium on Logic in Computer Science, 2012It is well known that the real numbers arise from the metric completion of the rational numbers, with the metric induced by the usual absolute value. We seek a computational version of this phenomenon, with the idea that the role of the rationals should be played by the affine lambda-calculus, whose dynamics is finitary; the full lambda-calculus should
openaire +2 more sources
Perpetual reductions in \(\lambda\)-calculus
Inf. Comput., 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
van Raamsdonk, F. +3 more
openaire +2 more sources
Resource Operators for lambda-calculus
Inf. Comput., 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kesner, Delia, Lengrand, Stéphane
openaire +2 more sources
Nonmodularity Results for Lambda Calculus
Fundamenta Informaticae, 2001The variety (equational class) of lambda abstraction algebras was introduced to algebraize the untyped lambda calculus in the same way cylindric and polyadic algebras algebraize the first-order predicate logic. In this paper we prove that the lattice of lambda theories is not modular and that the variety generated by the term algebra of a semi-sensible
openaire +4 more sources
Sci. Ann. Cuza Univ., 1995
Summary: We define a model of \(\lambda\)-calculus; it is based on the ideals of a complete partial order; we call it the I-model. The model is, in fact, the model of an extension of the \(\lambda\)-calculus. Using this extension, we define a compositional trace semantics for nondeterministic dataflow networks and dataflow computation, such that the ...
openaire +2 more sources
Summary: We define a model of \(\lambda\)-calculus; it is based on the ideals of a complete partial order; we call it the I-model. The model is, in fact, the model of an extension of the \(\lambda\)-calculus. Using this extension, we define a compositional trace semantics for nondeterministic dataflow networks and dataflow computation, such that the ...
openaire +2 more sources
Uncountable limits and the lambda calculus
Nord. J. Comput., 1995Summary: We address the problem of solving recursive domain equations using uncountable limits of domains. These arise for instance, when dealing with the \(\omega_1\)-continuous function-space constructor and are used in the denotational semantics of programming languages which feature unbounded choice constructs.
Di Gianantonio, Pietro +2 more
openaire +3 more sources
Infinite \(\lambda\)-calculus and types
Theor. Comput. Sci., 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alessandro Berarducci +1 more
openaire +4 more sources
An essay in \(\lambda\)-calculus
2004Summary: This paper aims at presenting \(\lambda\)-calculus and at suggesting how and why its abstractions can be fruitfully used as a tool for representing entities populating the economic realm and how to conceive of a language which is well suited to capturing some basic facts and features pertaining to complex organizational dynamics. I present and
openaire +2 more sources
Parallel reductions in \(\lambda\)-calculus
J. Symb. Comput., 1989The notion of parallel reduction is extracted from the Tait-Martin-Löf proof of the Church-Rosser theorem (for \(\beta\)-reduction). We define parallel \(\beta\)-, \(\eta\)- and \(\beta\) \(\eta\)-reduction by induction, and use them to give simple proofs of some fundamental theorems in \(\lambda\)- calculus; the normal reduction theorem for \(\beta ...
openaire +4 more sources