A construction of one-point bases in extended lambda calculi

Authors:
Mayer Goldberg
Affiliations:
Department of Computer Science, Ben Gurion University, Be'er Sheva 84105, Israel
Venue:
Information Processing Letters
Year:
2004

Citing 6
Cited 0

Gödelization in the lambda calculus

Information Processing Letters
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Revised Report on the Algorithmic Language Scheme

Higher-Order and Symbolic Computation
Recursive application-survival in the lambda calculus

Recursive application-survival in the lambda calculus
An adequate and efficient left-associated binary numeral system in the λ-calculus

Journal of Functional Programming
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)

The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)

Quantified Score

Hi-index	0.90

Visualization

Abstract

We present a general schema for constructing infinitely-many one-point bases for λK-calculi extended by finitely-many constants. The constants are usually present in programming languages, and may involve reduction rules other than β-reduction. The construction can be implemented in a functional subset of LISP/Scheme, giving one-point bases for applicative-order calculi extended by constants from the underlying programming language.