Memoisation of categorial proof nets: parallelism in categorial processing

dc.contributor.author	Morrill, Glyn
dc.contributor.other	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned	2016-11-23T11:50:47Z
dc.date.available	2016-11-23T11:50:47Z
dc.date.issued	1996-02
dc.identifier.citation	Morrill, G. "Memoisation of categorial proof nets: parallelism in categorial processing". 1996.
dc.identifier.uri	http://hdl.handle.net/2117/97106
dc.description.abstract	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 grammars.
dc.format.extent	13 p.
dc.language.iso	spa
dc.relation.ispartofseries	LSI-96-24-R
dc.subject	Àrees temàtiques de la UPC::Informàtica::Programació
dc.subject.other	Memoisation
dc.subject.other	Categorial proof nets
dc.subject.other	Parallelism
dc.subject.other	Proof net matrix
dc.title	Memoisation of categorial proof nets: parallelism in categorial processing
dc.type	External research report
dc.contributor.group	Universitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
dc.rights.access	Open Access
local.identifier.drac	664064
dc.description.version	Postprint (published version)
local.citation.author	Morrill, G.

UPCommons. Portal del coneixement obert de la UPC