1226 search results - page 43 / 246 » Proofs, Programs and Abstract Complexity |
114
Voted
CATS
2006
15 years 4 months ago
2006
In this paper, we study the formalization of one-pass call-by-value CPS compilation using higher-order abstract syntax. In particular, we verify mechanically that the source progr...
116
click to vote
QCQC
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
135
Voted
LICS
1994
IEEE
15 years 6 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
137
click to vote
LPAR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
145
click to vote
HPCA
2006
IEEE
16 years 3 months ago
2006
IEEE
As silicon technologies move into the nanometer regime, transistor reliability is expected to wane as devices become subject to extreme process variation, particle-induced transie...