2607 search results - page 40 / 522 » Complete Functional Synthesis |
116
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
133
Voted
IJSI
2008
15 years 2 months ago
2008
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
127
click to vote
IALP
2009
15 years 11 days ago
2009
In this paper, we propose a modular cascaded approach to data driven dependency parsing. Each module or layer leading to the complete parse produces a linguistically valid partial...
139
click to vote
SIAMAM
2008
15 years 2 months ago
2008
Neural fields are an interesting option for modelling macroscopic parts of the cortex involving several populations of neurons, like cortical areas. Two classes of neural field equ...
125
Voted
EXTREME
2004
ACM
15 years 8 months ago
2004
ACM
The World Wide Web Consortium recommends both XSLT and XQuery as query languages for XML documents. XSLT, originally designed to transform XML into XSL-FO, is nowadays a fully gro...