Pages that link to "Item:Q4194932"
From MaRDI portal
The following pages link to Another algorithm for bracket abstraction (Q4194932):
Displayed 18 items.
- Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic (Q750415) (← links)
- Translation of Turner combinators in O(n log n) space (Q802308) (← links)
- Complexity of the combinator reduction machine (Q1075052) (← links)
- The BC-chain method for representing combinators in linear space (Q1077160) (← links)
- Variable abstraction in O(n log n) space (Q1090671) (← links)
- A safe approach to parallel combinator reduction (Q1095642) (← links)
- A fast algorithm for translating combinator expressions with BC-chains (Q1096387) (← links)
- Functional programming with combinators (Q1098628) (← links)
- Intersection types for combinatory logic (Q1199823) (← links)
- Abstraction problems in combinatory logic: A compositive approach (Q1262300) (← links)
- \(c\beta\)-Machine with \(\lambda \beta\)-reduction (Q1389686) (← links)
- A set of combinators for abstraction in linear space (Q1821553) (← links)
- NP-completeness of a combinator optimization problem (Q1903594) (← links)
- Translating higher-order clauses to first-order clauses (Q2471742) (← links)
- On the efficiency of categorical combinators as a rewriting system (Q3782744) (← links)
- Making higher-order superposition work (Q5918403) (← links)
- Making higher-order superposition work (Q5918575) (← links)
- A correct-by-construction conversion from lambda calculus to combinatory logic (Q6065511) (← links)