226 search results - page 1 / 46 » Extensional Theories and Rewriting |
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automate...
88
Voted
TLCA
2007
Springer
15 years 4 months ago
2007
Springer
Inspired by recent work on normalisation by evaluation for sums, we propose a normalising and confluent extensional rewriting theory for the simply-typed λ-calculus extended with...
81
Voted
ENTCS
2007
14 years 10 months ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
78
Voted
JSC
2010
14 years 8 months ago
2010
The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formu...
70
Voted
CADE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compac...