Semantics with applications: a formal introduction
Semantics with applications: a formal introduction
Handbook of logic in computer science (vol. 3)
Computability of Recursive Functions
Journal of the ACM (JACM)
Mathematical Theory of Program Correctness
Mathematical Theory of Program Correctness
The Denotational Description of Programming Languages: An Introduction
The Denotational Description of Programming Languages: An Introduction
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Three chapters of measure theory in Isabelle/HOL
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
On the formalization of the lebesgue integration theory in HOL
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Formalization of Measure Theory and Lebesgue Integration for Probabilistic Analysis in HOL
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
Type classes and filters for mathematical analysis in Isabelle/HOL
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
Topology can seem too abstract to be useful when first encountered. My aim in this paper is to show that --- on the contrary --- it is the vital building block for continuous mathematics. In particular, if a proof can be undertaken at the level of topology, it is almost always simpler there than when undertaken within the context of specific classes of topology such as those of metric spaces or Domain Theory.