1948 search results - page 54 / 390 » Formalizing Mirror Theory |
166
Voted
JELIA
1994
Springer
15 years 7 months ago
1994
Springer
: In this paper we describe a general way of formalizing reasoning behaviour. Such a behaviour may be described by all the patterns which are valid for the behaviour. A pattern can...
137
Voted
WRLA
2010
15 years 1 months ago
2010
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
115
click to vote
CADE
2006
Springer
16 years 3 months ago
2006
Springer
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlyi...
120
Voted
CONCUR
2005
Springer
15 years 9 months ago
2005
Springer
Many decidability results are known for non-recursive cryptographic protocols, where the protocol steps can be expressed by simple rewriting rules. Recently, a tree transducer-base...
151
click to vote
TYPES
1994
Springer
15 years 7 months ago
1994
Springer
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...