Sciweavers

9730 search results - page 14 / 1946
» Relating models of backtracking
Sort
View
JLP
2010
59views more  JLP 2010»
13 years 3 months ago
The proof monad
A formalism for expressing the operational semantics of proof languages used in procedural theorem provers is proposed. It is argued that this formalism provides an elegant way to...
Florent Kirchner, César Muñoz
SBP
2011
Springer
13 years 3 months ago
Identifying Health-Related Topics on Twitter - An Exploration of Tobacco-Related Tweets as a Test Topic
Public health-related topics are difficult to identify in large conversational datasets like Twitter. This study examines how to model and discover public health topics and themes ...
Kyle W. Prier, Matthew S. Smith, Christophe G. Gir...
ICFP
2007
ACM
14 years 8 months ago
Inductive reasoning about effectful data types
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...
Andrzej Filinski, Kristian Støvring
RTAS
2008
IEEE
14 years 2 months ago
Real-Time Distributed Discrete-Event Execution with Fault Tolerance
We build on PTIDES, a programming model for distributed embedded systems that uses discrete-event (DE) models as program specifications. PTIDES improves on distributed DE executi...
Thomas Huining Feng, Edward A. Lee
CP
2005
Springer
14 years 2 months ago
Robust Constraint Solving Using Multiple Heuristics
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...