An abstract formalization of correct schemas for program synthesis

DOI10.1006/JSCO.1999.0348zbMath0959.68013DBLPjournals/jsc/FlenerLOR00OpenAlexW1970800522WikidataQ57574286 ScholiaQ57574286MaRDI QIDQ1583858

Pierre Flener, Julian Richardson, Kung-Kiu Lau, Mario Ornaghi

Publication date: 6 February 2001

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1999.0348

zbMATH Keywords

hierarchical program synthesisspecification framework

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (1)

\textit{Theorema}: Towards computer-aided mathematical theory exploration

Uses Software

• KIDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Top-down synthesis of divide-and-conquer algorithms
• Gazing: An approach to the problem of definition and lemma use
• Proving and applying program transformations expressed with second-order patterns
• Constructing specification morphisms
• Logic program synthesis from incomplete specifications
• Essential concepts of algebraic specification and program development
• A Methodology for LISP Program Construction from Examples
• Institutions: abstract model theory for specification and programming
• The relationship between logic programs and specifications-the subset example revisited
• Steadfast logic programs
• Inclusions and subtypes II: higher-order case
• Inductive synthesis of recursive logic programs: achievements and prospects

This page was built for publication: An abstract formalization of correct schemas for program synthesis