Another algorithm for bracket abstraction

DOI10.2307/2273733zbMath0408.03013WikidataQ56138475 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

zbMATH Keywords

Algorithm; Combinatory Logic; Bound Variables; Bracket Abstraction; Translation of High Level Computer Languages

Mathematics Subject Classification ID

68N99: Theory of software

03B40: Combinatory logic and lambda calculus

68W99: Algorithms in computer science

Related Items

Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic, Translation of Turner combinators in O(n log n) space, 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