68 search results - page 7 / 14 » Mathematical Induction in Otter-Lambda |
LFCS
2009
Springer
14 years 2 months ago
2009
Springer
This work defines an extension CERES2 of the first-order cut-elimination method CERES to the subclass of sequent calculus proofs in second-order logic using quantifier-free comp...
ITP
2010
13 years 11 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 ...
MPC
1995
Springer
13 years 11 months ago
1995
Springer
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
ICALP
2001
Springer
14 years 8 days ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
CACM
2011
13 years 2 months ago
2011
ple abstraction encapsulating the desired interface between programmers and system builders. Using Simple ion to Reinvent Computing for Parallelism doi:10.1145/1866739.1866757 abst...