Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 1146.68353
Schmidt-Schauss; Manfred; Sabel, David; Schütz, Marko
Deciding inclusion of set constants over infinite non-strict data structures. (English)
[J] Theor. Inform. Appl. 41, No. 2, 225-241 (2007). ISSN 0988-3754; ISSN 1290-385X/e

Summary: Various static analyses of functional programming languages that permit infinite data structures make use of set constants like {\tt Top}, {\tt Inf}, and {\tt Bot}, denoting all terms, all lists not eventually ending in Nil, 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 in the set of all, also infinite, computable trees, where all term constructors are non-strict. This paper proves decidability, in particular DEXPTIME-completeness, of inclusion of co-inductively defined sets by using algorithms and results from tree automata and set constraints. The test for set inclusion is required by certain strictness analysis algorithms in lazy functional programming languages and could also be the basis for further set-based analyses.

MSC 2000:: *68N18 Functional programming and lambda calculus
03B40 Combinatory logic
68Q25 Analysis of algorithms and problem complexity
68Q45 Formal languages

Keywords: DEXPTIME-completeness; lazy functional programming languages

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Article Article Journal Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]