Abstraction problems in combinatory logic: A compositive approach

DOI10.1016/0304-3975(89)90143-6zbMath0686.03008OpenAlexW2046818786MaRDI QIDQ1262300

Adolfo Piperno

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90143-6

zbMATH Keywords

combinatory logic\(\lambda \) -calculusAbtraction algorithmsimplementation of functional programming languagessupercombinators

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items (3)

The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction ⋮ Intersection types for combinatory logic ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• The lambda calculus, its syntax and semantics
• Apparent variables from the standpoint of combinatory logic
• An abstraction algorithm for combinatory logic
• A new implementation technique for applicative languages
• Another algorithm for bracket abstraction
• Some Additions to the Theory of Combinators

This page was built for publication: Abstraction problems in combinatory logic: A compositive approach