Bounded existentials and minimal typing
- 28 February 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 193 (1-2) , 75-96
- https://doi.org/10.1016/s0304-3975(96)00300-3
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Divergence of F⩽ type checkingTheoretical Computer Science, 1995
- Bounded Quantification Is UndecidableInformation and Computation, 1994
- An Extension of System F with SubtypingInformation and Computation, 1994
- Coherence of subsumption, minimum typing and type-checking in F ≤Mathematical Structures in Computer Science, 1992
- Abstract types have existential typeACM Transactions on Programming Languages and Systems, 1988
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985
- GALILEO: a strongly-typed, interactive conceptual languageACM Transactions on Database Systems, 1985