Pages that link to "Item:Q4111080"
From MaRDI portal
The following pages link to A Transformation System for Developing Recursive Programs (Q4111080):
Displaying 50 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)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- An improved reductant calculus using fuzzy partial evaluation techniques (Q1037854) (← links)
- Automatic programming: A tutorial on formal methodologies (Q1060833) (← links)
- Top-down synthesis of divide-and-conquer algorithms (Q1062770) (← links)
- Towers of Hanoi problems: deriving iterative solutions by program transformations (Q1067772) (← links)
- A parallel algorithm for the monadic unification problem (Q1083189) (← links)
- NTS languages are deterministic and congruential (Q1083220) (← links)
- Denotational semantics of a para-functional programming language (Q1085595) (← links)
- Partial parametrization eliminates multiple traversals of data structures (Q1085965) (← links)
- Algebraic specification and proof of a distributed recovery algorithm (Q1090102) (← links)
- Derivation of efficient programs for computing sequences of actions (Q1093362) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study (Q1100879) (← links)
- Composing recursive logic programs with clausal join (Q1109585) (← links)
- A calculus of refinements for program derivations (Q1111362) (← links)
- Existential continuation (Q1115643) (← links)
- On the transformation of logic programs with instantiation based computation rules (Q1119029) (← links)
- Schema induction for logic program synthesis (Q1128483) (← links)
- Final algebra semantics and data type extensions (Q1131834) (← links)
- Partially additive categories and flow-diagram semantics (Q1137858) (← links)
- Prolegomena to a theory of mechanized formal reasoning (Q1140436) (← links)
