705 search results - page 42 / 141 » New Compilation Languages Based on Structured Decomposabilit... |
140
Voted
IBPRIA
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
143
Voted
MICRO
2010
IEEE
15 years 1 months ago
2010
IEEE
Advanced Synchronization Facility (ASF) is an AMD64 hardware extension for lock-free data structures and transactional memory. It provides a speculative region that atomically exec...
160
Voted
LATA
2010
Springer
15 years 2 months ago
2010
Springer
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we conside...
176
Voted
ICFP
2012
ACM
13 years 6 months ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
147
Voted
SLP
1994
15 years 5 months ago
1994
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...