A construction of one-point bases in extended lambda calculi

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


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.

Original languageEnglish
Pages (from-to)281-286
Number of pages6
JournalInformation Processing Letters
Issue number6
StatePublished - 31 Mar 2004


  • Bases
  • Constants
  • Functional programming
  • Lambda calculi
  • Programming calculi
  • Programming languages

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'A construction of one-point bases in extended lambda calculi'. Together they form a unique fingerprint.

Cite this