Total unfolding: theory and applications

DOI10.1017/S0956796800001155zbMath0817.68096OpenAlexW2133549826MaRDI QIDQ4764611

Björn Lisper

Publication date: 4 May 1995

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796800001155

zbMATH Keywords

program transformationsunfolding

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Cites Work

• Synthesizing systolic arrays from recurrence equations
• The derivation of systolic implementations of programs
• Annotated bibliography on partial evaluation and mixed computation
• The lambda calculus, its syntax and semantics
• Automatic autoprojection of recursive equations with global variables and abstract data types
• Synthesizing synchronous systems by static scheduling in space-time
• Adding algebraic rewriting to the untyped lambda calculus
• A system which automatically improves programs
• Some Techniques for Recursion Removal from Recursive Functions
• Operational and Semantic Equivalence Between Recursive Programs
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• On the Analysis and Synthesis of VLSI Algorithms
• A Transformation System for Developing Recursive Programs
• Minimal and Optimal Computations of Recursive Programs
• The Organization of Computations for Uniform Recurrence Equations
• On the optimality of linear schedules

This page was built for publication: Total unfolding: theory and applications