On sets of solutions to combinator equations

DOI10.1016/0304-3975(89)90148-5zbMath0691.03005OpenAlexW2003021503MaRDI QIDQ582274

Richard Statman

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)90148-5

zbMATH Keywords

pattern matching\(\beta\)-conversionr.e. set of combinators

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items

Equational programming in \(\lambda\)-calculus via SL-systems. Part 1 ⋮ Defining data structures via Böhm-out ⋮ An analysis of Böhm's theorem ⋮ Some examples of non-existent combinators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item