131 search results - page 25 / 27 » On Monadic Theories of Monadic Predicates |
MLQ
2008
13 years 5 months ago
2008
The stationary set splitting game is a game of perfect information of length 1 between two players, unsplit and split, in which unsplit chooses stationarily many countable ordinal...
ICFP
2008
ACM
14 years 5 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
ICFP
2006
ACM
14 years 5 months ago
2006
ACM
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...
POPL
2011
ACM
12 years 8 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
CC
2003
Springer
13 years 11 months ago
2003
Springer
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...