Sciweavers

56 search results - page 4 / 12
» Implementing Parameterized Type Algorithm Definitions in Mat...
Sort
View
TLDI
2005
ACM
126views Formal Methods» more  TLDI 2005»
13 years 11 months ago
Type inference for atomicity
Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...
Cormac Flanagan, Stephen N. Freund, Marina Lifshin
ICFP
2005
ACM
14 years 6 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells
CAISE
2006
Springer
13 years 9 months ago
A Tool for Semi-Automated Semantic Schema Mapping: Design and Implementation
Recently, schema mapping has found considerable interest in both research and practice. Determining matching components of database or XML schemas is needed in many applications, e...
Dimitris Manakanatas, Dimitris Plexousakis
LICS
1999
IEEE
13 years 10 months ago
Subtyping Recursive Types in Kernel Fun
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
Dario Colazzo, Giorgio Ghelli
JFP
2008
97views more  JFP 2008»
13 years 4 months ago
HM(X) type inference is CLP(X) solving
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
Martin Sulzmann, Peter J. Stuckey