1101 search results - page 117 / 221 » Forcing in proof theory |
101
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
JLP
2011
14 years 3 months ago
2011
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
136
Voted
ICFP
2004
ACM
16 years 19 days ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
137
click to vote
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
120
Voted
IPL
2007
15 years 18 days ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...