Some improvements to Turner's algorithm for bracket abstraction

DOI10.2307/2274655zbMath0714.03013OpenAlexW1982896380MaRDI QIDQ3199391

Martin W. Bunder

Publication date: 1990

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

Full work available at URL: https://ro.uow.edu.au/eispapers/1962

zbMATH Keywords

algorithmfunctional languageslambda calculusbracket abstractin

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Combinatory logic with polymorphic types ⋮ a-Logic With Arrows

Cites Work

• Unnamed Item
• Variable abstraction in O(n log n) space
• A linear space translation of functional programs to Turner combinators
• On adding (ξ) to weak equality in combinatory logic

This page was built for publication: Some improvements to Turner's algorithm for bracket abstraction