261 search results - page 7 / 53 » Proof Normalization Modulo |
TYPES
2004
Springer
14 years 1 days ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
ICTAC
2009
Springer
13 years 4 months ago
2009
Springer
Testing from first-order specifications has mainly been studied for flat specifications, that are specifications of a single software module. However, the specifications of large s...
CIE
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We see a notion of normal derivation for the calculus of structures, which is based on a factorisation of derivations and which is more general than the traditional notio...
NIL
1991
13 years 10 months ago
1991
In this paper we continue investigations of proof theory of default logic. It turns out that, similarly to classical logic, default theories can be represented in normal forms.
ENTCS
2006
13 years 6 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 ...