595 search results - page 67 / 119 » The Graph Programming Language GP |
123
Voted
OOPSLA
2010
Springer
15 years 1 months ago
2010
Springer
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
124
Voted
EMNLP
2010
15 years 22 days ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
138
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
127
Voted
PLILP
1997
Springer
15 years 6 months ago
1997
Springer
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
140
Voted
ECOOP
2007
Springer
15 years 6 months ago
2007
Springer
In this chapter, we explore the emerging research domain of modeldriven software refactoring. Program refactoring is a proven technique that aims at improving the quality of sourc...