Sciweavers

1458 search results - page 33 / 292
» Monads for incremental computing
Sort
View
CONCUR
2006
Springer
13 years 11 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
TLCA
2007
Springer
14 years 4 months ago
Computation by Prophecy
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Ana Bove, Venanzio Capretta