Pages that link to "Item:Q4111080"

The following pages link to A Transformation System for Developing Recursive Programs (Q4111080):

Displaying 35 items.

• Towards ``mouldable code'' via nested code graph transformation (Q406453) (← links)
• Automated verification of shape, size and bag properties via user-defined predicates in separation logic (Q436400) (← links)
• Fixpoints for general correctness (Q549677) (← links)
• Efficient memo-table management strategies (Q582879) (← links)
• The McCarthy's recursion induction principle: ''oldy'' but ''goody'' (Q594581) (← links)
• Hume box calculus: Robust system development through software transformation (Q656858) (← links)
• Transformations of CLP modules (Q671648) (← links)
• Proving the correctness of recursion-based automatic program transformations (Q671683) (← links)
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs (Q673496) (← links)
• Rippling: A heuristic for guiding inductive proofs (Q685548) (← links)
• Algebraic optimization of object-oriented query languages (Q688667) (← links)
• Provably correct derivation of algorithms using FermaT (Q736840) (← links)
• Semantics of algorithmic languages (Q760200) (← links)
• Synthetic programming (Q761788) (← links)
• Some equivalent transformations of recursive programs based on their schematic properties (Q794422) (← links)
• On synthesis of scheduling algorithms (Q799101) (← links)
• Using circular programs to eliminate multiple traversals of data (Q800713) (← links)
• Propositions and specifications of programs in Martin-Löf's type theory (Q800719) (← links)
• Compiling bottom-up and mixed derivations into top-down executable logic programs (Q809591) (← links)
• Experiments with proof plans for induction (Q809617) (← links)
• Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← links)
• Counterexample-guided partial bounding for recursive function synthesis (Q832233) (← links)
• Things to know when implementing KBO (Q861708) (← links)
• Deaccumulation techniques for improving provability (Q882487) (← links)
• First order compiler: A deterministic logic program synthesis algorithm (Q908686) (← links)
• Term rewriting and beyond -- theorem proving in Isabelle (Q909488) (← links)
• A reification calculus for model-oriented software specification (Q911753) (← links)
• Deforestation: Transforming programs to eliminate trees (Q914358) (← links)
• Preservation of stronger equivalence in unfold/fold logic program transformation (Q915479) (← links)
• Program derivation with verified transformations — a case study (Q4884666) (← links)
• Inverse Unfold Problem and Its Heuristic Solving (Q5240134) (← links)
• Optimizing Fuzzy Logic Programs by Unfolding, Aggregation and Folding (Q5415653) (← links)
• Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)
• Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
• Folding left and right matters: Direct style, accumulators, and continuations (Q6099203) (← links)