1101 search results - page 141 / 221 » Forcing in proof theory |
93
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
90
Voted
PPDP
2005
Springer
15 years 6 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
102
Voted
RELMICS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. As part of a larger project, we have built a declarative assembly language that enables us to specify multiple code paths to compute particular quantities, giving the ins...
92
Voted
FOSSACS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
100
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...