Compact bracket abstraction in combinatory logic

DOI10.2307/2275570MaRDI QIDQ4372904zbMATH OpenOpenAlexFDO

Authors Sabine Broda, Luís Damas

Publication date 7 September 1998

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

Full work available at URL https://doi.org/10.2307/2275570

zbMATH Keywords

combinatory logiccombinatorsbracket abstraction algorithm

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 4035776
• Abstraction problems in combinatory logic: A compositive approach
• scientific article; zbMATH DE number 169528
• scientific article; zbMATH DE number 993359
• Bounded combinatory logic
• Combinator logics
• scientific article; zbMATH DE number 1954120
• Bounded combinatory logic and lower complexity
• scientific article; zbMATH DE number 3926234
• scientific article; zbMATH DE number 3960987

Cites work

• A new implementation technique for applicative languages
• BCK-combinators and linear \(\lambda\)-terms have types

Cited in

(10)

• THEORETICAL PEARLS
• scientific article; zbMATH DE number 786542 (Why is no real title available?)
• Some improvements to Turner's algorithm for bracket abstraction
• Abstraction in algorithmic logic
• The merits of compositional abstraction: a case study in propositional logic
• A set of combinators for abstraction in linear space
• Australasian Association for Logic 1999 Annual Conference Co-Sponsored by The Association for Symbolic Logic
• scientific article; zbMATH DE number 4035776 (Why is no real title available?)
• Abstraction problems in combinatory logic: A compositive approach
• Expedited Broda-Damas bracket abstraction

This page was built for publication: Compact bracket abstraction in combinatory logic

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