Checking Emptiness of Non-Deterministic Regular Types with Set Operators

DOI10.1016/j.entcs.2008.04.062zbMath1286.68084OpenAlexW2149019996MaRDI QIDQ5415619

Lunjin Lu

Publication date: 13 May 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.04.062

zbMATH Keywords

subtypingtabulationemptinessregular types

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• ML

Cites Work

• A polymorphic type system for Prolog
• A theory of type polymorphism in programming
• Type dependencies for logic programs using ACI-unification
• Efficient run-time type checking of typed logic programs
• Polymorphic type analysis in logic programs by abstract interpretation
• Generalizing Def and Pos to Type Analysis
• Improving precision of type analysis using non-discriminative union
• A type system for logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item