A Transformation System for Developing Recursive Programs

Cited in

(only showing first 100 items - show all)

An improved reductant calculus using fuzzy partial evaluation techniques
Automatic programming: A tutorial on formal methodologies
Top-down synthesis of divide-and-conquer algorithms
Towers of Hanoi problems: deriving iterative solutions by program transformations
A parallel algorithm for the monadic unification problem
NTS languages are deterministic and congruential
Denotational semantics of a para-functional programming language
Partial parametrization eliminates multiple traversals of data structures
Algebraic specification and proof of a distributed recovery algorithm
Derivation of efficient programs for computing sequences of actions
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
Composing recursive logic programs with clausal join
A calculus of refinements for program derivations
Existential continuation
On the transformation of logic programs with instantiation based computation rules
Schema induction for logic program synthesis
Final algebra semantics and data type extensions
Partially additive categories and flow-diagram semantics
Prolegomena to a theory of mechanized formal reasoning
An algebraic definition for control structures
A strange sorting method inspired by formal differentiation
On correct refinement of programs
An efficient interpreter for the lambda-calculus
Derivation of logic programs by functional methods
A new approach to recursion removal
The functional dimension of inductive definitions
Equivalence-preserving first-order unfold/fold transformation systems
Unfolding and fixpoint semantics of concurrent constraint logic programs
Program morphisms
Program transformations and algebraic semantics
Transforming constraint logic programs
Mixtus: An automatic partial evaluator for full Prolog
Logic program synthesis from first-order logic specifications
Deductive and inductive synthesis of equational programs
Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation
On the creation of a macromodel of social development
A relation algebraic model of robust correctness
A recursion planning analysis of inductive completion
Lambda calculus with explicit recursion
Computing in unpredictable environments: semantics, reduction strategies, and program transformations
A logical semantics for depth-first Prolog with ground negation
Object grammars and bijections.
Optimizing the stack size of recursive functions
Analogical program derivation based on type theory
Logic program forms
Extraction and verification of programs by analysis of formal proofs
Recursion induction principle revisited
Derivation of an O(k^ 2 n) algorithm for computing order-k Fibonacci numbers from the O(k^ 3 n) matrix multiplication method
Evolution of rule-based programs
Rules + strategies for transforming lazy functional logic programs
A transformation method for dynamic-sized tabulation
Formalized program specifications and transformation synthesis
Determinization of conditional term rewriting systems
Constraint-based correctness proofs for logic program transformations
Inferring expected runtimes of probabilistic integer programs using expected sizes
Totally correct logic program transformations via well-founded annotations
A partial evaluation framework for order-sorted equational programs modulo axioms
On fuzzy unfolding: A multi-adjoint approach
A survey of strategies in rule-based program transformation systems
Abstract language design
Optimization of rewrite theories by equational partial evaluation
Efficient reductants calculi using partial evaluation techniques with thresholding
Work it, wrap it, fix it, fold it
Horn clause solvers for program verification
Short note: Strict unwraps make worker/wrapper fusion totally correct
Asymptotic speedups, bisimulation and distillation (work in progress)
Algebraic fusion of functions with an accumulating parameter and its improvement
Transformations of logic programs on infinite lists
The worker/wrapper transformation
scientific article; zbMATH DE number 3808983 (Why is no real title available?)
La fonction d'Ackermann : un nouveau mode de dérécursivation
Infinite trees in normal form and recursive equations having a unique solution
scientific article; zbMATH DE number 3677217 (Why is no real title available?)
Unfold/fold transformations of logic programs
Towards ``mouldable code via nested code graph transformation
Worker/Wrapper Transformation
scientific article; zbMATH DE number 3576674 (Why is no real title available?)
“Curiouser and curiouser” said alice. further reflections on an interesting recursive function
A positive supercompiler
Automated verification of shape, size and bag properties via user-defined predicates in separation logic
Logical approach to control theory and applications
How powerful are folding/unfolding transformations?
Lilac: a functional programming language based on linear logic
Total unfolding: theory and applications
LOGIC DERIVATION OF PARALLEL LINEAR EQUATION SYSTEM SOLVERS WITHIN ELIMINATION STRATEGY
Program derivation with verified transformations — a case study
Formal basis for the refinement of rule based transition systems
Deforestation, program transformation, and cut-elimination
A Case Study in Abstract Interpretation Based Program Transformation
Using transformations in the implementation of higher-order functions
Folding left and right over Peano numbers
scientific article; zbMATH DE number 7453187 (Why is no real title available?)
scientific article; zbMATH DE number 7453193 (Why is no real title available?)
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant
Rewriting techniques for program synthesis
Program transformation and rewriting
Automatically Introducing Tail Recursion in CakeML
An equivalence preserving first order unfold/fold transformation system
Unfolding and fixpoint semantics of concurrent constraint logic programs

This page was built for publication: A Transformation System for Developing Recursive Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4111080)