The absence and the presence of fixed point combinators

DOI10.1016/0304-3975(91)90034-YMaRDI QIDQ807612zbMATH OpenWikidataFDO

Authors Larry Wos, William McCune

Publication date 1991

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

zbMATH Keywords

fixed-point propertyfixed-point combinatorlogic with equality

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Recommendations

• A case study in automated theorem proving: Finding sages in combinatory logic
• The kernel strategy and its use for the study of combinatory logic
• The fixed point property and a technique to harness double fixed point combinators
• On structure and extensionality of fixed-point combinators in CL\(w\)
• Non-existent Statman's double fixed point combinator does not exist, indeed

Cites work

• scientific article; zbMATH DE number 4104410 (Why is no real title available?)
• scientific article; zbMATH DE number 3423994 (Why is no real title available?)
• A case study in automated theorem proving: Finding sages in combinatory logic
• Combinatory logic. With two sections by William Craig.
• The lambda calculus, its syntax and semantics

Cited in

(6)

• Clocked lambda calculus
• Uniform strategies: The CADE-11 theorem proving contest
• scientific article; zbMATH DE number 7226002 (Why is no real title available?)
• The kernel strategy and its use for the study of combinatory logic
• The legacy of a great researcher
• Automatic construction of finite algebras

This page was built for publication: The absence and the presence of fixed point combinators

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