Some improvements to Turner's algorithm for bracket abstraction

DOI10.2307/2274655MaRDI QIDQ3199391zbMATH OpenOpenAlexFDO

Authors 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

algorithmbracket abstractinfunctional languageslambda calculus

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 786542
• Abstraction problems in combinatory logic: A compositive approach
• scientific article; zbMATH DE number 4035776
• Compact bracket abstraction in combinatory logic
• scientific article; zbMATH DE number 4037167

Cites work

• A linear space translation of functional programs to Turner combinators
• scientific article; zbMATH DE number 4048997 (Why is no real title available?)
• On adding (ξ) to weak equality in combinatory logic
• Variable abstraction in O(n log n) space

Cited in

(4)

• Combinatory logic with polymorphic types
• Expedited Broda-Damas bracket abstraction
• scientific article; zbMATH DE number 786542 (Why is no real title available?)
• a-logic with arrows

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

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