Regular types represent sets of structured data, and have been used in logic programming (LP) for verification. However, first-class regular type systems are uncommon in LP languages. In this paper we present a new approach to regular types, based on type canonization, aimed at providing a practical first-class regular type system.
@InProceedings{jackson_et_al:LIPIcs.ICLP.2011.73, author = {Jackson, Ethan K. and Bj{\o}rner, Nikolaj and Schulte, Wolfram}, title = {{Canonical Regular Types}}, booktitle = {Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)}, pages = {73--83}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-31-6}, ISSN = {1868-8969}, year = {2011}, volume = {11}, editor = {Gallagher, John P. and Gelfond, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.73}, URN = {urn:nbn:de:0030-drops-31806}, doi = {10.4230/LIPIcs.ICLP.2011.73}, annote = {Keywords: Regular types, Canonical forms, Type canonizer} }
Feedback for Dagstuhl Publishing