544 search results - page 31 / 109 » The Algebra of Equality Proofs |
181
click to vote
TPHOL
2009
IEEE
16 years 13 days ago
2009
IEEE
ion and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: co...
148
click to vote
EJC
2008
15 years 5 months ago
2008
We present a combinatorial proof of Postnikov's hook length formula for binary trees. c 2007 Elsevier Ltd. All rights reserved. Let [n] = {1, 2, . . . , n}. It is well known ...
288
click to vote
POPL
2009
ACM
16 years 6 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
149
click to vote
CTCS
1997
Springer
15 years 10 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
165
Voted
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...