42 search results - page 1 / 9 » The proof monad |
APLAS
2006
ACM
13 years 10 months ago
2006
ACM
straction for Imperative Languages William L. Harrison Dept. of Computer Science, University of Missouri, Columbia, Missouri, USA. ty in programming language semantics derives fro...
JLP
2010
12 years 11 months ago
2010
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...
IANDC
2007
13 years 4 months ago
2007
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
CTCS
1997
Springer
13 years 9 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
CSL
2008
Springer
13 years 6 months ago
2008
Springer
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (g...