3001 search results - page 67 / 601 » Recursive type generativity |
103
click to vote
PARLE
1987
15 years 3 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
112
click to vote
IMCSIT
2010
14 years 9 months ago
2010
This paper describes an application for computing first-order semantic representations of English texts. It is based on a combination of hybrid shallow-deep components arranged wit...
BMCBI
2006
14 years 12 months ago
2006
Background: Gene expression microarray data is notoriously subject to high signal variability. Moreover, unavoidable variation in the concentration of transcripts applied to micro...
FOSSACS
2004
Springer
15 years 5 months ago
2004
Springer
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
103
click to vote
ALT
2005
Springer
15 years 8 months ago
2005
Springer
In language learning, strong relationships between Gold-style models and query models have recently been observed: in some quite general setting Gold-style learners can be replaced...