518 search results - page 37 / 104 » Automating Proofs in Category Theory |
ACS
2005
15 years 1 months ago
2005
We develop a symmetric analog of brace algebras and discuss the relation of such algebras to L-algebras. We give an alternate proof that the category of symmetric brace algebras is...
112
Voted
CADE
2001
Springer
16 years 2 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
124
click to vote
CCL
1994
Springer
15 years 6 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
137
click to vote
LICS
1991
IEEE
15 years 5 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
123
Voted
ICLP
2010
Springer
15 years 5 months ago
2010
Springer
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...