Topology in PVS: Continuous mathematics with applications

AFM'07: 2nd Workshop on Automated Formal Methods

Volumn , Issue , 2007, Pages 11-20

  Lester, David R ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

continuous mathematics; probability; programming language semantics; proof assistants; PVS; theorem provers; topology

Indexed keywords

PROGRAMMING LANGUAGE SEMANTICS; PROOF ASSISTANT; PROOF ASSISTANTS; PVS; PVS THEOREM;

ATOMIC FORCE MICROSCOPY; C (PROGRAMMING LANGUAGE); FORMAL METHODS; LINGUISTICS; SEMANTICS; THEOREM PROVING;

TOPOLOGY;

EID: 77954578881     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1345169.1345171     Document Type: Conference Paper

References (23)

1. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 3. Oxford University Press, 1994.
2. T. Apostol. Mathematical Analysis. Addison-Wesley, 2 edition, 1974.
3. S. Berberian. Fundamentals of Real Analysis. Springer-Verlag, 1999.
4. J. Bialas. σ-additive measure theory. Journal of Formalized Mathematics, 2, 1990.
5. J. Bialas. Properties of caratheodor's measure. Journal of Formalized Mathematics, 14, 1992.
6. N. Bourbaki. General Topology. Addison-Wesley, 1966.
7. N. Cutland. Computability. Cambridge University Press, 1980.
8. B. Davey and H. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.
9. J. de Bakker. Mathematical Theory of Program Correctness. Prentice-Hall, 1980.
10. J. Dettman. Mathematical Methods in Physics and Engineering. McGraw-Hill, 1962.
11. M. Gordon. The Denotational Description of Programming Languages. Springer-Verlag, 1979.
12. G. Grimmett and D. Stirzaker. Probability and Random Processes. Oxford University Press, 1982.
13. P. Halmos. Measure Theory. van Nostrand, 1950.
14. J. Hurd. Formal verification of Probabilistic Algorithms. PhD thesis, University of Cambridge, 2002.
15. D. Lester. Combinator Graph Reduction: A Congruence and its Applications. PhD thesis, Oxford University, 1988.
16. A. Nedzusiak. σ-fields and probability. Journal of Formalized Mathematics, 1, 1989.
17. A. Nedzusiak. Probability. Journal of Formalized Mathematics, 2, 1990.
18. H. Nielson and F. Nielson. Semantics with Applications. John Wiley and Sons, 1992.
19. J. Shepherdson and H. Sturgis. Computability of recursive functions. J. ACM, 10:217-255, 1963.
20. H. Simmons. Derivation and Computation. Cambridge University Press, 2000.
21. J. Stoy. Denotational Semantics: The Scott-Strachey Approach. MIT Press, 1977.
22. W. Sutherland. Introduction to Metric and Topological Spaces. Oxford University Press, 1975.
23. A. Weir. Lebesgue Integration and Measure. Cambridge University Press, 1973.