A positive supercompiler

DOI10.1017/S0956796800002008MaRDI QIDQ4339016zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

positive supercompiler

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

• scientific article; zbMATH DE number 1630107
• The concept of a supercompiler
• Positive supercompilation for a higher order call-by-value language
• Positive supercompilation for a higher-order call-by-value language
• scientific article; zbMATH DE number 3943000

Cites work

• A System for Assisting Program Transformation
• A Transformation System for Developing Recursive Programs
• Deforestation: Transforming programs to eliminate trees
• Fast Pattern Matching in Strings
• Partial evaluation in logic programming
• The concept of a supercompiler
• Using circular programs to eliminate multiple traversals of data

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
• Proving properties of functional programs by equality saturation
• Supercompilation for Martin-Lof's type theory
• scientific article; zbMATH DE number 1630107 (Why is no real title available?)
• Inductive prover based on equality saturation for a lazy functional language
• 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
• scientific article; zbMATH DE number 3943000 (Why is no real title available?)
• Narrowing and rewriting logic: from foundations to applications
• scientific article; zbMATH DE number 7453196 (Why is no real title available?)
• 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)