A new implementation technique for applicative languages
From MaRDI portal
Cites work
Cited in
(62)- Tail recursion without space leaks
- C-expressions: A variable-free calculus for equational logic programming
- Efficient multi-variate abstraction using an array representation for combinators.
- Variable abstraction in O(n log n) space
- Implementing first-order rewriting with constructor systems
- Functional programming with combinators
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- A refinement of strong sequentiality for term rewriting with constructors
- Functional semantics
- Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
- The Impact of the Lambda Calculus in Logic and Computer Science
- Cyclic reference counting
- π-RED+ An interactive compiling graph reduction system for an applied λ-calculus
- Confluence of indirection reductions in graph rewrite systems
- Cyclic reference counting with lazy mark-scan
- Compact bracket abstraction in combinatory logic
- A linear space translation of functional programs to Turner combinators
- Map theory
- The next 700 Krivine machines
- Continuation-based compilation of functional languages for parallel machines
- A theory for nondeterminism, parallelism, communication, and concurrency
- Higher-order unification via combinators
- The semantics of lazy functional languages
- Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989
- Lambda calculus with explicit recursion
- Call-by-value combinatory logic and the lambda-value calculus
- Deriving an abstract machine for strong call by need
- 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
- Programming in the λ-Calculus: From Church to Scott and Back
- Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs
- Exploiting instantiations from paramodulation proofs in Isabelle/HOL
- \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus
- The Reduceron reconfigured and re-evaluated
- Some FP algebra with currying operation
- Stability, sequentiality and demand driven evaluation in dataflow
- Translating higher-order clauses to first-order clauses
- A set of combinators for abstraction in linear space
- Incorporating static analysis in a combinator-based compiler
- Redex capturing in term graph rewriting (concise version)
- Three Syntactic Theories for Combinatory Graph Reduction
- A Lambda-Free Higher-Order Recursive Path Order
- Capturing strong reduction in director string calculus
- NP-completeness of a combinator optimization problem
- Disproving termination of non-erasing sole combinatory calculus with tree automata
- Correctness of procedure representations in higher-order assembly language
- Translation of Turner combinators in O(n log n) space
- Needed reduction and spine strategies for the lambda calculus
- Complexity of the combinator reduction machine
- The BC-chain method for representing combinators in linear space
- Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL
- On the formalization of semantic conventions
- Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
- Abstraction problems in combinatory logic: A compositive approach
- Using transformations in the implementation of higher-order functions
- Normal-order reduction grammars
- \(c\beta\)-Machine with \(\lambda \beta\)-reduction
- Adapting combinator and SECD machines to display snapshots of functional computations
- Proposal for a natural formalization of functional programming concepts
- On graph rewriting, reduction, and evaluation in the presence of cycles
This page was built for publication: A new implementation technique for applicative languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4167525)
