17983 search results - page 123 / 3597 » Set Types and Applications |
226
click to vote
FORTE
2011
14 years 10 months ago
2011
We present a new, streamlined language of global types equipped with a trace-based semantics and whose features and restrictions are semantically justified. The multi-party sessio...
148
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...
174
click to vote
APLAS
2009
ACM
16 years 28 days ago
2009
ACM
Bounded existential types are a powerful language feature ling partial data abstraction and information hiding. However, existentials do not mingle well with subtyping as found in ...
174
click to vote
APLAS
2000
ACM
15 years 10 months ago
2000
ACM
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
162
click to vote
DBPL
2007
Springer
15 years 10 months ago
2007
Springer
Inclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleavin...