4 search results - page 1 / 1 » Higher-Order Termination: from Kruskal to Computability |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
TLCA
2005
Springer
13 years 11 months ago
2005
Springer
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
LREC
2010
13 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...