Sciweavers

429 search results - page 20 / 86
» Parameter-free polymorphic types
Sort
View
ICFP
2005
ACM
15 years 9 months ago
Qualified types for MLF
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
Andres Löh, Daan Leijen
TPHOL
2007
IEEE
15 years 3 months ago
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
Norbert Völker
78
Voted
JFP
2006
103views more  JFP 2006»
14 years 9 months ago
Phantom types and subtyping
We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to mo...
Matthew Fluet, Riccardo Pucella
SCAM
2008
IEEE
15 years 3 months ago
Type Highlighting: A Client-Driven Visual Approach for Class Hierarchies Reengineering
Polymorphism and class hierarchies are key to increasing the extensibility of an object-oriented program but also raise challenges for program comprehension. Despite many advances...
Petru Florin Mihancea
78
Voted
FLOPS
2004
Springer
15 years 2 months ago
Relaxing the Value Restriction
Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features. While this solution has undeniable advant...
Jacques Garrigue