Sciweavers

2231 search results - page 256 / 447
» Alternation as a programming paradigm
Sort
View
ESOP
2009
Springer
15 years 10 months ago
Verified, Executable Parsing
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
Aditi Barthwal, Michael Norrish
HASKELL
2007
ACM
15 years 10 months ago
Lightweight concurrency primitives for GHC
The Glasgow Haskell Compiler (GHC) has quite sophisticated support for concurrency in its runtime system, which is written in lowlevel C code. As GHC evolves, the runtime system b...
Peng Li, Simon Marlow, Simon L. Peyton Jones, Andr...
ECOOP
2006
Springer
15 years 10 months ago
Implementing Bounded Aspect Quantification in AspectJ
The integration of aspects into the methodology of stepwise software development and evolution is still an open issue. This paper focuses on the global quantification mechanism of...
Christian Kästner, Sven Apel, Gunter Saake
ICLP
1991
Springer
15 years 10 months ago
Nonmonotonic Reasoning with Well Founded Semantics
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...
Luís Moniz Pereira, Joaquim Nunes Apar&iacu...
ESOP
2010
Springer
15 years 10 months ago
TRX: A Formally Verified Parser Interpreter
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser inter...
Adam Koprowski, Henri Binsztok