518 search results - page 1 / 104 » Automating Proofs in Category Theory |
CADE
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. We introduce a semi-automated proof system for basic category-theoretic reasoning. It is based on a first-order sequent calculus that captures the basic properties of cat...
LACL
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. The paper proposes a type logical reformulation of Jacobson's ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Ca...
PEPM
2010
ACM
13 years 6 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
FLOPS
2006
Springer
13 years 8 months ago
2006
Springer
Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encodin...