394 search results - page 7 / 79 » Formal polytypic programs and proofs |
COMMA
2010
13 years 2 months ago
2010
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
TYPES
2004
Springer
14 years 1 months 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...
TPHOL
2002
IEEE
14 years 25 days ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
Despite recent successes, large-scale proof development within proof assistants remains an arcane art that is extremely timeconsuming. We argue that this can be attributed to two ...