Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism
Journal article, Peer reviewed
Published version
Åpne
Permanent lenke
https://hdl.handle.net/11250/3059241Utgivelsesdato
2022Metadata
Vis full innførselSamlinger
- Department of Informatics [917]
- Registrations from Cristin [9489]
Sammendrag
We solve in polynomial time two decision problems that occur in type checking when typings depend on universe level constraints.