An untyped higher order logic with Y combinator

DOI10.2178/JSL/1203350794zbMath1134.03010OpenAlexW2006341276MaRDI QIDQ5444708

James Andrews

Publication date: 25 February 2008

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1203350794

zbMATH Keywords

lambda calculuscombinatory logicillative combinatory logic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• A system at the cross-roads of functional and logic programming
• An intensional type theory: motivation and cut-elimination

This page was built for publication: An untyped higher order logic with Y combinator