Recursive programs and denotational semantics in absolute logics of programs
- 15 January 1990
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 70 (1) , 127-150
- https://doi.org/10.1016/0304-3975(90)90156-c
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A simple dynamic logicTheoretical Computer Science, 1986
- A completeness theorem for dynamic logic.Notre Dame Journal of Formal Logic, 1985
- Recursive Programs as Definitions in First-Order LogicSIAM Journal on Computing, 1984
- A PROPERTY OF 2‐SORTED PEANO MODELS AND PROGRAM VERIFICATIONMathematical Logic Quarterly, 1984
- On the strength of “sometimes” and “always” in program verificationInformation and Control, 1983
- A complete logic for reasoning about programs via nonstandard model theory IITheoretical Computer Science, 1982
- A complete logic for reasoning about programs via nonstandard model theory ITheoretical Computer Science, 1982
- Programs and program verifications in a general settingTheoretical Computer Science, 1981
- On the termination of program schemasInformation and Control, 1975
- Completeness in the theory of typesThe Journal of Symbolic Logic, 1950