1888 search results - page 48 / 378 » Proof theory and computational analysis |
CSFW
2012
IEEE
11 years 9 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
PLPV
2009
ACM
14 years 4 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
AISC
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions...
BIRTHDAY
2007
Springer
14 years 1 months ago
2007
Springer
Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a ...