12774 search results - page 383 / 2555 » A Framework for Proof Systems |
180
click to vote
GI
2009
Springer
15 years 11 months ago
2009
Springer
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
159
click to vote
LICS
1989
IEEE
15 years 11 months ago
1989
IEEE
A refutation mechanism is introduced into logic programming, dual to the usual proof mechanism; then negation is treated via refutation. A four-valued logic is appropriate for the...
166
click to vote
LICS
1990
IEEE
15 years 11 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
204
click to vote
CSFW
2007
IEEE
15 years 10 months ago
2007
IEEE
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
179
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...