Coercions in a polymorphic type system

13 years 2 months ago
Coercions in a polymorphic type system
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The traditional type system with let-polymorphism is extended with argument coercions and function coercions, and a corresponding type inference algorithm is presented and proved to be sound and complete.
Zhaohui Luo
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2008
Where MSCS
Authors Zhaohui Luo
Comments (0)