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.
Original language | English |
---|---|
Pages (from-to) | 281-286 |
Number of pages | 6 |
Journal | Information Processing Letters |
Volume | 89 |
Issue number | 6 |
DOIs | |
State | Published - 31 Mar 2004 |
Keywords
- Bases
- Constants
- Functional programming
- Lambda calculi
- Programming calculi
- Programming languages
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications