Dr. Mayer Goldberg

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.