Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic
type: Item
instance of: scholarly article
title: Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic
zbMATH Open document ID: 0714.03014
DOI: 10.1016/0304-3975(90)90155-B
author: Hanne Riis Nielson
author: Flemming Nielson
published in: Theoretical Computer Science
publication date: 1990-01-01T00:00:00Z
review text: The authors present a two-level version of combinatory logic and lambda calculus for distinguishing between early and late binding times, i.e. compile-time and run-time computations. In this paper, which is an extension of a previous one by the same authors, the two-level lambda calculus is enriched by a new combinator, \(\Psi\), which makes the calculus complete, in the sense that every \(\lambda\)-expression can be translated into an equivalent combinator expression.
reviewed by: Alberto Pettorossi
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 4174891
zbMATH Keywords: completeness
zbMATH Keywords: combinatory logic
zbMATH Keywords: lambda calculus
MaRDI profile type: Publication
cites work: Q3785893
cites work: Strictness analysis and denotational abstract interpretation
cites work: Automatic binding time analysis for a typed \(\lambda\)-calculus
cites work: A new implementation technique for applicative languages
cites work: Another algorithm for bracket abstraction
full work available at URL: 0304-3975(90)90155-b
OpenAlex ID: W2138472690
description: scientific article; zbMATH DE number 4174891