A (machine-oriented) logic based on pattern matching

DOI10.1017/s0960129523000191OpenAlexW4383224289MaRDI QIDQ6149946

Tim Lethen

Publication date: 5 March 2024

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129523000191

zbMATH Keywords

unificationpattern matchingcondensed detachmentcombinatory logicprincipal typesFool's model

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Condensed detachment as a rule of inference
• Implementing the `Fool's model' of combinatory logic
• In memoriam Carew Arthur Meredith (1904-1976)
• An automatic theorem prover for substitution and detachment systems
• A simplified form of condensed detachment
• Unification: a multidisciplinary survey
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: A (machine-oriented) logic based on pattern matching