Sciweavers

291 search results - page 9 / 59
» A Logic for Parametric Polymorphism
Sort
View
DLS
2007
159views Languages» more  DLS 2007»
15 years 1 months ago
Relationally-parametric polymorphic contracts
The analogy between types and contracts raises the question of how many features of static type systems can be expressed as dynamic contracts. An important feature missing in prio...
Arjun Guha, Jacob Matthews, Robert Bruce Findler, ...
ICFP
2007
ACM
15 years 9 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
HASKELL
2006
ACM
15 years 3 months ago
Polymorphic variants in Haskell
In languages that support polymorphic variants, a single variant value can be passed to many contexts that accept different sets of constructors. Polymorphic variants are potenti...
Koji Kagawa
82
Voted
OOPSLA
1989
Springer
15 years 1 months ago
Static Type Inference for Parametric Classes
Method inheritance and data abstraction are central features of objectoriented programming that are attained through a hierarchical organization of classes. Recent studies have sh...
Atsushi Ohori, Peter Buneman
ICLP
1995
Springer
15 years 1 months ago
Type Inferencing for Polymorphic Order-Sorted Logic Programs
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
Christoph Beierle