scientific article; zbMATH DE number 194911

Publication date: 5 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

functional languages functional programming graph reduction Lambda-calculus G-machine

Theory of programming languages (68N15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01)

Related Items

Sharing in the Graph Rewriting Calculus ⋮ Higher-order unification via combinators ⋮ The Reduceron reconfigured and re-evaluated ⋮ Unnamed Item ⋮ Redex capturing in term graph rewriting (concise version) ⋮ Left-to-right tree pattern matching ⋮ Semantics and strong sequentially of priority term rewriting systems ⋮ Productivity of stream definitions ⋮ Interaction systems II: The practice of optimal reductions ⋮ On ``On graph rewritings ⋮ Directly reflective meta-programming ⋮ A logic for Miranda, revisited ⋮ Comprehending Ringads ⋮ Getting There and Back Again ⋮ Confluence of indirection reductions in graph rewrite systems ⋮ Lazy variable-renumbering makes substitution cheap ⋮ The semantics of lazy functional languages ⋮ Lambda calculus with explicit recursion ⋮ Pattern Matches in HOL: ⋮ Convergence in infinitary term graph rewriting systems is simple ⋮ Indexed types ⋮ Critical pairs in term graph rewriting ⋮ \(c\beta\)-Machine with \(\lambda \beta\)-reduction ⋮ Unnamed Item ⋮ Revisiting the notion of function ⋮ A logic for Miranda ⋮ Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting ⋮ Unnamed Item ⋮ Safe typing of functional logic programs with opaque patterns and local bindings ⋮ Implementing term rewrite languages in DACTL ⋮ Principles of plasma pattern and alternative structure compilation ⋮ Unnamed Item ⋮ Deforestation: Transforming programs to eliminate trees ⋮ Finitely stratified polymorphism ⋮ Lambda calculus with patterns ⋮ Determining periodicity: a case study of a functional specification ⋮ Formal basis for the refinement of rule based transition systems ⋮ \(Booster\): A high-level language for portable parallel algorithms ⋮ Executable component-based semantics ⋮ The spirit of node replication ⋮ Three Syntactic Theories for Combinatory Graph Reduction ⋮ On the expressive power of finitely typed and universally polymorphic recursive procedures ⋮ A list-oriented extension of the lambda-calculus satisfying the Church-Rosser theorem ⋮ Proving the correctness of recursion-based automatic program transformations ⋮ Dynamic detection of determinism in functional logic languages ⋮ A combinatory logic approach to higher-order E-unification ⋮ Head-strictness is not a monotonic abstract property ⋮ A complete proof system for Nested Term Graphs ⋮ Translating higher-order clauses to first-order clauses ⋮ Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations ⋮ A uniform treatment of order of evaluation and aggregate update ⋮ Computational interpretations of linear logic ⋮ Lazy dynamic-programming can be eager ⋮ From Böhm's Theorem to Observational Equivalences ⋮ On graph rewriting, reduction, and evaluation in the presence of cycles ⋮ Demonstrating Lambda Calculus Reduction ⋮ The systematic construction of a one-combinator basis for lambda-terms ⋮ Recursive Functions with Pattern Matching in Interaction Nets ⋮ Capturing strong reduction in director string calculus ⋮ Unnamed Item ⋮ Explicit Substitutions à la de Bruijn ⋮ Evaluating lambda terms with traversals ⋮ Functional parallel typified language and its implementation on clusters ⋮ Using transformations in the implementation of higher-order functions ⋮ From Interpretation to Compilation ⋮ Complexity of Fractran and Productivity ⋮ First-class patterns ⋮ Transfinite reductions in orthogonal term rewriting systems ⋮ Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine ⋮ Unnamed Item ⋮ The development of a partial evaluator for extended lambda calculus ⋮ The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus ⋮ Preliminary arrangements of arguments in lazy evaluation ⋮ Semantics-directed compilation of nonlinear patterns ⋮ An operational semantics for paragon: A design notation for parallel architectures ⋮ A fixed point approach to parallel discrete event simulation ⋮ Semantics and strong sequentiality of priority term rewriting systems ⋮ Usage counting analysis for lazy functional languages ⋮ Jumping Boxes ⋮ Refined typing to localize the impact of forced strictness on free theorems ⋮ A compact kernel for the calculus of inductive constructions ⋮ Statistical properties of lambda terms ⋮ Lambda-dropping: Transforming recursive equations into programs with block structure ⋮ More efficient left-to-right matching for overlapping pattern ⋮ New dimensions in heap profiling ⋮ π-RED⁺ An interactive compiling graph reduction system for an applied λ-calculus ⋮ Proof nets, garbage, and computations ⋮ Skew confluence and the lambda calculus with letrec ⋮ Context-sensitive rewriting strategies ⋮ Lazy techniques for fully expansive theorem proving ⋮ A structural approach to reversible computation ⋮ Structuring Operational Semantics: Simplification and Computation ⋮ From Functional Programs to Interaction Nets via the Rewriting Calculus ⋮ An Account of Implementing Applicative Term Rewriting ⋮ Tail recursion without space leaks ⋮ Lilac: a functional programming language based on linear logic ⋮ A domain-theoretic approach to functional and logic programming ⋮ Towards a Sharing Strategy for the Graph Rewriting Calculus ⋮ Complete Laziness: a Natural Semantics ⋮ Minimality in a Linear Calculus with Iteration ⋮ Explicit cyclic substitutions ⋮ Simple type inference for term graph rewriting systems ⋮ Compiling concurrent rewriting onto the Rewrite Rule Machine ⋮ A chemical abstract machine for graph reduction extended abstract ⋮ Unnamed Item ⋮ A correct-by-construction conversion from lambda calculus to combinatory logic ⋮ Machine Deduction ⋮ Structural rules and algebraic properties of intersection types ⋮ Node Replication: Theory And Practice ⋮ Efficiency of lambda-encodings in total type theory ⋮ Pattern matching compilation of functions defined in context-free languages ⋮ Adaptive pattern matching ⋮ Lazy Lambda calculus: Theories, models and local structure characterization