License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2018.5
URN: urn:nbn:de:0030-drops-91758
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9175/
Alves, Sandra ;
Broda, Sabine
A Unifying Framework for Type Inhabitation
Abstract
In this paper we define a framework to address different kinds of problems related to type inhabitation, such as type checking, the emptiness problem, generation of inhabitants and counting, in a uniform way. Our framework uses an alternative representation for types, called the pre-grammar of the type, on which different methods for these problems are based. Furthermore, we define a scheme for a decision algorithm that, for particular instantiations of the parameters, can be used to show different inhabitation related problems to be in PSPACE.
BibTeX - Entry
@InProceedings{alves_et_al:LIPIcs:2018:9175,
author = {Sandra Alves and Sabine Broda},
title = {{A Unifying Framework for Type Inhabitation}},
booktitle = {3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)},
pages = {5:1--5:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-077-4},
ISSN = {1868-8969},
year = {2018},
volume = {108},
editor = {H{\'e}l{\`e}ne Kirchner},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9175},
URN = {urn:nbn:de:0030-drops-91758},
doi = {10.4230/LIPIcs.FSCD.2018.5},
annote = {Keywords: simple types, type inhabitation, rewriting, PSPACE}
}
|
Keywords: |
|
simple types, type inhabitation, rewriting, PSPACE |
|
Collection: |
|
3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
04.07.2018 |
