G. Plotkin. Full abstraction, totality, and PCF. Mathematical Structures in Computer Science, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Effective Cartesian Closed Categories of Domains - Hamrin, Stoltenberg-Hansen (2001) (Correct)
....can in principle be performed on a digital computer. External computations over type structures have applications, for example, in recursive analysis. 1 There are typed programming languages with semantics on certain e#ective type structures. Examples of such languages are PCF (Plotkin [8, 9]) and Real PCF (Escardo [4] These induce an internal notion of e#ectivity on the type structures in question. Thus we have a framework to compare the strength of the internal and external notions of e#ectivity. An interesting example of such comparison, which also involves the notion of ....
G. Plotkin, Full abstraction, totality and PCF, Mathematical Structures in Computer Science 9 (1999), 1 -- 20.
Continuous Functionals of Dependent Types and Equilogical Spaces - Bauer, Birkedal (2000) (2 citations) (Correct)
....and dependent products in equilogical spaces, and thus also in the realizability topos RT(P ) Keywords: continuous functionals, dependent type theory, domain theory, equilogical spaces. 1 Introduction Recently there has been a lot of interest in understanding notions of totality for domains [3, 23, 4, 18, 21]. There are several reasons for this. Totality is the semantic analogue of termination, and one is naturally interested in understanding not only termination properties of programs but also how notions of program equivalence depend on assumptions regarding termination [21] Another reason for ....
....for domains [3, 23, 4, 18, 21] There are several reasons for this. Totality is the semantic analogue of termination, and one is naturally interested in understanding not only termination properties of programs but also how notions of program equivalence depend on assumptions regarding termination [21]. Another reason for studying totality on domains is to obtain generalizations of the nite type hierarchy of total continuous functionals by Kleene and Kreisel [11] see [8] and [19] for good accounts of this subject. Ershov [7] showed how the Kleene Kreisel functionals arise in a ....
G. Plotkin. Full abstraction, totality, and PCF. Mathematical Structures in Computer Science, 1998.
Continuous Functionals of Dependent Types and Equilogical Spaces - Bauer, Birkedal (2000) (2 citations) (Correct)
....and dependent products in equilogical spaces, and thus also in the realizability topos RT(P ) Keywords: continuous functionals, dependent type theory, domain theory, equilogical spaces. 1 Introduction Recently there has been a lot of interest in understanding notions of totality for domains [3, 23, 4, 18, 21]. There are several reasons for this. Totality is the semantic analogue of termination, and one is naturally interested in understanding not only termination properties of programs but also how notions of program equivalence depend on assumptions regarding termination [21] Another reason for ....
....for domains [3, 23, 4, 18, 21] There are several reasons for this. Totality is the semantic analogue of termination, and one is naturally interested in understanding not only termination properties of programs but also how notions of program equivalence depend on assumptions regarding termination [21]. Another reason for studying totality on domains is to obtain generalizations of the finite type hierarchy of total continuous functionals by Kleene and Kreisel [11] see [8] and [19] for good accounts of this subject. Ershov [7] showed how the Kleene Kreisel functionals arise in a ....
G. Plotkin. Full abstraction, totality, and PCF. Mathematical Structures in Computer Science, 1998.
Continuous Functionals of Dependent Types and Equilogical Spaces - Bauer, Birkedal (2000) (2 citations) (Correct)
No context found.
G. Plotkin. Full abstraction, totality, and PCF. Mathematical Structures in Computer Science, 1998.
Constructive Data Refinement in Typed Lambda Calculus - Honsell, Longley.. (2000) (4 citations) (Correct)
No context found.
G.D. Plotkin. Full abstraction, totality and PCF. Mathematical Structures in Computer Science 9(1):1--20, 1997.
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