A construction of one-point bases in extended lambda calculi

Mayer Goldberg

doi:10.1016/j.ipl.2003.12.005

A construction of one-point bases in extended lambda calculi

Mayer Goldberg

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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	https://doi.org/10.1016/j.ipl.2003.12.005
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

Access to Document

10.1016/j.ipl.2003.12.005

Cite this

@article{dad91c758de448bbbc74882848732562,

title = "A construction of one-point bases in extended lambda calculi",

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.",

keywords = "Bases, Constants, Functional programming, Lambda calculi, Programming calculi, Programming languages",

author = "Mayer Goldberg",

year = "2004",

month = mar,

day = "31",

doi = "10.1016/j.ipl.2003.12.005",

language = "English",

volume = "89",

pages = "281--286",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - A construction of one-point bases in extended lambda calculi

AU - Goldberg, Mayer

PY - 2004/3/31

Y1 - 2004/3/31

N2 - 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.

AB - 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.

KW - Bases

KW - Constants

KW - Functional programming

KW - Lambda calculi

KW - Programming calculi

KW - Programming languages

UR - http://www.scopus.com/inward/record.url?scp=0442280355&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2003.12.005

DO - 10.1016/j.ipl.2003.12.005

M3 - Article

AN - SCOPUS:0442280355

SN - 0020-0190

VL - 89

SP - 281

EP - 286

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

ER -

A construction of one-point bases in extended lambda calculi

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this