Sciweavers

2944 search results - page 101 / 589
» On Well Quasi-orders on Languages
Sort
View
COGSCI
2004
148views more  COGSCI 2004»
13 years 9 months ago
Disfluencies, language comprehension, and Tree Adjoining Grammars
Disfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research...
Fernanda Ferreira, Ellen F. Lau, Karl G. D. Bailey
POPL
2007
ACM
14 years 10 months ago
Implementing deterministic declarative concurrency using sieves
The predominant thread-based approach to concurrent programming is bug-prone, difficult to reason about, and does not scale well to large numbers of processors. Sieves provide a s...
Sam Lindley
SIGADA
2005
Springer
14 years 3 months ago
Modeling SPARK systems with UML
In this paper, we will consider two aspects of UML in order to assess how well suited it is for modeling SPARK systems. The first aspect is the ability to represent SPARK in UML f...
Xavier Sautejeau
ESOP
2006
Springer
14 years 1 months ago
Linear Regions Are All You Need
Abstract. The type-and-effects system of the Tofte-Talpin region calculus makes it possible to safely reclaim objects without a garbage collector. However, it requires that regions...
Matthew Fluet, Greg Morrisett, Amal J. Ahmed
AIR
2004
143views more  AIR 2004»
13 years 10 months ago
Hebrew Computational Linguistics: Past and Future
This paper reviews the current state of the art in Natural Language Processing for Hebrew, both theoretical and practical. The Hebrew language, like other Semitic languages, poses...
Shuly Wintner