1999 search results - page 64 / 400 » Dependently Typed Grammars |
151
click to vote
CONCUR
1999
Springer
15 years 10 months ago
1999
Springer
This paper investigates an approach for statically preventing race conditions in an object-oriented language. The setting of this work is a variant of Gordon and Hankin’s concurr...
145
click to vote
SIAMDM
2008
15 years 6 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
160
click to vote
LREC
2010
15 years 7 months ago
2010
This paper describes a hybrid tagger/parser for French (FrAG), and presents results from ongoing development work, corpus annotation and evaluation. The core of the system is a se...
186
click to vote
AGTIVE
2007
Springer
15 years 10 months ago
2007
Springer
We show our approach for the definition of Domain Specific Languages integrating both graphical and textual views. The approach is based on the meta-modelling concepts provided by ...
161
click to vote
EMNLP
2009
15 years 3 months ago
2009
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves tran...