Equational axiomatization of bicoercibility for polymorphic types
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 166-179
- https://doi.org/10.1007/3-540-60692-0_47
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Subtype inequalitiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A Calculus for Overloaded Functions with SubtypingInformation and Computation, 1995
- Isomorphisms of Types: from λ-calculus to information retrieval and language designPublished by Springer Nature ,1995
- Bounded Quantification Is UndecidableInformation and Computation, 1994
- An Extension of System F with SubtypingInformation and Computation, 1994
- Decidable bounded quantificationPublished by Association for Computing Machinery (ACM) ,1994
- Efficient type reconstruction in the presence of inheritancePublished by Springer Nature ,1993
- Type reconstruction with recursive types and atomic subtypingPublished by Springer Nature ,1993
- Inheritance as implicit coercionInformation and Computation, 1991