Rewriting techniques for program synthesis
From MaRDI portal
Recommendations
Cites work
- A Transformation System for Developing Recursive Programs
- scientific article; zbMATH DE number 3907753 (Why is no real title available?)
- scientific article; zbMATH DE number 3956434 (Why is no real title available?)
- scientific article; zbMATH DE number 4047063 (Why is no real title available?)
- scientific article; zbMATH DE number 3019695 (Why is no real title available?)
- Orderings for term-rewriting systems
- Proving termination with multiset orderings
- The concept of a supercompiler
Cited in
(13)- When is an extension of a specification consistent? Decidable and undecidable cases
- Deductive and inductive synthesis of equational programs
- Program synthesis with equivalence reduction
- Computing with rewrite systems
- scientific article; zbMATH DE number 4043304 (Why is no real title available?)
- scientific article; zbMATH DE number 4080884 (Why is no real title available?)
- scientific article; zbMATH DE number 139988 (Why is no real title available?)
- scientific article; zbMATH DE number 1231655 (Why is no real title available?)
- Program transformation and rewriting
- Axiomatization of a functional logic language
- Conditional rewriting in focus
- Term rewriting induction
- Synthesis of rewrite programs by higher-order and semantic unification
This page was built for publication: Rewriting techniques for program synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055734)