Lambda calculus (also written as λ-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and… (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2004

Highly Cited

2004

- André van Tonder
- SIAM J. Comput.
- 2004

The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Thomas Ehrhard, Laurent Regnier
- Theor. Comput. Sci.
- 2003

We present an extension of the lambda-calculus with di"erential constructions. We state and prove some basic results (con2uence… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

The mismatch between the operational semantics of the lambda calculus and the actual behavior of implementations is a major… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Zena M. Ariola, Matthias Felleisen
- J. Funct. Program.
- 1995

The mismatch between the operational semantics of the lambda calculus and the actual behavior of implementations is a major… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Kathleen Fisher, Furio Honsell, John C. Mitchell
- Nord. J. Comput.
- 1993

This paper presents an untyped lambda calculus, extended with object primitives that reflect the capabilities of so-called… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Eugenio Moggi
- LICS
- 1989

The λ-calculus is considered an useful mathematical tool in the study of programming languages. However, if one uses… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Masako Takahashi
- J. Symb. Comput.
- 1989

The notion of parallel reduction is extracted from the Tait--Martin-L6f proof of the ChurchRosser theorem (for fl-reduetion). We… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- John Lamping
- POPL
- 1989

We present an algorithm for lambda expression reduction that avoids any copying that could later cause duplication of work. It is… (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

As known, to finish this book, you may not need to get it at once in a day. Doing the activities along the day may make you feel… (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- Michael J. Fischer
- Lisp and Symbolic Computation
- 1972

A lambda calculus schema is an expression of the lambda calculus augmented by uninterpreted constant and function symbols and… (More)

Is this relevant?