Memoisation of categorial proof nets: parallelism in categorial processing
Glyn V. Morrill · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 1996
We introduce a method of memoisation of categorial proof nets. Exploiting the planarity of non-commutative proof nets, and unifiability as a correctness criterion, parallelism is simulated through construction of a proof net matrix of most general unifiers for modules, in a manner analogous to the Cocke-Younger-Kasami algorithm for context free grammar. 1 Memoisation of categorial proof nets: parallelism in categorial processing 1 Introduction If the evolutionary tendency of grammatical formalisms could be summed up in one word, that word could well be lexicalism. The lexicon was once considered the locus of all and only idiosyncratic information; it may be hard now to find any proponents at all of such a view. Rather, one hears of the balance or tradeoff between lexicon and syntax: the tenet that the lexicon should comprise only what is idiosyncratic is, simply, no longer held. The notion that there is a compromise to be struck between lexicon and syntax is in turn rejected in the...