Predicate Subtyping with predicate sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2152, Issue , 2001, Pages 265-280

  Hurd, Joe ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; FORMAL LOGIC;

SPECIFICATION AND VERIFICATION; SUBTYPINGS;

THEOREM PROVING;

EID: 23044529556     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44755-5_19     Document Type: Conference Paper

References (18)

1. Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Logic,5:56-68, 1940.
2. Adriana B. Compagnoni. Higher-Order Subtyping with Intersection Types. PhD thesis,Cat holic University, Nigmegen, January 1995.
3. M. J. C. Gordon. Notes on PVS from a HOL perspective. Available from the University of Cambridge Computer Laboratory web server.
4. M. J. C. Gordon and T. F. Melham. Introduction to HOL (A theorem-proving environment for higher order logic). Cambridge University Press,1993.
5. John Harrison. Optimizing proof search in model elimination. In M. A. McRobbie and J. K. Slaney, editors, 13th International Conference on Automated Deduction, volume 1104 of Lecture Notes in Computer Science,p ages 313-327, New Brunswick, NJ, 1996. Springer-Verlag.
6. Joe Hurd. Verification of the Miller-Rabin probabilistic primality test. Submitted as a Category B paper to TPHOLs 2001,Ma y 2001.
7. Michael D. Jones. Restricted types for HOL. In TPHOLs 1997 Category B papers, 1997.
8. Matt Kaufmann and J. S. Moore. Industrial strength theorem prover for a logic based on Common Lisp. IEEE Transactions on Software Engineering,23(4):203-213,April 1997.
9. Leslie Lamport and Lawrence C. Paulson. Should your specification language be typed? ACM Transactions on Programming Languages and Systems,21(3):502-526,May 1999.
10. Harry G. Mairson. Deciding ML typability is complete for deterministic exponential time. In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages,p ages 382-401. ACM SIGACT and SIGPLAN, A CM Press, 1990.
11. R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences,17:348-375, December 1978.
12. Abdel Mokkedem and Tim Leonard. Formal verification of the Alpha 21364 network protocol. In Mark Aagaard and John Harrison,ed itors, Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000,v olume 1869 of Lecture Notes in Computer Science,p ages 443-461, Portland, OR, August 2000. Springer-Verlag.
13. S. Owre, N. Shankar, J. M. Rushby, and D. W. J. Stringer-Calvert. PVS System Guide. Computer Science Laboratory,S RI International, Menlo Park,CA, September 1999.
14. Sam Owre and Natarajan Shankar. The formal semantics of PVS. Technical Report SRI-CSL-97-2, Computer Science Laboratory, S RI International, Men lo Park, CA, August 1997.
15. J. A. Robinson. A note on mechanizing higher order logic. Machine Intelligence, 5:121-135,1970.
16. Mark Saaltink. Domain checking Z specifications. In C. Michael Holloway and Kelly J. Hayhurst,ed itors, LFM’ 97: Fourth NASA Langley Formal Methods Workshop, p ages 185-192, Hampton, VA, September 1997.
17. Natarajan Shankar and Sam Owre. Principles and pragmatics of subtyping in PVS. In D. Bert,C. Choppy, and P. D. Mosses, editors, Recent Trends in Algebraic Development Techniques, WADT’99,v olume 1827 of Lecture Notes in Computer Science,p ages 37-52, Toulouse,F rance, September 1999. Springer-Verlag.
18. Wai Wong. The HOL res quan library. HOL88 documentation.