System FC with explicit kind equality
- 25 September 2013
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 48 (9), 275-286
- https://doi.org/10.1145/2544174.2500599
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Explicit convertibility proofs in pure type systemsPublished by Association for Computing Machinery (ACM) ,2013
- Giving Haskell a promotionPublished by Association for Computing Machinery (ACM) ,2012
- Canonicity for 2-dimensional type theoryPublished by Association for Computing Machinery (ACM) ,2012
- Observational equality, now!Published by Association for Computing Machinery (ACM) ,2007
- System F with type equality coercionsPublished by Association for Computing Machinery (ACM) ,2007
- Simple unification-based type inference for GADTsPublished by Association for Computing Machinery (ACM) ,2006
- Associated type synonymsPublished by Association for Computing Machinery (ACM) ,2005
- Intensional polymorphism in type-erasure semanticsPublished by Association for Computing Machinery (ACM) ,1998
- Cayenne—a language with dependent typesPublished by Association for Computing Machinery (ACM) ,1998
- Encoding types in ML-like languagesPublished by Association for Computing Machinery (ACM) ,1998