265 search results - page 30 / 53 » How to Prove Inductive Theorems |
MKM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In a problem solving process, a step may not result in the expected progress or may not be applicable as expected. Hence, knowledge how to overcome and react to impasses ...
LPAR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
KBSE
2000
IEEE
13 years 11 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
In many theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
CONTEXT
1999
Springer
13 years 12 months ago
1999
Springer
Appeared in: P. Bouquet, P. Br´ezillon, L. Serafini, M. Benerecetti, F. Castellani (Eds.), 2nd International and Interdisciplinary Conference on Modeling and Using Context (CONT...