A positive supercompiler
From MaRDI portal
Publication:4339016
DOI10.1017/S0956796800002008zbMath0870.68040OpenAlexW2125977928MaRDI QIDQ4339016
Robert Glück, Neil D. Jones, Morten Heine B. Sørensen
Publication date: 4 June 1997
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796800002008
Related Items
Rules + strategies for transforming lazy functional logic programs ⋮ Proving properties of functional programs by equality saturation ⋮ Inductive Prover Based on Equality Saturation for a Lazy Functional Language ⋮ Asymptotic Speedups, Bisimulation and Distillation (Work in Progress) ⋮ Certifying Supercompilation for Martin-Löf’s Type Theory ⋮ On obtaining the Boyer-Moore string-matching algorithm by partial evaluation ⋮ Maximally-Polyvariant Partial Evaluation in Polynomial Time ⋮ The next 700 program transformers ⋮ Excommunication: transforming \(\pi \)-calculus specifications to remove internal communication ⋮ Reverse universal resolving algorithm and inverse driving ⋮ REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION ⋮ Unnamed Item ⋮ Higher-level supercompilation as a metasystem transition ⋮ Partial evaluation of Maple ⋮ The narrowing-driven approach to functional logic program specialization ⋮ Program transformation system based on generalized partial computation ⋮ An investigation of Jones optimality and BTI-universal specializers ⋮ FROM STANDARD TO NON-STANDARD SEMANTICS BY SEMANTICS MODIFIERS ⋮ A residualizing semantics for the partial evaluation of functional logic programs. ⋮ Narrowing and Rewriting Logic: from Foundations to Applications
Cites Work
- Using circular programs to eliminate multiple traversals of data
- Deforestation: Transforming programs to eliminate trees
- The concept of a supercompiler
- A System for Assisting Program Transformation
- Partial evaluation in logic programming
- A Transformation System for Developing Recursive Programs
- Fast Pattern Matching in Strings
