Another algorithm for bracket abstraction

DOI10.2307/2273733MaRDI QIDQ4194932zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1979

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

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

zbMATH Keywords

AlgorithmBound VariablesBracket AbstractionCombinatory LogicTranslation of High Level Computer Languages

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Theory of software (68N99) Algorithms in computer science (68W99)

Cited in

(20)

• Complexity of the combinator reduction machine
• The BC-chain method for representing combinators in linear space
• Variable abstraction in O(n log n) space
• A safe approach to parallel combinator reduction
• A fast algorithm for translating combinator expressions with BC-chains
• Functional programming with combinators
• Intersection types for combinatory logic
• Abstraction problems in combinatory logic: A compositive approach
• \(c\beta\)-Machine with \(\lambda \beta\)-reduction
• A set of combinators for abstraction in linear space
• NP-completeness of a combinator optimization problem
• Translating higher-order clauses to first-order clauses
• On the efficiency of categorical combinators as a rewriting system
• Making higher-order superposition work
• Making higher-order superposition work
• A correct-by-construction conversion from lambda calculus to combinatory logic
• Suppes' Theorem For Probability Logic
• A Sound and Complete Calculus for Probability Inequalities
• Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic
• Translation of Turner combinators in O(n log n) space

This page was built for publication: Another algorithm for bracket abstraction

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