1096 search results - page 139 / 220 » Abstract Canonical Inference |
122
Voted
LPAR
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
137
Voted
PADO
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant ch...
137
Voted
TPHOL
1999
IEEE
15 years 8 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
134
Voted
CADE
1992
Springer
15 years 7 months ago
1992
Springer
e introducing the types and constants of the logic, i.e. its abstract syntax, and axioms describing the inference rules. As a tiny example, consider the following definition of min...
159
Voted
PPCP
1993
15 years 7 months ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...