Recursive Programs as Definitions in First-Order Logic
- 1 May 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (2), 374-408
- https://doi.org/10.1137/0213026
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- 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
- Computing in systems described by equationsLecture Notes in Computer Science, 1977
- Data Types as LatticesSIAM Journal on Computing, 1976
- Correct Computation Rules for Recursive LanguagesSIAM Journal on Computing, 1976
- Proving Theorems about LISP FunctionsJournal of the ACM, 1975
- Correct and optimal implementations of recursion in a simple programming languageJournal of Computer and System Sciences, 1974
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955