Sciweavers

17983 search results - page 42 / 3597
» Set Types and Applications
Sort
View
SCP
2010
155views more  SCP 2010»
13 years 6 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
DASFAA
1999
IEEE
84views Database» more  DASFAA 1999»
13 years 12 months ago
P-Tree: A B-Tree Index for Lists
The high frequency of applications involving large, ordered, nested lists suggests that list is the "next most" natural data type after set. A list differs from a set th...
Ke Wang, Beng Chin Ooi, Sam Yuan Sung
TCS
2008
13 years 7 months ago
A typed lambda calculus with intersection types
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...
Viviana Bono, Betti Venneri, Lorenzo Bettini
JFP
2007
136views more  JFP 2007»
13 years 7 months ago
Practical type inference for arbitrary-rank types
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...
ENTCS
2002
115views more  ENTCS 2002»
13 years 7 months ago
Component-Based Applications: A Dynamic Reconfiguration Approach with Fault Tolerance Support
This paper presents a mechanism for dynamic reconfiguration of component-based applications and its fault tolerance strategy. The mechanism, named generic connector, allows compos...
Thaís Vasconcelos Batista, Milano Gadelha C...