Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism
Journal article, 2022
We solve in polynomial time two decision problems that occur in type checking when typings depend on universe level constraints.
Decidability
Uniform word problem
Loop-checking
Join-semilattices with one inflationary endomorphism
Author
M. Bezem
University of Bergen
Thierry Coquand
University of Gothenburg
Theoretical Computer Science
0304-3975 (ISSN)
Vol. 913 1-7Subject Categories (SSIF 2011)
Computational Mathematics
Other Mathematics
Computer Science
DOI
10.1016/j.tcs.2022.01.017