LIPIcs.ICLP.2011.73.pdf
- Filesize: 0.53 MB
- 11 pages
Document
Canonical Regular Types
Authors
-
Part of:
Volume:
Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (ICLP 2011)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Logic Programming (ICLP) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2011-06-27
Cite AsGet BibTex
Ethan K. Jackson, Nikolaj Bjørner, and Wolfram Schulte. Canonical Regular Types. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 73-83, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.ICLP.2011.73
https://doi.org/10.4230/LIPIcs.ICLP.2011.73
Abstract
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.
Keywords
- Regular types
- Canonical forms
- Type canonizer
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads