R.Amadio: Recursion over realizability structures, Information and Computation, to appear. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A semantic basis for Quest - Cardelli, Longo (1990) (40 citations) (Correct)
....difficulties arise when we try to model simultaneously features such as contravariant function spaces, record types, subtyping, recursive types, and fixpoints. In this paper we concentrate on modeling quantifiers and subtyping; recursive types and values are an active subject of research [Amadio 89] Abadi Plotkin 90] Freyd Mulry Rosolini Scott 90] The model we present for such advanced constructions is particularly simple; the basic concepts are built on top of elementary set and recursion theory. This model has Page 4 been investigated recently within the context of Category Theory, ....
....for recursive values: Page 9 [ E # (x:A)b : A E # (x:A)b b x(x:A)b : A The rules for recursive types and values will not be modeled in the later sections. Nonetheless, we consider them an essential part of the language, and refer the reader to [Amadio 89] Abadi Plotkin 90] and [Freyd Mulry Rosolini Scott 90] for related and ongoing work. The following rules state that the property of having a kind (respectively a type) is invariant under kind (respectively type) equivalence; that is, equivalent kinds and types have the same extensions: ....
R.Amadio: Recursion over realizability structures, Information and Computation, to appear.
A semantic basis for Quest - Luca Cardelli Giuseppe (1990) (40 citations) (Correct)
....difficulties arise when we try to model simultaneously features such as contravariant function spaces, record types, subtyping, recursive types, and fixpoints. In this paper we concentrate on modeling quantifiers and subtyping; recursive types and values are an active subject of research [Amadio 89] Abadi Plotkin 90] Freyd Mulry Rosolini Scott 90] The model we present for such advanced constructions is particularly simple; the basic concepts are built on top of elementary set and recursion theory. This model has been investigated recently within the context of Category Theory, in view ....
....rule for recursive values: E # (x:A)b : A E # (x:A)b b x(x:A)b : A The rules for recursive types and values will not be modeled in the later sections. Nonetheless, we consider them an essential part of the language, and refer the reader to [Amadio 89] Abadi Plotkin 90] and [Freyd Mulry Rosolini Scott 90] for related and ongoing work. The following rules state that the property of having a kind (respectively a type) is invariant under kind (respectively type) equivalence; that is, equivalent kinds and types have the same extensions: ....
R.Amadio: Recursion over realizability structures, Information and Computation, to appear.
A semantic basis for Quest - Cardelli, Longo (1990) (40 citations) (Correct)
....difficulties arise when we try to model simultaneously features such as contravariant function spaces, record types, subtyping, recursive types, and fixpoints. In this paper we concentrate on modeling quantifiers and subtyping; recursive types and values are an active subject of research [Amadio 89] Abadi Plotkin 90] Freyd Mulry Rosolini Scott 90] The model we present for such advanced constructions is particularly simple; the basic concepts are built on top of elementary set and recursion theory. This model has been investigated recently within the context of Category Theory, in view ....
....for recursive values: m] E # m(x:A)b : A E # m(x:A)b ....
R.Amadio: Recursion over realizability structures, Information and Computation, to appear.
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