Sciweavers

57 search results - page 10 / 12
» A monadic approach to polycategories
Sort
View
ICFP
2004
ACM
14 years 8 months ago
Searching for deadlocks while debugging concurrent haskell programs
This paper presents an approach to searching for deadlocks in Concurrent Haskell programs. The search is based on a redefinition of the IO monad which allows the reversal of Concu...
Jan Christiansen, Frank Huch
CONSTRAINTS
2007
83views more  CONSTRAINTS 2007»
13 years 8 months ago
Generic Incremental Algorithms for Local Search
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
Magnus Ågren, Pierre Flener, Justin Pearson
DLS
2009
179views Languages» more  DLS 2009»
13 years 6 months ago
Directing JavaScript with arrows
JavaScript programmers make extensive use of event-driven programming to help build responsive web applications. However, standard approaches to sequencing events are messy, and o...
Yit Phang Khoo, Michael Hicks, Jeffrey S. Foster, ...
JAPLL
2011
108views more  JAPLL 2011»
13 years 3 months ago
A deontic logic framework allowing for factual detachment
Due to the fact that a large number of our ethical and behavioural norms have a conditional form, it is of great importance that deontic logics give an account of deontic commitme...
Christian Straßer
MSS
2010
IEEE
97views Hardware» more  MSS 2010»
13 years 7 months ago
Network formation under mutual consent and costly communication
We consider four different game-theoretic approaches to describe the formation of social networks under mutual consent and costly communication. First, we consider Jackson-Wolins...
Robert P. Gilles, Sudipta Sarangi