Modified strong reduction in combinatory logic

DOI10.1305/NDJFL/1093893461MaRDI QIDQ2539218zbMATH OpenOpenAlexFDO

Authors Kenneth Loewen

Publication date 1968

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1093893461

zbMATH Keywords

combinatory logicconstructive mathematicsrecursion theorystrong reduction

Mathematics Subject Classification ID

Computability and recursion theory (03D99)

Cited in

(4)

• Strongly reducing variants of the Krivine abstract machine
• A compiled implementation of strong reduction
• A solution to Curry and Hindley's problem on combinatory strong reduction
• The Church Rosser theorem for strong reduction in combinatory logic

This page was built for publication: Modified strong reduction in combinatory logic

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