Sciweavers

154 search results - page 28 / 31
» Some Logical Properties of Nonmonotonic Causal Theories
Sort
View
AIML
2004
13 years 9 months ago
On Notions of Completeness Weaker than Kripke Completeness
We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...
Tadeusz Litak
POPL
2006
ACM
14 years 7 months ago
On flow-sensitive security types
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
Sebastian Hunt, David Sands
ICALP
2010
Springer
14 years 8 days ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
ICFP
2000
ACM
13 years 12 months ago
Intersection types and computational effects
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
Rowan Davies, Frank Pfenning
LICS
2007
IEEE
14 years 1 months ago
Environmental Bisimulations for Higher-Order Languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii