CADE
2003
Springer
14 years 11 months ago
2003
Springer
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area ...
CADE
2003
Springer
14 years 11 months ago
2003
Springer
We make the notion of scope in the -calculus explicit. To that end, the syntax of the -calculus is extended with an end-of-scope operator , matching the usual opening of a scope du...
CADE
2003
Springer
14 years 11 months ago
2003
Springer
CADE
2003
Springer
14 years 11 months ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
CADE
2003
Springer
14 years 11 months ago
2003
Springer
IsaPlanner is a generic framework for proof planning in the interactive theorem prover Isabelle. It facilitates the encoding of reasoning techniques, which can be used to conjectur...
CADE
2003
Springer
14 years 11 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
CADE
2003
Springer
14 years 11 months ago
2003
Springer
CADE
2003
Springer
14 years 11 months ago
2003
Springer
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...
CADE
2003
Springer
14 years 11 months ago
2003
Springer
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
CADE
2003
Springer
14 years 11 months ago
2003
Springer