Pages that link to "Item:Q914358"

The following pages link to Deforestation: Transforming programs to eliminate trees (Q914358):

Displaying 50 items.

• A regeneration scheme for generating extensions (Q290228) (← links)
• Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition (Q385017) (← links)
• Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs (Q673496) (← links)
• Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← links)
• Ensuring the quasi-termination of needed narrowing computations (Q845935) (← links)
• Flattening tuples in an SSA intermediate representation (Q1029812) (← links)
• Efficient high-level parallel programming (Q1128713) (← links)
• Woodland deforestation by charcoal supply to Dar es Salaam (Q1289612) (← links)
• Lambda calculus with explicit recursion (Q1383145) (← links)
• Indexed types (Q1389626) (← links)
• Lambda-dropping: Transforming recursive equations into programs with block structure (Q1583366) (← links)
• The Projective Noether Maple Package: Computing the dimension of a projective variety (Q1587230) (← links)
• Complexity bounds for container functors and comonads (Q1640987) (← links)
• Constraints to stop deforestation (Q1818321) (← links)
• Functional programming concepts and straight-line programs in computer algebra (Q1849848) (← links)
• A residualizing semantics for the partial evaluation of functional logic programs. (Q1853170) (← links)
• Rules + strategies for transforming lazy functional logic programs (Q1884942) (← links)
• Trends in trends in functional programming 1999/2000 versus 2007/2008 (Q1929344) (← links)
• Functional un\(|\)unparsing (Q1929354) (← links)
• Shortcut fusion rules for the derivation of circular and higher-order programs (Q1929359) (← links)
• An efficient composition of bidirectional programs by memoization and lazy update (Q2039945) (← links)
• A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
• Fusing logic and control with local transformations: an example optimization (Q2841226) (← links)
• Scoped dynamic rewrite rules (Q2841252) (← links)
• Strongly typed rewriting for coupled software transformation (Q2864515) (← links)
• The BinProlog experience: architecture and implementation choices for continuation passing Prolog and first-class logic engines (Q2893093) (← links)
• Fusion for Free (Q2941182) (← links)
• Pointlessness is Better than Listlessness (Q3188290) (← links)
• REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION (Q3526545) (← links)
• A pattern for almost compositional functions (Q3546044) (← links)
• Algebraic fusion of functions with an accumulating parameter and its improvement (Q3546049) (← links)
• Deforesting Logical Form (Q3584993) (← links)
• Algebra of programming in Agda: Dependent types for relational program derivation (Q3644935) (← links)
• A positive supercompiler (Q4339016) (← links)
• Solving Horn Clauses on Inductive Data Types Without Induction (Q4559806) (← links)
• Push versus pull-based loop fusion in query engines (Q4577821) (← links)
• Generic functional programming with types and relations (Q4880524) (← links)
• Deforestation, program transformation, and cut-elimination (Q4917034) (← links)
• When is a function a fold or an unfold? (Q4917036) (← links)
• A Case Study in Abstract Interpretation Based Program Transformation (Q4917048) (← links)
• (Q5013811) (← links)
• A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
• (Q5020652) (← links)
• Proving the correctness of recursion-based automatic program transformations (Q5096758) (← links)
• Iterating on multiple collections in synchrony (Q5101923) (← links)
• Characterizing Compatible View Updates in Syntactic Bidirectionalization (Q5237214) (← links)
• Enhancing semantic bidirectionalization via shape bidirectionalizer plug-ins (Q5398330) (← links)
• Manipulating accumulative functions by swapping call-time and return-time computations (Q5398337) (← links)
• A Duality of Sorts (Q5410453) (← links)