Sciweavers

77 search results - page 15 / 16
» Algebras for Parameterised Monads
Sort
View
DIMACS
1996
13 years 7 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
VLDB
2007
ACM
118views Database» more  VLDB 2007»
14 years 6 months ago
Eliminating Impedance Mismatch in C++
Recently, the C# and the VISUAL BASIC communities were tantalized by the advent of LINQ [18]--the Language INtegrated Query technology from Microsoft. LINQ represents a set of lan...
Joseph Gil, Keren Lenz
ICFP
2008
ACM
14 years 6 months ago
Functional translation of a calculus of capabilities
Reasoning about imperative programs requires the ability to track aliasing and ownership properties. We present a type system that provides this ability, by using regions, capabil...
Arthur Charguéraud, François Pottier
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 6 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil
IANDC
2006
103views more  IANDC 2006»
13 years 6 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...