Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism

dc.contributor.author	Bezem, Marc
dc.contributor.author	Coquand, Thierry
dc.date.accessioned	2023-03-20T12:05:28Z
dc.date.available	2023-03-20T12:05:28Z
dc.date.created	2022-05-11T14:49:56Z
dc.date.issued	2022
dc.identifier.issn	0304-3975
dc.identifier.uri	https://hdl.handle.net/11250/3059241
dc.description.abstract	We solve in polynomial time two decision problems that occur in type checking when typings depend on universe level constraints.	en_US
dc.language.iso	eng	en_US
dc.publisher	Elsevier	en_US
dc.rights	Navngivelse 4.0 Internasjonal	*
dc.rights.uri	http://creativecommons.org/licenses/by/4.0/deed.no	*
dc.title	Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism	en_US
dc.type	Journal article	en_US
dc.type	Peer reviewed	en_US
dc.description.version	publishedVersion	en_US
dc.rights.holder	Copyright 2022 The Author(s)	en_US
cristin.ispublished	true
cristin.fulltext	original
cristin.qualitycode	2
dc.identifier.doi	10.1016/j.tcs.2022.01.017
dc.identifier.cristin	2023655
dc.source.journal	Theoretical Computer Science	en_US
dc.source.pagenumber	1-7	en_US
dc.identifier.citation	Theoretical Computer Science. 2022, 913, 1-7.	en_US
dc.source.volume	913	en_US

Except where otherwise noted, this item's license is described as Navngivelse 4.0 Internasjonal