A Calculus of Coercive Subtyping by (2009)
by
Fi Mu
,
Matej Kollár
,
Libor Škarvada
,
Faculty Of Informatics
,
Matej Kollár
,
Libor Škarvada
BibTeX
@MISC{Mu09acalculus,
author = {Fi Mu and Matej Kollár and Libor Škarvada and Faculty Of Informatics and Matej Kollár and Libor Škarvada},
title = {A Calculus of Coercive Subtyping by},
year = {2009}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
is permitted for educational or research use on condition that this copyright notice is included in any copy. Publications in the FI MU Report Series are in general accessible via WWW:
Citations
| 474 | Lambda Calculi with Types - Barendregt - 1992 |
| 288 | Subtyping recursive types - Amadio, Cardelli |
| 75 | Pattern matching with dependent types - Coquand - 1992 |
| 46 | A Typed Operational Semantics for Type Theory - Goguen - 1994 |
| 41 | Coercive subtyping - Luo - 1999 |
| 38 | Refinement types for logical frameworks - Pfenning - 1993 |
| 37 | Henk: a typed intermediate language - Jones, Meijer - 1997 |
| 28 | Typechecking dependent types and subtypes - Cardelli - 1988 |
| 13 | Implicit coercions in type systems - Barthe - 1996 |
| 11 | Coercive subtyping for the calculus of constructions - Chen - 2003 |
| 8 | Coercions in a polymorphic type system - Luo - 2008 |
| 7 | Pure type systems with subtyping - Zwanenburg - 1999 |
| 5 | Dependent type system with subtyping - Chen - 1998 |
| 5 | An equational formulation of lf - Harper - 1988 |
| 4 | Dependent record types, subtyping and proof reutilization - Betarte - 1998 |
| 2 | Subtyping dependent types (summary - Aspinall, Compagnoni - 1996 |
