611 search results - page 2 / 123 » Index Sets of Computable Structures with Decidable Theories |
VSTTE
2012
Springer
12 years 25 days ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
ITA
2007
13 years 5 months ago
2007
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas w...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...