The absence and the presence of fixed point combinators

DOI10.1016/0304-3975(91)90034-YzbMATH Open0731.03012WikidataQ114262241 ScholiaQ114262241MaRDI QIDQ807612FDOQ807612

Authors: Larry Wos, William McCune 

Publication date: 1991

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

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

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)

Cites Work

• Combinatory logic. With two sections by William Craig.
• The lambda calculus, its syntax and semantics
• A case study in automated theorem proving: Finding sages in combinatory logic
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Automatic construction of finite algebras
• The kernel strategy and its use for the study of combinatory logic
• Uniform strategies: The CADE-11 theorem proving contest
• Title not available (Why is that?)
• Clocked lambda calculus
• The legacy of a great researcher

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)