On sets of solutions to combinator equations

DOI10.1016/0304-3975(89)90148-5MaRDI QIDQ582274zbMATH OpenOpenAlexFDO

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)

Cited in

(5)

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

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)