Sciweavers

81 search results - page 16 / 17
» Sound and Complete Tree-Sequent Calculus for Inquisitive Log...
Sort
View
PPDP
2010
Springer
13 years 3 months ago
Equational axiomatization of call-by-name delimited control
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
Yukiyoshi Kameyama, Asami Tanaka
DLS
2008
149views Languages» more  DLS 2008»
13 years 7 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
BIRTHDAY
2005
Springer
13 years 10 months ago
Compiled Labelled Deductive Systems for Access Control
This paper proposes a Compiled Labelled Deductive System, called ACCLDS, for reasoning about role-based access control in distributed systems, which builds upon Massacci’s tablea...
Krysia Broda, Alessandra Russo
SCP
2010
155views more  SCP 2010»
13 years 3 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
ICFP
2002
ACM
14 years 5 months ago
Type classes with more higher-order polymorphism
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
Matthias Neubauer, Peter Thiemann