1101 search results - page 64 / 221 » Forcing in proof theory |
146
click to vote
AML
2010
15 years 6 months ago
2010
In this paper a method to construct Kripke models for subtheories of constructive set theory is introduced that uses constructions from classical model theory such as constructibl...
302
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
183
click to vote
LICS
2008
IEEE
16 years 1 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...
214
click to vote
HASKELL
2009
ACM
16 years 1 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
182
click to vote
ECCC
2008
15 years 6 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...