518 search results - page 14 / 104 » Automating Proofs in Category Theory |
19
Voted
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
The classic method of Nelson and Oppen for combining decision procedures requires the theories to be stably-infinite. Unfortunately, some important theories do not fall into this...
ENTCS
2006
13 years 7 months ago
2006
Trace semantics has been defined for various non-deterministic systems with different input/output types, or with different types of "non-determinism" such as classical ...
ROOM
2000
13 years 8 months ago
2000
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...
JLP
2010
13 years 2 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...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...