A Mechanical Proof of the Unsolvability of the Halting Problem
Journal of the ACM (JACM)
Information and Computation - Semantics of Data Types
Equality in lazy computation systems
Proceedings of the Fourth Annual Symposium on Logic in computer science
Systematic software development using VDM (2nd ed.)
Systematic software development using VDM (2nd ed.)
The revised report on the syntactic theories of sequential control and state
Theoretical Computer Science
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
A type-theoretical alternative to ISWIM, CUCH, OWHY
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
IMPS: an interactive mathematical proof system
Journal of Automated Reasoning
Handbook of logic in artificial intelligence and logic programming
Proving congruence of bisimulation in functional programming languages
Information and Computation
Proving Theorems about LISP Functions
Journal of the ACM (JACM)
Partial Functions in a Total Setting
Journal of Automated Reasoning
Induction Proofs with Partial Functions
Journal of Automated Reasoning
Lambda calculi and linear speedups
The essence of computation
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Program transformation by templates based on term rewriting
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Context Dependent Procedures and Computed Types in √eriFun
Electronic Notes in Theoretical Computer Science (ENTCS)
The connection between two ways of reasoning about partial functions
Information Processing Letters
Fixed point semantics and partial recursion in Coq
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
HasCasl: Integrated higher-order specification and program development
Theoretical Computer Science
Formal verification of a realistic compiler
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
Partial and Nested Recursive Function Definitions in Higher-order Logic
Journal of Automated Reasoning
On generic context lemmas for higher-order calculi with sharing
Theoretical Computer Science
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Reasoning about incompletely defined programs
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Partial recursive functions in higher-order logic
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
| Hi-index | 0.00 |
A typed program logic LMF for recursive specification and verification is presented. It comprises a strict functional programming language with polymorphic and recursively defined partial functions and polymorphic data types. The logic is two-valued with the equality symbol as only predicate. Quantifiers range over the values, which permits inductive proofs of properties. The semantics is based on a contextual (observational) semantics, which gives a consistent presentation of higher-order functions. Our analysis also sheds new light on the the role of partial functions and loose specifications. It is also an analysis of influence of extensions of programs on the tautologies. The main result is that universally quantified equations are conservative, which is also the base for several other conservative classes of formulas.