A programming calculus based on partial inductive definitions (with an introduction to the theory of partial inductive definitions)
Number of Authors: 2
1988 (English)Report (Refereed)
We present a general framework (a programming calculus) for the specification, verification and synthesis of programs. The underlying programming paradigm is similar in spirit to logic programming but based on the theory of partial inductive definitions instead of predicate logic. Within this framework we give criteria for the correctness of programs and outline a methodology for using these criteria to perform verifications and syntheses. The programming calculus permits us to use an arbitrary specification language, as long as this language itself can be defined within our framework. The program language is based on partial inductive definitions. Such definitions can be regarded as sets of an extension to Horn clauses of logic, so traditional logic (pure Prolog) programs are included as a special case. Since the theory of partial inductive definitions is not widely known, we include an introduction to it. This introduction can also be read by itself, without any interest in the programming calculus.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1988, 1. , 50 p.
SICS Research Report, ISSN 0283-3638 ; R88:13
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22196OAI: oai:DiVA.org:ri-22196DiVA: diva2:1041740
Original report number R88013.2016-10-312016-10-31