Another algorithm for bracket abstraction
From MaRDI portal
Publication:4194932
DOI10.2307/2273733zbMath0408.03013OpenAlexW2074769340WikidataQ56138475 ScholiaQ56138475MaRDI QIDQ4194932
No author found.
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
AlgorithmCombinatory LogicBound VariablesBracket AbstractionTranslation of High Level Computer Languages
Theory of software (68N99) Combinatory logic and lambda calculus (03B40) Algorithms in computer science (68W99)
Related Items
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 ⋮ NP-completeness of a combinator optimization problem ⋮ \(c\beta\)-Machine with \(\lambda \beta\)-reduction ⋮ A correct-by-construction conversion from lambda calculus to combinatory logic ⋮ On the efficiency of categorical combinators as a rewriting system ⋮ Translating higher-order clauses to first-order clauses ⋮ Intersection types for combinatory logic ⋮ Making higher-order superposition work ⋮ Making higher-order superposition work ⋮ Abstraction problems in combinatory logic: A compositive approach ⋮ Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic ⋮ A set of combinators for abstraction in linear space ⋮ Translation of Turner combinators in O(n log n) space ⋮ Complexity of the combinator reduction machine
This page was built for publication: Another algorithm for bracket abstraction
