1569 search results - page 112 / 314 » Programming contest strategy |
103
Voted
PLILP
1994
Springer
15 years 4 months ago
1994
Springer
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
112
Voted
COLING
2000
15 years 1 months ago
2000
This paper presents a robust client/server implementation of a word sense disambiguator for English. This system associates a word with its meaning in a given context using dictio...
104
click to vote
ICTAC
2004
Springer
15 years 5 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
120
Voted
ACL2
2006
ACM
15 years 6 months ago
2006
ACM
We have implemented parallelism primitives that permit an ACL2 programmer to parallelize execution of ACL2 functions. We (1) introduce logical definitions for these primitives, (...
76
Voted
ALP
1990
Springer
15 years 4 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...