309 search results - page 62 / 62 » Termination proofs for systems code |
POPL
1992
ACM
13 years 10 months ago
1992
ACM
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...
STOC
2004
ACM
14 years 6 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
ICFP
2002
ACM
14 years 6 months ago
2002
ACM
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
ICS
2009
Tsinghua U.
14 years 26 days ago
2009
Tsinghua U.
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...