A Hoare Calculus for functions defined by recursion on higher types
- 1 January 1985
- book chapter
- Published by Springer Nature
- p. 106-117
- https://doi.org/10.1007/3-540-15648-8_9
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Correctness of programs with Pascal-like procedures without global variablesTheoretical Computer Science, 1984
- Reasoning about procedures as parametersLecture Notes in Computer Science, 1984
- A sound and relatively complete Hoare-logic for a language with higher type proceduresActa Informatica, 1983
- A necessary and sufficient condition in order that a Herbrand interpretation be expressive relative to recursive programsInformation and Control, 1983
- On effective axiomatizations of Hoare logicsPublished by Association for Computing Machinery (ACM) ,1982
- Verification of programs with procedure-type parametersActa Informatica, 1982
- Correctness of programs with function proceduresPublished by Springer Nature ,1982
- Proof-oriented and applicative valuations in definitions of algorithmsPublished by Association for Computing Machinery (ACM) ,1981
- Fully effective solutions of recursive domain equationsPublished by Springer Nature ,1979
- Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom SystemsJournal of the ACM, 1979