Proofs and types
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Programming with Proofs: A Second Order Type Theory
ESOP '88 Proceedings of the 2nd European Symposium on Programming
Journal of Automated Reasoning
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
On the Convergence of Reduction-based and Model-based Methods in Proof Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Cut Elimination in Deduction Modulo by Abstract Completion
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Automated Reasoning
Algorithmic equality in Heyting arithmetic modulo
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Truth values algebras and proof normalization
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
A finite first-order theory of classes
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Automating theories in intuitionistic logic
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Embedding deduction modulo into a prover
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A simple class of Kripke-style models in which logic and computation have equal standing
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Experimenting with deduction modulo
CADE'11 Proceedings of the 23rd international conference on Automated deduction
A semantic completeness proof for tamed
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Rewriting Computation and Proof
Unbounded proof-length speed-up in deduction modulo
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
We present constructive arithmetic in Deduction modulo with rewrite rules only.