Sciweavers

7 search results - page 2 / 2
» Harnessing First Order Termination Provers Using Higher Orde...
Sort
View
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
13 years 11 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur
LREC
2010
160views Education» more  LREC 2010»
13 years 6 months ago
FrAG, a Hybrid Constraint Grammar Parser for French
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...
Eckhard Bick