Sciweavers

5451 search results - page 137 / 1091
» Typed Operational Semantics
Sort
View
120
Voted
ICFP
1999
ACM
15 years 8 months ago
Flexible Type Analysis
Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, and fla...
Karl Crary, Stephanie Weirich
129
Voted
LICS
2003
IEEE
15 years 9 months ago
Structural Subtyping of Non-Recursive Types is Decidable
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
Viktor Kuncak, Martin C. Rinard
134
Voted
PLANX
2008
15 years 5 months ago
Linear Time Membership for a Class of XML Types with Interleaving and Counting
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
110
Voted
CSL
2004
Springer
15 years 9 months ago
Subtyping Union Types
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
Jerome Vouillon
114
Voted
ENTCS
2002
108views more  ENTCS 2002»
15 years 3 months ago
Rewriting in the partial algebra of typed terms modulo AC
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
Thomas Colcombet