Deciding subset relationship of co-inductively defined set constants
Static analysis of different non-strict functional programming languages makes use of set constants like Top, Inf, and Bot denoting all expressions, all lists without a last Nil as tail, and all non-terminating programs, respectively. We use a set language that permits union, constructors and recursive definition of set constants with a greatest fixpoint semantics. This paper proves decidability, in particular EXPTIMEcompleteness, of subset relationship of co-inductively defined sets by using algorithms and results from tree automata. This shows decidability of the test for set inclusion, which is required by certain strictness analysis algorithms in lazy functional programming languages.
Download full text files
-
Orig. Version, 15. Aug. 2005
-
Rev. Version, 28 Sept. 2006
Export metadata
Additional Services
| Author: | Manfred Schmidt-Schauß, David Sabel, Marko Schütz |
|---|---|
| URN: | urn:nbn:de:hebis:30-23464 |
| Series (Serial Number) | Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik (23) |
| Publisher: | Johann Wolfgang Goethe-Univ., Fachbereich Informatik und Mathematik, Inst. für Informatik, Research group for Artificial Intelligence and Software Technology |
| Place of publication: | Frankfurt [am Main] |
| Document Type: | Working Paper |
| Language: | English |
| Date of Publication (online): | 19.04.2006 |
| Year of first Publication: | 2005 |
| Publishing Institution: | Univ.-Bibliothek Frankfurt am Main |
| Source: | Technical Report Frank 23, Institut für Informatik, Johann Wolfgang Goethe-Universität Frankfurt am Main |
| HeBIS PPN: | 195632117 |
| Institutes: | Informatik |
| Dewey Decimal Classification: | 004 Datenverarbeitung; Informatik |
| Sammlungen: | Universitätspublikationen |
| Licence (German): |  Veröffentlichungsvertrag für Publikationen ohne Print on Demand |
