793 search results - page 50 / 159 » Argumentation and standards of proof |
106
click to vote
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
117
Voted
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
124
Voted
CSL
2007
Springer
15 years 4 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
77
Voted
ENTCS
2007
15 years 22 days ago
2007
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...
106
Voted
LPAR
2010
Springer
14 years 11 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...