1418 search results - page 118 / 284 » The Dynamic Complexity of Formal Languages |
125
click to vote
CEC
2008
IEEE
15 years 11 months ago
2008
IEEE
—The language game approach is widely adopted to study conventionalization of linguistic knowledge. Most of contemporary models concentrate on the dynamics of language games in r...
141
click to vote
PEPM
2004
ACM
15 years 9 months ago
2004
ACM
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
210
click to vote
CD
2005
Springer
15 years 10 months ago
2005
Springer
Recent studies showed potential for using component frameworks for building flexible adaptible applications for deployment in distributed environments. However this approach is h...
123
click to vote
ICFP
2007
ACM
16 years 4 months ago
2007
ACM
In the light of evidence that Haskell programs compiled by GHC exhibit large numbers of mispredicted branches on modern processors, we re-examine the "tagless" aspect of...
144
click to vote
ICPP
1993
IEEE
15 years 8 months ago
1993
IEEE
SIMD or vector computers and collection-oriented languages, like C , are designed to perform the same computation on each data item or on just a subset of the data. Subsets of pro...