13383 search results - page 33 / 2677 » Abstractions from proofs |
CSL
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
EUROCAST
2005
Springer
14 years 3 months ago
2005
Springer
In this paper, an approach to synthesize correct programs from specifications is presented. The idea is to extract code from definitions appearing in statements which have been me...
CSL
2006
Springer
14 years 1 months ago
2006
Springer
We introduce a new class of multiplicative proof nets, J-proof nets, which are a typed version of Faggian and Maurel's multiplicative L-nets. In J-proof nets, we can character...
ENTCS
2006
13 years 10 months ago
2006
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...
APLAS
2011
ACM
12 years 10 months ago
2011
ACM
The well-known third list homomorphism theorem states that if a function h is both an instance of foldr and foldl, it is a list homomorphism. Plenty of previous works devoted to co...