A. Bauer. Topology and computability. Thesis proposal, Carnegie Mellon University. Available from http://www.cs.cmu.edu/~birkedal/ltc/ (1998). Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Constructive Data Refinement in Typed Lambda Calculus - Honsell, Longley.. (2000) (4 citations) (Correct)
.... There are other natural models in which the interpretation of real real is constrained to include only continuous functions (this seems reasonable since in fact all computable total functions R R are continuous) Mathematical structures which provide Henkin models for our SP are studied in e.g. [Nor98,Bau98] Some of these models contain copies of the classical reals R, while others contain only the computable (or recursive) reals. 5.2 A specification for PCF computations We now present a specification SP 0 corresponding to the familiar functional language PCF [Plo77] A constructive refinement ....
A. Bauer. Topology and computability. Thesis proposal, Carnegie Mellon University. Available from http://www.cs.cmu.edu/~birkedal/ltc/ (1998).
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