Deciding inclusion of set constants over infinite non-strict data structures

DOI10.1051/ita:2007010zbMath1146.68353OpenAlexW2045633736MaRDI QIDQ5441550

Marko Schütz, David Sabel, Manfred, Manfred Schmidt-Schauss

Publication date: 15 February 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2007__41_2_225_0

zbMATH Keywords

lazy functional programming languagesDEXPTIME-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Safety of Nöcker's strictness analysis

Uses Software

• CLEAN
• Haskell
• Fudgets

Cites Work

• Lambda calculus with explicit recursion
• Strictness and totality analysis
• Erratic Fudgets: A semantic theory for an embedded coordination language
• Deciding Equivalence of Finite Tree Automata
• Safety of Nöcker's strictness analysis
• Computer Science Logic
• Strictness, totality, and non-standard-type inference
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deciding inclusion of set constants over infinite non-strict data structures