Pages that link to "Item:Q4167525"

The following pages link to A new implementation technique for applicative languages (Q4167525):

Displaying 50 items.

• On graph rewriting, reduction, and evaluation in the presence of cycles (Q526460) (← links)
• On the reusability of query optimization algorithms (Q750138) (← links)
• Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic (Q750415) (← links)
• Preliminary arrangements of arguments in lazy evaluation (Q756403) (← links)
• Some FP algebra with currying operation (Q789160) (← links)
• Translation of Turner combinators in O(n log n) space (Q802308) (← links)
• Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL (Q918956) (← links)
• Cyclic reference counting (Q975531) (← links)
• Complexity of the combinator reduction machine (Q1075052) (← links)
• The BC-chain method for representing combinators in linear space (Q1077160) (← links)
• A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
• Adapting combinator and SECD machines to display snapshots of functional computations (Q1082792) (← links)
• Variable abstraction in O(n log n) space (Q1090671) (← links)
• A refinement of strong sequentiality for term rewriting with constructors (Q1093366) (← links)
• Needed reduction and spine strategies for the lambda calculus (Q1097253) (← links)
• Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs (Q1098614) (← links)
• Functional programming with combinators (Q1098628) (← links)
• Implementing first-order rewriting with constructor systems (Q1112601) (← links)
• Confluence of indirection reductions in graph rewrite systems (Q1113692) (← links)
• The semantics of lazy functional languages (Q1124368) (← links)
• \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus (Q1186104) (← links)
• Map theory (Q1193653) (← links)
• C-expressions: A variable-free calculus for equational logic programming (Q1208416) (← links)
• Capturing strong reduction in director string calculus (Q1208420) (← links)
• Cyclic reference counting with lazy mark-scan (Q1208444) (← links)
• Abstraction problems in combinatory logic: A compositive approach (Q1262300) (← links)
• A syntactic theory of sequential state (Q1263961) (← links)
• Stability, sequentiality and demand driven evaluation in dataflow (Q1346605) (← links)
• Lambda calculus with explicit recursion (Q1383145) (← links)
• \(c\beta\)-Machine with \(\lambda \beta\)-reduction (Q1389686) (← links)
• A set of combinators for abstraction in linear space (Q1821553) (← links)
• Incorporating static analysis in a combinator-based compiler (Q1823653) (← links)
• A linear space translation of functional programs to Turner combinators (Q1837177) (← links)
• Efficient multi-variate abstraction using an array representation for combinators. (Q1853162) (← links)
• NP-completeness of a combinator optimization problem (Q1903594) (← links)
• Higher-order unification via combinators (Q2367541) (← links)
• The next 700 Krivine machines (Q2464721) (← links)
• Translating higher-order clauses to first-order clauses (Q2471742) (← links)
• A Lambda-Free Higher-Order Recursive Path Order (Q2988386) (← links)
• Three Syntactic Theories for Combinatory Graph Reduction (Q3003482) (← links)
• π-RED⁺ An interactive compiling graph reduction system for an applied λ-calculus (Q3125230) (← links)
• The Reduceron reconfigured and re-evaluated (Q3165526) (← links)
• On the formalization of semantic conventions (Q3211280) (← links)
• Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989 (Q3478380) (← links)
• Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine (Q3625516) (← links)
• Proposal for a natural formalization of functional programming concepts (Q3793721) (← links)
• Continuation-based compilation of functional languages for parallel machines (Q4279253) (← links)
• The Impact of the Lambda Calculus in Logic and Computer Science (Q4359526) (← links)
• Compact bracket abstraction in combinatory logic (Q4372904) (← links)
• Tail recursion without space leaks (Q4763981) (← links)