Sciweavers

596 search results - page 16 / 120
» Subtyping Recursive Types
Sort
View
SCP
2002
119views more  SCP 2002»
15 years 28 days ago
Polymorphic subtyping in O'Haskell
O'Haskell is a programming language derived from Haskell by the addition of concurrent reactive objects and subtyping. Because Haskell already encompasses an advanced type sy...
Johan Nordlander
TABLEAUX
2005
Springer
15 years 6 months ago
A Calculus for Type Predicates and Type Coercion
We extend classical first-order logic with subtyping by type predicates and type coercion. Type predicates assert that the value of a term belongs to a more special type than the ...
Martin Giese
POPL
2004
ACM
16 years 1 months ago
A type system for well-founded recursion
In the interest of designing a recursive module extension to ML that is as simple and general as possible, we propose a novel type system for general recursion over effectful expr...
Derek Dreyer
ICDT
2009
ACM
128views Database» more  ICDT 2009»
16 years 2 months ago
Efficient asymmetric inclusion between regular expression types
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs wi...
Dario Colazzo, Giorgio Ghelli, Carlo Sartiani
ICFP
1997
ACM
15 years 5 months ago
Foundations for the Implementation of Higher-Order Subtyping
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
Karl Crary