Val Breazu-Tannen, Thierry Coquand, Carl A. Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93:172--221, 1991. 19 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Syntactic Considerations on Recursive Types - Abadi, Fiore (1996) (12 citations) (Correct)
....on many previous developments in semantics and in logics of programs. It also has affinities with previous syntactic work, particularly that of Amadio and Cardelli [3] Amadio and Cardelli have shown how to replace subtypings with coercion functions in the presence of recursive types (see also [6]) Our work is complementary to theirs; roughly, their coercion interpretation reduces a calculus with subtyping to one with type equality, and our coercion interpretation reduces one with type equality to one with isomorphism. Another relevant syntactic investigation is that of Plotkin [19] who ....
Val Breazu-Tannen, Thierry Coquand, Carl A. Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93(1):172--222, July 1991.
Higher-Order Subtyping - Steffen, Pierce (1994) (7 citations) (Correct)
....Compagnoni and Pierce [CP93] gave a model for an extension of F with intersection types. A more powerful model including recursive types was given by Bruce and Mitchell [BM92] The second order fragment of F , called F , has been studied in detail, yielding both positive [Mar88, BL90, BCGS91, Ghe90, CG92, CG91, CMMS91, Ghe93b] and some surprising negative results [Ghe93a, Ghe93b, GP92, Pie92] including undecidability. Decidable variants of F have been proposed [CW85, KS92, CP94] our formulation of F is based on [CW85] But for the full order calculus, next to nothing is ....
....calculi with subtyping, the subtyping relation itself presents the most challenging problems. This is also the case in F . 6. 1 Proof Outline Although the details of our development will be somewhat more involved, it is helpful to start by reviewing the standard argument [CG92, Ghe90, CMMS91, BCGS91, etc. for the decidability of subtyping in the second order system F : 1. Begin with an original presentation of the subtyping system that directly expresses its intended meaning, but which is not directly implementable. 2. Propose an alternative presentation of the same relation by a ....
[Article contains additional citation context not shown here]
Val Breazu-Tannen, Thierry Coquand, Carl Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93:172--221, 1991. 35
A Temporal-Logic Approach to Binding-Time Analysis - Davies (1995) (75 citations) (Correct)
....annotated language and the original language. If we consider next, prev and the lift coercions to all be implicit coercions in the original language, then we have a type system including fl for this language that is reminiscent of sub typing in the style of work by Breazu Tannen et.al. [1]. Doing type inference and making these coercions explicit is then exactly a binding time analysis. However, next and prev are not functions, so they are quite different from other implicit coercions. could also serve as the basis for an extension of a statically typed language like Standard ....
Val Breazu-Tannen, Thierry Coquand, Carl Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93:172--221, 1991.
Subtyping and Inheritance for Categorical Datatypes - Poll (1997) (1 citation) (Correct)
....o) coerce (getcount o) This is a co iterative definition of an function to Counter like the ones we have seen before. It uses count:Counter Counter and getcount:Counter Nat in the right hand sides, and in the left hand sides it uses getcount:RCounter Nat and count:RCounter RCounter. In [BCGS89] it is observed that coercion functions needed to interpret subtyping in Fun, a second order lambda calculus with records, are already definable in the syntax. Here we see that this extends to coalgebraic datatypes with coiteration. The fact that the coherence conditions completely determine the ....
V. Breazu-Tannen, Th. Coquand, C. A. Gunter, and A. Scedrov. Inheritance as implicit coercion. In Logic in Computer Science, pages 112--129. IEEE, 1989.
Type-Based Hot Swapping of Running Modules - Duggan (2001) (19 citations) (Correct)
....form of subtyping, based on inclusion of reference type constructors. Although it appears straightforward to extend this with subtyping based on interface containment, a more worthwhile direction to consider may be subtyping based on implicit automatically generated coercions between interfaces [7, 37]. Currently our type system allows dynamically defined equality constraints (A = B) realized by coercions between A and B. It would be interesting and useful to allow dynamically defined inequalities (A # B) realized by a coercion from A to B. This generalizes such an implicit coercion, ....
Val Breazu-Tannen, Thierry Coquand, Carl Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93(1):172--221, 1991.
Toward a Practical Type Theory for Recursive Modules - Dreyer, Harper, Crary (2001) (6 citations) (Correct)
.... to use Crary s coercion calculus [3] The broader goal of the coercion calculus is to eliminate inclusive subtyping and bounded quantification in typedirected compilers, without introducing the run time costs of coercions inherent in the well known Penn interpretation of Breazu Tannen et al. [2]. Crary achieves this by putting the subtyping coercion functions into a separate syntactic class so that they can be easily discarded before runtime. 22 Crary s system is appealing for our purposes because it can generate static coercions between any two extensionally equivalent types. By ....
Val Breazu-Tannen, Thierry Coquand, Carl A. Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93:172--221, 1991.
Toward a Practical Type Theory for Recursive Modules - Dreyer, Harper, Crary (2001) (6 citations) (Correct)
.... is to use Crary s coercion calculus [3] The broader goal of the coercion calculus is to eliminate inclusive subtyping and bounded quanti cation in typedirected compilers, without introducing the run time costs of coercions inherent in the well known Penn interpretation of Breazu Tannen et al. [2]. Crary achieves this by putting the subtyping coercion functions into a separate syntactic class so that they can be easily discarded before runtime. 22 Crary s system is appealing for our purposes because it can generate static coercions between any two extensionally equivalent types. By ....
Val Breazu-Tannen, Thierry Coquand, Carl A. Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93:172-221, 1991.
Compiling Polymorphism Using Intensional Type - Analysis Robert Harper (Correct)
No context found.
Val Breazu-Tannen, Thierry Coquand, Carl A. Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93:172--221, 1991. 19
Dynamic Updating of Information-Flow Policies - Michael Hicks Stephen (2005) (1 citation) (Correct)
No context found.
Val Breazu-Tannen, Thierry Coquand, Carl Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93:172--221, 1991.
Subtyping and Parametricity - Plotkin, Abadi, Cardelli (1993) (4 citations) (Correct)
No context found.
Val Breazu-Tannen, Thierry Coquand, Carl A. Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93(1):172--222, July 1991.
A Formal Calculus for Categories - Caccamo (2003) (Correct)
No context found.
Val Breazu-Tannen, Thierry Coquand, Carl Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 1991.
A Formal Calculus for Categories - Caccamo (2003) (Correct)
No context found.
Val Breazu-Tannen, Thierry Coquand, Carl Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 1991.
Subtyping Dependent Types - David Aspinall Lfcs (1996) (30 citations) (Correct)
No context found.
Val Breazu-Tannen, Thierry Coquand, Carl A. Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93:172--221, 1991.
Subtyping with Power Types - Aspinall (2000) (Correct)
No context found.
Val Breazu-Tannen, Thierry Coquand, Carl A. Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93:172--221, 1991.
Types, Subtypes, and ASL+ - David Aspinall Department (Correct)
No context found.
Val Breazu-Tannen, Thierry Coquand, Carl A. Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93:172--221, 1991.
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