Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism
Journal article, Peer reviewed
MetadataShow full item record
Original versionTheoretical Computer Science. 2022, 913, 1-7. 10.1016/j.tcs.2022.01.017
We solve in polynomial time two decision problems that occur in type checking when typings depend on universe level constraints.