J. Cederquist iA machine assisted formalization of pointfree topology in type theory.j Technical Report, Chalmers University. A beginning of a complete formalisation of pointfree topology in type theory. Contains still another alternative to the presentation of formal spaces.  Home/Search   Document Not in Database   Context   Related Articles

This paper is cited by the following papers:

Computational Content of Classical Logic - Coquand (1996)   (5 citations)  (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