Sciweavers

660 search results - page 99 / 132
» The Implicit Calculus of Constructions
Sort
View
ICFP
2010
ACM
13 years 9 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic
CN
2006
80views more  CN 2006»
13 years 9 months ago
Delay bound and packet scale rate guarantee for some expedited forwarding networks
Expedited Forwarding (EF) is a service defined under the Differentiated Services framework. Based on its recently revised definition in IETF RFC 3246, Packet Scale Rate Guarantee ...
Yuming Jiang
ENTCS
2006
125views more  ENTCS 2006»
13 years 8 months ago
Monads and Adjunctions for Global Exceptions
In this paper, we look at two categorical accounts of computational effects (strong monad as a model of the monadic metalanguage, adjunction as a model of call-bypush-value with s...
Paul Blain Levy
FSS
2006
85views more  FSS 2006»
13 years 8 months ago
The logic of tied implications, part 2: Syntax
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
Nehad N. Morsi, Wafik Boulos Lotfallah, Moataz Sal...
ENTCS
2000
59views more  ENTCS 2000»
13 years 8 months ago
Building continuous webbed models for system F
We present here a large family of concrete models for Girard and Reynolds polymorphism (System F), in a non categorical setting. The family generalizes the construction of the mod...
Stefano Berardi, Chantal Berline