A Type System Describing Unboundedness

DOI10.23638/DMTCS-22-4-2zbMath1462.68109OpenAlexW3046226111MaRDI QIDQ3386622

Paweł Parys

Publication date: 5 January 2021

Full work available at URL: https://dmtcs.episciences.org/6716

zbMATH Keywords

reflectionintersection typeshigher-order recursion schemessimultaneous-unboundedness problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatory logic and lambda calculus (03B40)

Related Items (2)

The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic ⋮ Cost Automata, Safe Schemes, and Downward Closures

This page was built for publication: A Type System Describing Unboundedness