A construction of one-point bases in extended lambda calculi |
| |
| Authors: | Mayer Goldberg |
| |
| Affiliation: | Department of Computer Science, Ben Gurion University, Be'er Sheva 84105, Israel |
| |
| Abstract: | We present a general schema for constructing infinitely-many one-point bases for  -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. |
| |
| Keywords: | Programming calculi Programming languages Functional programming Lambda calculi Bases Constants |
| 本文献已被 ScienceDirect 等数据库收录！ |
