An abstract formalization of correct schemas for program synthesis
type: Item
instance of: scholarly article
title: An abstract formalization of correct schemas for program synthesis
zbMATH Open document ID: 0959.68013
author: Pierre Flener
author: Kung-Kiu Lau
author: Mario Ornaghi
author: Julian Richardson
published in: Journal of Symbolic Computation
publication date: 2001-02-06T00:00:00Z
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 1523432
zbMATH Keywords: hierarchical program synthesis
zbMATH Keywords: specification framework
describes a project that uses: KIDS
MaRDI profile type: Publication
full work available at URL: jsco.1999.0348
OpenAlex ID: W1970800522
Wikidata QID: Q57574286
cites work: Gazing: An approach to the problem of definition and lemma use
cites work: Q3311647
cites work: Q3783490
cites work: Logic program synthesis from incomplete specifications
cites work: Inductive synthesis of recursive logic programs: achievements and prospects
cites work: Institutions: abstract model theory for specification and programming
cites work: Proving and applying program transformations expressed with second-order patterns
cites work: The relationship between logic programs and specifications-the subset example revisited
cites work: Steadfast logic programs
cites work: Q3339245
cites work: Q4124327
cites work: Inclusions and subtypes II: higher-order case
cites work: Essential concepts of algebraic specification and program development
cites work: Top-down synthesis of divide-and-conquer algorithms
cites work: Constructing specification morphisms
cites work: A Methodology for LISP Program Construction from Examples
cites work: Q4385539
DBLP publication ID: journals/jsc/FlenerLOR00
DOI: 10.1006/JSCO.1999.0348
description: scientific article; zbMATH DE number 1523432