Sciweavers

8021 search results - page 98 / 1605
» A Type System for Tom
Sort
View
LPAR
2010
Springer
13 years 7 months ago
Logic and Computation in a Lambda Calculus with Intersection and Union Types
We present an explicitly typed lambda calculus "`a la Church" based on the union and intersection types discipline; this system is the counterpart of the standard type a...
Daniel J. Dougherty, Luigi Liquori
EOR
2006
48views more  EOR 2006»
13 years 9 months ago
A two threshold vacation policy in multiserver queueing systems
We consider a queueing system with c servers and a threshold type vacation policy. In this system, when a certain number d<c of servers become idle at a service completion inst...
Naishuo Tian, Zhe George Zhang
DLS
2008
149views Languages» more  DLS 2008»
13 years 10 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
IFIP
2004
Springer
14 years 2 months ago
PolyA: True Type Polymorphism for Mobile Ambients
Previous type systems for mobility calculi (the original Mobile Ambients, its variants and descendants, e.g., Boxed Ambients and Safe Ambients, and other related systems) offer lit...
Torben Amtoft, Henning Makholm, J. B. Wells
ICFP
2005
ACM
14 years 9 months ago
Qualified types for MLF
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
Andres Löh, Daan Leijen