265 search results - page 5 / 53 » How to Prove Inductive Theorems |
94
Voted
BIRTHDAY
2006
Springer
15 years 7 months ago
2006
Springer
The COL institution (constructor-based observational logic) has been introduced as a formal framework to specify both generationand observation-oriented properties of software syst...
109
Voted
IANDC
1998
15 years 3 months ago
1998
We present a model for representing search in theorem proving. This model captures the notion of contraction, which has been central in some of the recent developments in theorem ...
111
click to vote
ITP
2010
15 years 7 months ago
2010
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...
129
Voted
TPHOL
2005
IEEE
15 years 9 months ago
2005
IEEE
Wouldn’t it be nice to be able to conveniently use ordinary real number expressions within proof assistants? In this paper we outline how this can be done within a theorem provin...
130
Voted
TPHOL
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...