3566 search results - page 541 / 714 » Signed Logic Programs |
136
click to vote
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
137
Voted
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
127
Voted
CADE
2004
Springer
16 years 4 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
116
Voted
ICFP
2003
ACM
16 years 3 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
149
Voted
ICFP
2003
ACM
16 years 3 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...