4355 search results - page 101 / 871 » From Interpretation to Compilation |
192
click to vote
IJCAI
1997
15 years 7 months ago
1997
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...
149
click to vote
EUROPAR
2007
Springer
15 years 10 months ago
2007
Springer
How can sequential applications benefit from the ubiquitous next generation of chip multiprocessors (CMP)? Part of the answer may be a dynamic execution environment that automatica...
186
click to vote
WIA
1999
Springer
1999
Springer
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
15 years 10 months ago
Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay [12] have argular expressions are the appropriate level of abstract...
210
click to vote
ICCL
1992
IEEE
15 years 10 months ago
1992
IEEE
We describe the automatic generation of a provably correct compiler for a non-trivial subset of Ada. The compiler is generated from an emantic description; it emits absolute code ...
136
click to vote
ENTCS
2008
15 years 6 months ago
2008
This paper describes experiences from implementing key parts of a compiler for Modelica, an object-oriented language supporting declarative modeling and simulation of complex phys...