Martin Hofmann and Benjamin C. Pierce. Positive subtyping. Information and Computation, 126(1):11--33, 10 April 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Thesis Proposal: Formal Verification Of Program Correctness For.. - Tang (Correct)
....desired verification judgement using the derivation of the superclass s judgement, but a more ambitious target would be to be able to derive the desired judgement directly from the superclass s judgement, without its derivation. Hofmann and Pierce have already made progress in this direction in [14] for an object language in a functional setting. ....
Martin Hofmann and Benjamin C. Pierce. Positive subtyping. Information and Computation, 126(1):11--33, 10 April 1996.
Anti-Symmetry of Higher-Order Subtyping - Compagnoni, Goguen (1999) (2 citations) (Correct)
....was carried out at LFCS, University of Edinburgh, JCMB, The King s Buildings, Edinburgh, EH9 3JZ, UK. The subtyping relation has been extensively researched because of its importance in applications to programming languages [1, 6, 21, 28] proof assistants [3, 25, 29] and metatheoretical studies [4, 5, 7, 10, 14 16, 18, 19, 24, 30], to name a few. However, none of these studies has established the anti symmetry of the subtyping relation for a higher order calculus. In some cases it has been conjectured, as in [35] In other cases, the problem is avoided by taking an equality that satis es anti symmetry by de nition: A = B ....
M. Hofmann and B. Pierce. Positive subtyping. Information and Computation, 126(1), 1996.
A Type System for Record Concatenation and Subtyping - Zwanenburg (1996) (1 citation) (Correct)
....changes a field of a record, regardless of the presence of other fields in the record. Such a function is called a polymorphic record update. 1 The second problem is caused by the fact that ordinary subtyping is too liberal, so it seems natural to restrict subtyping. This approach is taken in [HP96], but it seems that for some programs still ordinary subtyping is needed. Another way to solve the problem is to introduce more powerful types, that express the absence of a field from a record. If this is the case, it is safe to extend the record with this field. Coupled with record restriction ....
....R and S is denoted by R# S (R compatible with S) To solve the polymorphic update problem a new form of bounded quantification is introduced. The type variable must be both a subtype of, and compatible with, a certain record type, effectively imposing the same stringent form of subtyping as in [HP96]. In this way problems 1 and 2 are both solved without resorting to record restriction. Systems than can remove a field from a record are in some sense more powerful, but this power is not needed for encoding most concepts of OOP. So the characteristic ingredients of our system are: ffl Record ....
[Article contains additional citation context not shown here]
Martin Hofmann and Benjamin Pierce. Positive subtyping. Information and Computation, 126(1):11--33, 1996.
Basic theory of F-bounded quantification - Baldan, Ghelli, Raffaetą (Correct)
....The interested reader can consult the book [Gun92] where it is shown how a p.e.r. model of the second order polymorphic lambda calculus can be defined starting from a generic (untyped) lambda model. An explicit construction of a semantics for a variant of system F is also carried out in [HP96] The previous lemma immediately implies that a term a of type A is interpreted as an equivalence class (value) in the semantics of A. Such a result expresses the soundness of typing with respect to the semantics. 54 Corollary 10.11 (soundness of typing) If Gamma; Delta a : A, then, 8hfl; ....
M. Hofmann and B. C. Pierce. Positive subtyping. Information and Computation, 126(1):11--33, 1996.
Operational Subsumption, an Ideal Model of Subtyping - Dami (1998) (Correct)
....demonstrated that in usual interpretations of subtypes as subsets the polymorphic type 8X T:X X can only contain the identity function, which makes it impossible to type some elementary updating operations on objects. The problem is developed in more detail in Chapter 16 of [2] Some authors [13,20] have proposed to solve the problem by restricting the subtype relation in various ways so as to ensure that the subtypes have the same structure as the supertype. Here we show that usual subtyping and structural subtyping are two distinct notions semantically. The former corresponds to a subset ....
....This program is carried out in [20] where subtyping is restricted to pointwise equality on fields between record PERs ; however this interpretation prohibits depth subtyping on records, which is somewhat unsatisfactory because intuitively this form of subtyping is structural. Hofmann and Pierce [13] have a more general approach where the statement T : U is interpreted as a standard coercion c : T U together with an overwrite function put[T; U ] T U U which updates the U part of an element of T without changing the remaining part . However this approach only works in cases of ....
Martin Hofmann and Benjamin C. Pierce. Positive subtyping. Information and Computation, 126(1):11-33, 10 April 1996.
Scientific Discovery from the Perspective of Hypothesis.. - Martin, Osherson (2000) Self-citation (Martin Osherson) (Correct)
.... Discovery from the Perspective of Hypothesis Acceptance # Eric Martin University of New South Wales Daniel Osherson Rice University April 27, 2000 Abstract A model of inductive inquiry is defined within the context of first order logic. The model conceives of inquiry as a game between Nature and a scientist. To begin the game, a nonlogical vocabulary is agreed upon by the two players, along with a partition of a class of countable ....
Martin, E. & Osherson, D. (2000a). Induction by enumeration. Information and Computation. (To appear).
Sound and Complete Axiomatisations of Call-By-Value Control.. - Hofmann (1994) (15 citations) Self-citation (Hofmann) (Correct)
No context found.
Martin Hofmann 22 Eugenio Moggi. Notions of computation and monads. Information and Computation, 93:55--92, 1991.
System F with Width-subtyping and Record Updating - Poll (1997) (Correct)
No context found.
Martin Hofmann and Benjamin C. Pierce. Positive subtyping. Information and Computation, 126(1):11--33, 10 April 1996.
Probability, Nondeterminism and Concurrency: Two Denotational.. - Varacca (2003) (Correct)
No context found.
J. Martin E. Hyland and C.-H. Luke Ong. On full abstraction for PCF: I, II, and III. Information and Computation, 163(2):285--408, December 2000.
Basic theory of F-bounded quantification - Baldan, Ghelli, Raffaetà (1999) (Correct)
No context found.
M. Hofmann and B. C. Pierce. Positive subtyping. Information and Computation, 126(1):11--33, 1996.
Head Linear Reduction - Danos, Regnier (2004) (Correct)
No context found.
Martin Hyland and Luke Ong. On full abstraction for PCF. Information and Computation, 163:285-- 408, 2000.
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