3658 search results - page 225 / 732 » The logic of proofs, semantically |
173
click to vote
CONCUR
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We introduce a novel way to integrate functional and concurrent programming based on intuitionistic linear logic. The functional core arises from interpreting proof reduc...
184
click to vote
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...
206
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
187
click to vote
ICTCS
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
183
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...