The Addition of Bounded Quantification and Partial Functions to A Computational Logic and Its Theorem Prover
- 1 January 1989
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the role of automated theorem proving in the compile-time derivation of concurrencyJournal of Automated Reasoning, 1985
- Towards mechanical metamathematicsJournal of Automated Reasoning, 1985
- A Mechanical Proof of the Unsolvability of the Halting ProblemJournal of the ACM, 1984
- Proof Checking the RSA Public Key Encryption AlgorithmThe American Mathematical Monthly, 1984
- The Denotational Description of Programming LanguagesPublished by Springer Nature ,1979
- A new implementation technique for applicative languagesSoftware: Practice and Experience, 1979