Jan Cederquist  Home/Search
Context
Related
| cs.chalmers.se/pub/users/ce...HBimpl.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.jussieu.fr....cs.chalmers.se (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We describe an implementation, in type theory, of a proof of a pointfree formulation of the Heine-Borel covering theorem for intervals with rational endpoints. 1 Introduction The proof presented here is a complete formalisation of the proof presented in "A constructive proof of the Heine-Borel covering theorem for formal reals" [CN]. We describe an implementation, in type theory, of a proof of a pointfree formulation of the Heine-Borel covering theorem for intervals with rational endpoints.... (Update)
Similar documents (at the sentence level):
27.0%: A Machine Assisted Proof of the Hahn-Banach Theorem - Cederquist (1997) (Correct)
Active bibliography (related documents): More All
0.4: Type Theory and Programming - Coquand, Nordström, Smith, von Sydow (1994) (Correct)
0.3: Inductively Generated Formal Topologies - Coquand, Sambin, Smith, Valentini (Correct)
0.2: A Pointfree approach to Constructive Analysis in Type Theory - Cederquist (1997) (Correct)
Similar documents based on text: More All
0.2: Entailment Relations and Distributive Lattices - Cederquist, Coquand (1998) (Correct)
0.2: The Hahn-Banach Theorem in Type Theory - Cederquist, Coquand, Negri (1997) (Correct)
0.2: A Machine Assisted Formalization of Pointfree Topology in Type.. - Cederquist (1994) (Correct)
BibTeX entry: (Update)
@inproceedings{ cederquist96implementation,
author = "Jan Cederquist",
title = "An Implementation of the Heine-Borel Covering Theorem in Type Theory",
booktitle = "{TYPES}",
pages = "46-65",
year = "1996",
url = "citeseer.ist.psu.edu/359912.html" }
Citations (may not include all citations):382 Lambda calculi with types - Barendregt - 1992
113 Computer Science Laboratory (context) - Owre, Shankar et al. - 1993
65 The Implementation of ALF - a Proof Editor based on MartinL .. - Magnusson - 1995
23 Archive for Mathematical Logic (context) - Negri, Soravia et al.
23 An algorithm for type-checking dependent types - Coquand - 1996
14 Intuitionistic formal spaces -- a first communication (context) - Sambin - 1987
5 A plea for weaker frameworks (context) - de Bruijn - 1991
4 A constructive proof of the Heine-Borel covering theorem for.. - Cederquist, Negri - 1996
3 A model of intensional Martin-Lof type theory in which unici.. (context) - Hofmann - 1993
2 A memorandum on the constructive axioms of linear order (context) - von Plato - 1995
1 To be published in the proceedings of Twenty-five years of C.. (context) - Martin-Lof, Theory - 1972
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/ftp.cs.chalmers.se.html): More
From Gamma to CBS: Refining multiset transformations with.. - Sands, Weichert (1997) (Correct)
Reflections on Reflections - Barthe, Hatcliff, Sørensen (1997) (Correct)
A Parallel Functional Database on GRIP - Akerholt, Hammond, Jones, Trinder (1992) (Correct)
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