An abstract formalization of correct schemas for program synthesis
From MaRDI portal
(Redirected from Publication:1583858)
Recommendations
Cites work
- A Methodology for LISP Program Construction from Examples
- Constructing specification morphisms
- Essential concepts of algebraic specification and program development
- Gazing: An approach to the problem of definition and lemma use
- scientific article; zbMATH DE number 3841217 (Why is no real title available?)
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 4047035 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 1142323 (Why is no real title available?)
- Inclusions and subtypes II: higher-order case
- Inductive synthesis of recursive logic programs: achievements and prospects
- Institutions: abstract model theory for specification and programming
- Logic program synthesis from incomplete specifications
- Proving and applying program transformations expressed with second-order patterns
- Steadfast logic programs
- The relationship between logic programs and specifications-the subset example revisited
- Top-down synthesis of divide-and-conquer algorithms
Cited in
(7)- Partially interpreted schemas for CSP programming
- Schema induction for logic program synthesis
- Program development schemata as derived rules
- Program abstraction and instantiation
- Schema-Guided Synthesis of Imperative Programs by Constraint Solving
- CONCUR 2003 - Concurrency Theory
- \textit{Theorema}: Towards computer-aided mathematical theory exploration
This page was built for publication: An abstract formalization of correct schemas for program synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583858)