A new implementation technique for applicative languages
From MaRDI portal
Publication:4167525
DOI10.1002/spe.4380090105zbMath0386.68009DBLPjournals/spe/Turner79OpenAlexW2063068243WikidataQ55953884 ScholiaQ55953884MaRDI QIDQ4167525
No author found.
Publication date: 1979
Published in: Software: Practice and Experience (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/spe.4380090105
Related Items (60)
The BC-chain method for representing combinators in linear space ⋮ A theory for nondeterminism, parallelism, communication, and concurrency ⋮ Adapting combinator and SECD machines to display snapshots of functional computations ⋮ Higher-order unification via combinators ⋮ The Reduceron reconfigured and re-evaluated ⋮ Variable abstraction in O(n log n) space ⋮ A refinement of strong sequentiality for term rewriting with constructors ⋮ Stability, sequentiality and demand driven evaluation in dataflow ⋮ Redex capturing in term graph rewriting (concise version) ⋮ Needed reduction and spine strategies for the lambda calculus ⋮ Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs ⋮ Functional programming with combinators ⋮ Continuation-based compilation of functional languages for parallel machines ⋮ NP-completeness of a combinator optimization problem ⋮ Implementing first-order rewriting with constructor systems ⋮ Confluence of indirection reductions in graph rewrite systems ⋮ Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989 ⋮ The semantics of lazy functional languages ⋮ On the formalization of semantic conventions ⋮ Lambda calculus with explicit recursion ⋮ \(c\beta\)-Machine with \(\lambda \beta\)-reduction ⋮ Correctness of procedure representations in higher-order assembly language ⋮ Call-by-value combinatory logic and the lambda-value calculus ⋮ Normal-order reduction grammars ⋮ Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL ⋮ Proposal for a natural formalization of functional programming concepts ⋮ A Lambda-Free Higher-Order Recursive Path Order ⋮ The Impact of the Lambda Calculus in Logic and Computer Science ⋮ Three Syntactic Theories for Combinatory Graph Reduction ⋮ \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus ⋮ The next 700 Krivine machines ⋮ Compact bracket abstraction in combinatory logic ⋮ Map theory ⋮ Translating higher-order clauses to first-order clauses ⋮ Functional Semantics ⋮ Programming in the λ-Calculus: From Church to Scott and Back ⋮ On graph rewriting, reduction, and evaluation in the presence of cycles ⋮ C-expressions: A variable-free calculus for equational logic programming ⋮ Capturing strong reduction in director string calculus ⋮ Cyclic reference counting with lazy mark-scan ⋮ Cyclic reference counting ⋮ Using transformations in the implementation of higher-order functions ⋮ Unnamed Item ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators ⋮ Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine ⋮ Abstraction problems in combinatory logic: A compositive approach ⋮ A syntactic theory of sequential state ⋮ On the reusability of query optimization algorithms ⋮ Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic ⋮ Preliminary arrangements of arguments in lazy evaluation ⋮ A set of combinators for abstraction in linear space ⋮ Incorporating static analysis in a combinator-based compiler ⋮ A linear space translation of functional programs to Turner combinators ⋮ Some FP algebra with currying operation ⋮ π-RED+ An interactive compiling graph reduction system for an applied λ-calculus ⋮ Efficient multi-variate abstraction using an array representation for combinators. ⋮ Translation of Turner combinators in O(n log n) space ⋮ Tail recursion without space leaks ⋮ Complexity of the combinator reduction machine
Cites Work
This page was built for publication: A new implementation technique for applicative languages
