A positive supercompiler
From MaRDI portal
Publication:4339016
DOI10.1017/S0956796800002008zbMATH Open0870.68040OpenAlexW2125977928MaRDI QIDQ4339016FDOQ4339016
Authors: Robert Glück, Neil D. Jones, M. H. 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
Recommendations
Cites Work
- The concept of a supercompiler
- Partial evaluation in logic programming
- Fast Pattern Matching in Strings
- Deforestation: Transforming programs to eliminate trees
- Using circular programs to eliminate multiple traversals of data
- A Transformation System for Developing Recursive Programs
- A System for Assisting Program Transformation
Cited In (26)
- REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
- Positive supercompilation for a higher order call-by-value language
- The narrowing-driven approach to functional logic program specialization
- On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
- Program transformation system based on generalized partial computation
- An investigation of Jones optimality and BTI-universal specializers
- Inductive prover based on equality saturation for a lazy functional language
- Title not available (Why is that?)
- Proving properties of functional programs by equality saturation
- Supercompilation for Martin-Lof's type theory
- Positive supercompilation for a higher-order call-by-value language
- The concept of a supercompiler
- Reverse universal resolving algorithm and inverse driving
- A residualizing semantics for the partial evaluation of functional logic programs.
- Maximally-polyvariant partial evaluation in polynomial time
- Title not available (Why is that?)
- Narrowing and rewriting logic: from foundations to applications
- Title not available (Why is that?)
- Higher-level supercompilation as a metasystem transition
- From standard to non-standard semantics by semantics modifiers
- Rules + strategies for transforming lazy functional logic programs
- Asymptotic speedups, bisimulation and distillation (work in progress)
- The next 700 program transformers
- Partial evaluation of Maple
- Certifying supercompilation for Martin-Löf's type theory
- Excommunication: transforming \(\pi \)-calculus specifications to remove internal communication
This page was built for publication: A positive supercompiler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339016)
