448 search results - page 65 / 90 » Dynamic Algorithms for the Dyck Languages |
DAGSTUHL
1996
14 years 11 months ago
1996
Abstract. Type-directed partial evaluation stems from the residualization of arbitrary static values in dynamic contexts, given their type. Its algorithm coincides with the one for...
CL
1999
Springer
14 years 9 months ago
1999
Springer
It is well known that dynamic typing in languages like Lisp is costly in terms of performance. Besides the cost of tag checking, the other major source of ine ciency comes from th...
178
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
As computer systems continue to become more powerful and comdo programs. High-level abstractions introduced to deal with complexity in large programs, while simplifying human reas...
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
Checkpointing and replaying is an attractive technique that has been used widely at the operating/runtime system level to provide fault tolerance. Applying such a technique at the...
198
click to vote
POPL
2002
ACM
15 years 10 months ago
2002
ACM
In this paper we propose a scheme that combines type inference and run-time checking to make existing C programs type safe. We describe the CCured type system, which extends that ...