222 search results - page 41 / 45 » E-Matching with Free Variables |
221
Voted
POPL
2010
ACM
16 years 4 months ago
2010
ACM
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
219
Voted
TSD
2007
Springer
16 years 1 months ago
2007
Springer
Many state-of-the-art statistical parsers for English can be viewed as Probabilistic Context-Free Grammars (PCFGs) acquired from treebanks consisting of phrase-structure trees enri...
227
Voted
PACT
2005
Springer
16 years 27 days ago
2005
Springer
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
197
Voted
ACRI
2004
Springer
16 years 24 days ago
2004
Springer
We have investigated a problem where the goal is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type OBSTACLE, EMPTY or CRE...
204
Voted
PLDI
2010
ACM
16 years 14 days ago
2010
ACM
Multi-stage programming (MSP) provides a disciplined approach to run-time code generation. In the purely functional setting, it has been shown how MSP can be used to reduce the ov...