Output details
11 - Computer Science and Informatics
Royal Holloway, University of London
Return to search
Output 0 of 0 in the submission
Article title
Coercions in a polymorphic type system
Type
D - Journal article
Title of journal
Mathematical Structures in Computer Science
Article number
-
Volume number
18
Issue number
4
First page of article
729
ISSN of journal
0960-1295
Year of publication
2008
Number of additional authors
0
Additional information
<11> This paper studies the notion of coercions in the traditional HM-systems with let-polymorphism. It is the first attempt to apply the theory of coercive subtyping to programming language type systems, combining the idea of coercive subtyping, as found in dependent type theories and proof assistants like Coq and Agda, with that of let-polymorphism, as found in typed functional programming languages like ML and Haskell. The work reported in the paper was partially supported by the thematic network TYPES of EU Framework VI (grant ref: 510996).
Interdisciplinary
-
Cross-referral requested
-
Research group
C - Centre for Software Language Engineering
Citation count
12
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
