551 search results - page 35 / 111 » Natural proofs |
ENTCS
2002
13 years 8 months ago
2002
Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with ch...
TOPLAS
2002
13 years 8 months ago
2002
We present an efficient encoding of core Java constructs in a simple, implementable typed intermediate language. The encoding, after type erasure, has the same operational behavio...
ASE
2002
13 years 8 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
BIRTHDAY
2005
Springer
14 years 2 months ago
2005
Springer
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...
ICFP
1997
ACM
14 years 29 days ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...