See this document in CiteSeerX!

Formalizing Integration Theory, with an Application to Probabilistic Algorithms (2003)  (Make Corrections)  
Stefan Richter



  Home/Search   Context   Related

 
View or download:
lti.informatik.rwthaache...diploma.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  lti.informatik.rwthaache...index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Inter alia, Lebesgue-style integration plays a major role in advanced probability. We formalize a significant part of its theory in Higher Order Logic using the generic interactive theorem prover Isabelle/Isar. This involves concepts of elementary measure theory, real-valued random variables as Borelmeasurable functions, and a stepwise inductive definition of the integral itself. Building on previous work about formal verification of probabilistic algorithms, we exhibit an example application... (Update)

Active bibliography (related documents):   More   All
0.3:   Bridging Theorem Proving and Mathematical - Knowledge Retrieval Christoph (2005)   (Correct)
0.3:   Type Theory and Rewriting - BLANQUI (2001)   (Correct)
0.3:   Deliverables: A Categorical Approach to Program Development in.. - McKinna (1992)   (Correct)

Similar documents based on text:   More   All
0.3:   Isabelle Tutorial and User's Manual - Paulson, Nipkow (1990)   (Correct)
0.3:   Machine-checking the Java Specification: Proving Type-Safety - von Oheimb, Nipkow (1998)   (Correct)
0.3:   Type Reconstruction for Type Classes - Nipkow, Prehofer (1993)   (Correct)

BibTeX entry:   (Update)

@misc{ richter-formalizing,
  author = "Stefan Richter",
  title = "Formalizing Integration Theory, with an Application to Probabilistic Algorithms",
  url = "citeseer.ist.psu.edu/richter03formalizing.html" }
Citations (may not include all citations):
837   Cambridge University Press (context) - Motwani, Raghavan - 1997
809   A theory of type polymorphism in programming (context) - Milner - 1977
592   Introduction to HOL: A theorem proving environment for highe.. (context) - Gordon, Melham - 1993
466   Probability and Measure (context) - Billingsley - 1986
362   ML for the Working Programmer (context) - Paulson - 1996
145   Isabelle: The next 700 theorem provers (context) - Paulson - 1990
81   Isabelle: A generic theorem prover (context) - Paulson - 1994
75   Probability with Martingales (context) - Williams - 1991
69   IsabelleHOL Proof Assistant Higher Order Logic (context) - Lawrence, Markus et al. - 2002
26   Order-sorted polymorphism in isabelle (context) - Nipkow - 1993
10   Basic properties of rational numbers (context) - Kondracki - 1990
9   Using axiomatic type classes in Isabelle - Wenzel - 2002
7   Ma- und Integrationstheorie (context) - Bauer - 1990
6   IsabelleIsar versatile environment human readable formal.. - Isabelle, environment et al. - 2002
5   Computer assisted reasoning with MIZAR (context) - Trybulec, Blair - 1985
4   Turku Centre for Computer Science (context) - Harrison, Technical - 1996
3   A simple theory of types (context) - Church - 1940
1   Available on the web as http://citeseer (context) - Harrison, with et al. - 1996
1   Mechanizing nonstandard real analysis (context) - Fleuriot, Paulson - 2000
1   The measurability of extended real valued functions (context) - Endou, Wasaki et al. - 2000
1   Available web as httpisabelle (context) - Lawrence, Markus et al. - 2002
1   Formal Verification of Probabilistic Algorithms (context) - Hurd - 2002
1   BI-Wissenschafts-Verlag (context) - Oberschelp - 1993
1   Definitions and basic properties of measurable functions (context) - Endou, Wasaki et al. - 2000
1   Real Analysis (context) - Royden - 1968
1   An introduction to the gauge integral (context) - Schechter - 2001

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC