Sciweavers

237 search results - page 30 / 48
» Coercions in a polymorphic type system
Sort
View
LISP
2002
107views more  LISP 2002»
13 years 8 months ago
Dependent Types for Program Termination Verification
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...
Hongwei Xi
ECOOP
2009
Springer
14 years 9 months ago
Type-Based Object Immutability with Flexible Initialization
We present a type system for checking object immutability, read-only references, and class immutability in an open or closed world. To allow object initialization outside object co...
Christian Haack, Erik Poll
SAC
2006
ACM
14 years 2 months ago
Union types for object-oriented programming
We propose union types for statically typed class-based objectoriented languages as a means to enhance the flexibility of subtyping. As its name suggests, a union type can be con...
Atsushi Igarashi, Hideshi Nagira
OOPSLA
2010
Springer
13 years 7 months ago
Type classes as objects and implicits
Type classes were originally developed in Haskell as a disciplined alternative to ad-hoc polymorphism. Type classes have been shown to provide a type-safe solution to important ch...
Bruno C. d. S. Oliveira, Adriaan Moors, Martin Ode...
ICFP
2007
ACM
14 years 8 months ago
A generic usage analysis with subeffect qualifiers
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
Jurriaan Hage, Stefan Holdermans, Arie Middelkoop