Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism
Journal article, Peer reviewed
Published version
View/
Date
2022Metadata
Show full item recordCollections
- Department of Informatics [992]
- Registrations from Cristin [10865]
Abstract
We solve in polynomial time two decision problems that occur in type checking when typings depend on universe level constraints.
Publisher
ElsevierJournal
Theoretical Computer ScienceCopyright
Copyright 2022 The Author(s)
Except where otherwise noted, this item's license is described as Navngivelse 4.0 Internasjonal