1888 search results - page 120 / 378 » Proof theory and computational analysis |
167
click to vote
RELMICS
2005
Springer
15 years 12 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...
153
click to vote
RTA
1993
Springer
15 years 10 months ago
1993
Springer
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ ...
156
click to vote
BIRTHDAY
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. In this paper we review some well-known theory about reduction strategies of various kinds: normalizing, outermost-fair, cofinal, Church-Rosser. A stumbling block in the...
174
click to vote
ICALP
2005
Springer
15 years 12 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 ...
172
click to vote
CDC
2009
IEEE
15 years 11 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...