Sciweavers

15 search results - page 3 / 3
» Range Concatenation Grammars for Translation
Sort
View
IANDC
2010
125views more  IANDC 2010»
13 years 4 months ago
Continuation semantics for the Lambek-Grishin calculus
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
Raffaella Bernardi, Michael Moortgat
POPL
2010
ACM
14 years 3 months ago
Semantics and Algorithms for Data-dependent Grammars
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
Yitzhak Mandelbaum, Trevor Jim, David Walker
PLDI
2010
ACM
14 years 3 months ago
A Context-free Markup Language for Semi-structured Text
An ad hoc data format is any non-standard, semi-structured data format for which robust data processing tools are not available. In this paper, we present ANNE, a new kind of mark...
Qian Xi, David Walker
TAGT
1998
Springer
162views Graph Theory» more  TAGT 1998»
13 years 9 months ago
Hypergraphs as a Uniform Diagram Representation Model
When working with diagrams in visual environments like graphical diagram editors, diagrams have to be represented by an internal model. Graphs and hypergraphs are well-known concep...
Mark Minas
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 5 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný