An Emptiness Algorithm for Regular Types with Set Operators
Lunjin Lu, John G. Cleary
Abstract
An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterised type definitions is presented. The algorithm can also be used to decide the equivalence of two regular type expressions and the inclusion of one regular type expression in another. The algorithm strictly generalises previous work in that tuple distributivity is not assumed and set operators are permitted in type expressions.
Create a lesson
Related papers
Some complete ω-powers of a one-counter language in the difference hierarchy
Jacques Duparc, Olivier Finkel, Dominique Lecomte
Towards Finite Satisfiability of PDL with Loops
Bartosz Jan Bednarczyk, Mikołaj Swoboda
Vision-Predictor-Action: Towards Efficient Embodied AI via Neuro-Symbolic JEPA Predictors
Yeonseok Lee
Representation Theorems for Actual Powers over Two-Agent General Concurrent Game Frames
Zixuan Chen, Fengkui Ju, Thomas Ågotnes
Capturing Bisimulation-Invariant Exponential-Space Complexity Classes
Florian Bruse, David Kronenberger, Martin Lange
StructHCP: Structure-Aware SAT--CEGAR for the Hamiltonian Cycle Problem
Quan Van Vi, Tuyen Van Kieu, Khanh Van To