Deforestation: Transforming programs to eliminate trees
From MaRDI portal
Recommendations
Cites work
- A theory of type polymorphism in programming
- A Transformation System for Developing Recursive Programs
- scientific article; zbMATH DE number 3960968 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- The Principal Type-Scheme of an Object in Combinatory Logic
Cited in
(60)- Flattening tuples in an SSA intermediate representation
- Efficient high-level parallel programming
- Woodland deforestation by charcoal supply to Dar es Salaam
- Lambda calculus with explicit recursion
- Indexed types
- Lambda-dropping: Transforming recursive equations into programs with block structure
- The Projective Noether Maple Package: Computing the dimension of a projective variety
- Complexity bounds for container functors and comonads
- Constraints to stop deforestation
- Functional programming concepts and straight-line programs in computer algebra
- A residualizing semantics for the partial evaluation of functional logic programs.
- Rules + strategies for transforming lazy functional logic programs
- Trends in trends in functional programming 1999/2000 versus 2007/2008
- Functional un\(|\)unparsing
- Shortcut fusion rules for the derivation of circular and higher-order programs
- An efficient composition of bidirectional programs by memoization and lazy update
- A partial evaluation framework for order-sorted equational programs modulo axioms
- Fusing logic and control with local transformations: an example optimization
- Scoped dynamic rewrite rules
- Strongly typed rewriting for coupled software transformation
- The BinProlog experience: architecture and implementation choices for continuation passing Prolog and first-class logic engines
- A regeneration scheme for generating extensions
- Fusion for free. Efficient algebraic effect handlers
- Pointlessness is better than listlessness
- REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
- A pattern for almost compositional functions
- Algebraic fusion of functions with an accumulating parameter and its improvement
- Deforesting Logical Form
- Algebra of programming in Agda: Dependent types for relational program derivation
- Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition
- A positive supercompiler
- Solving Horn clauses on inductive data types without induction
- Push versus pull-based loop fusion in query engines
- Generic functional programming with types and relations
- Deforestation, program transformation, and cut-elimination
- When is a function a fold or an unfold?
- A Case Study in Abstract Interpretation Based Program Transformation
- Needed computations shortcutting needed steps
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
- scientific article; zbMATH DE number 7453193 (Why is no real title available?)
- Proving the correctness of recursion-based automatic program transformations
- Iterating on multiple collections in synchrony
- Characterizing Compatible View Updates in Syntactic Bidirectionalization
- Polynomial-time inverse computation for accumulative functions with multiple data traversals
- Enhancing semantic bidirectionalization via shape bidirectionalizer plug-ins
- Manipulating accumulative functions by swapping call-time and return-time computations
- A duality of sorts
- scientific article; zbMATH DE number 5033862 (Why is no real title available?)
- Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
- A Gröbner free alternative for polynomial system solving
- Fusion of recursive programs with computational effects
- Analysis and Transformation of Constrained Horn Clauses for Program Verification
- Excommunication: transforming \(\pi \)-calculus specifications to remove internal communication
- \textsc{Synbit}: synthesizing bidirectional programs using unidirectional sketches
- Structured handling of scoped effects
- Optimizing term rewriting with creeper trace transducers
- Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
- Program optimisations via hylomorphisms for extraction of executable code
- Derivation of efficient logic programs by specialization and reduction of nondeterminism
- Ensuring the quasi-termination of needed narrowing computations
This page was built for publication: Deforestation: Transforming programs to eliminate trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q914358)
