518 search results - page 8 / 104 » Automating Proofs in Category Theory |
POPL
2010
ACM
14 years 4 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
POPL
2005
ACM
14 years 7 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
CADE
1990
Springer
13 years 11 months ago
1990
Springer
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
CADE
2004
Springer
14 years 24 days ago
2004
Springer
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We define a notion of symmetric monoidal closed (smc) theory, consisting of a smc signature augmented with equations, and describe the classifying categories of such theo...