1805 search results - page 264 / 361 » Functional programming with structured graphs |
242
Voted
POPL
2008
ACM
16 years 2 months ago
2008
ACM
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
131
click to vote
LFP
1992
15 years 3 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
126
Voted
IWPEC
2009
Springer
15 years 9 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
222
click to vote
ICFP
2009
ACM
16 years 3 months ago
2009
ACM
Concurrent ML (CML) is a high-level message-passing language that supports the construction of first-class synchronous abstractions called events. This mechanism has proven quite ...
120
Voted
PLDI
2003
ACM
15 years 7 months ago
2003
ACM
CCured is a program transformation system that adds memory safety guarantees to C programs by verifying statically that memory errors cannot occur and by inserting run-time checks...