57 search results - page 4 / 12 » Automating Side Conditions in Formalized Partial Functions |
ITP
2010
13 years 11 months ago
2010
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and e...
CADE
2004
Springer
14 years 7 months ago
2004
Springer
Abstract. Undefined terms are commonplace in mathematics, particularly in calculus. The traditional approach to undefinedness in mathematical practice is to treat undefined terms a...
TPHOL
2002
IEEE
14 years 9 days ago
2002
IEEE
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive definitions. The operational semantics is given b...
TPHOL
2002
IEEE
14 years 9 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 ...
ENTCS
2006
13 years 7 months ago
2006
In this paper, we describe a system, written in Haskell, for the automated verification of Web sites which can be used to specify (partial) correctness and completeness properties...