Results 241 to 250 of about 14,639 (283)

Infinite \(\lambda\)-calculus and types

1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ALESSANDRO BERARDUCCI, DEZANI, Mariangiola   +1 more
openaire   +3 more sources

Computational lambda-calculus and monads

[1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, 2003
The lambda -calculus is considered a useful mathematical tool in the study of programming languages. However, if one uses beta eta -conversion to prove equivalence of programs, then a gross simplification is introduced. The author gives a calculus based on a categorical semantics for computations, which provides a correct basis for proving equivalence ...
openaire   +1 more source

Lambda-Calculus with Director Strings

Applicable Algebra in Engineering, Communication and Computing, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fernandez, M, Mackie, I, Sinot, F-R
openaire   +3 more sources

Perpetual reductions in \(\lambda\)-calculus

Information and Computation, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
van Raamsdonk, F., Severi, P., Sørensen, M.H., Xi, H.   +3 more
openaire   +2 more sources

The Lambda Calculus

2018
The λ-calculus is, at heart, a simple notation for functions and application. The main ideas are applying a function to an argument and forming functions by abstraction. The syntax of basic λ-calculus is quite sparse, making it an elegant, focused notation for representing functions. Functions and arguments are on a par with one another.
Alama, Jesse, Korbmacher, J.
openaire   +1 more source

Untyped lambda-calculus

1994
No abstract.
Geuvers, J.H., Nederpelt, R.P.
openaire   +1 more source

Solving Equations in Lambda-Calculus

1989
Abstract Part 1 reviews principal solvable and unsolvable equations and equation systems encountered in λ-calculus and Combinatory Logic. Particular emphasis is given to the solvability of discriminability, separability and X-separability problems. All these problems are special cases of (and are improved by) the predicate “F is X-weakly separable ...
C. Bohm, PIPERNO, Adolfo, TRONCI, Enrico
openaire   +1 more source

Nonmodularity Results for Lambda Calculus

Fundamenta Informaticae, 2001
The 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 ...
openaire   +3 more sources

Resource Operators for lambda-calculus

2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kesner, Delia, Lengrand, Stéphane
openaire   +2 more sources

Typed lambda-calculus

1994
No abstract.
Geuvers, J.H., Nederpelt, R.P.
openaire   +1 more source