On sets of solutions to combinator equations

DOI10.1016/0304-3975(89)90148-5zbMATH Open0691.03005OpenAlexW2003021503MaRDI QIDQ582274FDOQ582274

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

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

This page was built for publication: On sets of solutions to combinator equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582274)