Skip to main content
Conference Proceedings

Predicate Subtyping with predicate sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2152 265-280
DOI: 10.1007/3-540-44755-5_19
7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show how PVS-style predicate subtyping can be simulated in HOL using predicate sets,a nd explain how to perform subtype checking using this model. We illustrate some applications of this to specification and verification in HOL,an d also demonstrate some limits of the approach. Finally we report on the effectiveness of a subtype checker used as a condition prover in a contextual rewriter.

Cite

CITATION STYLE

APA

Hurd, J. (2001). Predicate Subtyping with predicate sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2152, pp. 265–280). Springer Verlag. https://doi.org/10.1007/3-540-44755-5_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free