Justification of the structural synthesis of programs

DOI10.1016/0167-6423(83)90016-3zbMath0514.68019OpenAlexW2037639952MaRDI QIDQ1051416

É. Kh. Tyugu, Grigori Mints

Publication date: 1982

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(83)90016-3

zbMATH Keywords

completenessinference rulesautomatic program synthesisPRIZ programming systemautomatic theorem proving for program synthesisintuitionistic propositional formula

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (10)

Semantics of a declarative language ⋮ The programming system PRIZ ⋮ Type-theoretical semantics of some declarative languages ⋮ Toward knowledge-based specifications of languages ⋮ Computational and attribute models of formal languages ⋮ A bridge between constructive logic and computer programming ⋮ Complexity of subclasses of the intuitionistic propositional calculus ⋮ The programming system PRIZ ⋮ Top-down synthesis of divide-and-conquer algorithms ⋮ Higher order dataflow schemas

Uses Software

• Automath

This page was built for publication: Justification of the structural synthesis of programs