Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism
Artikel i vetenskaplig tidskrift, 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

Författare

M. Bezem

Universitetet i Bergen

Thierry Coquand

Göteborgs universitet

Theoretical Computer Science

0304-3975 (ISSN)

Vol. 913 1-7

Ämneskategorier

Beräkningsmatematik

Annan matematik

Datavetenskap (datalogi)

DOI

10.1016/j.tcs.2022.01.017

Mer information

Senast uppdaterat

2023-01-17