Sciweavers

25 search results - page 1 / 5
» Proving Productivity in Infinite Data Structures
Sort
View
RTA
2010
Springer
13 years 8 months ago
Proving Productivity in Infinite Data Structures
For a general class of infinite data structures including streams, binary trees, and the combination of finite and infinite lists, we investigate a notion of productivity. This ...
Hans Zantema, Matthias Raffelsieper
CADE
2009
Springer
14 years 5 months ago
Complexity of Fractran and Productivity
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
Clemens Grabmayer, Dimitri Hendriks, Jörg End...
ITA
2007
153views Communications» more  ITA 2007»
13 years 4 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
SIAMDM
2010
194views more  SIAMDM 2010»
12 years 11 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
ASM
2003
ASM
13 years 10 months ago
A Framework for Proving Contract-Equipped Classes
r in: Abstract State Machines 2003 — Advances in Theory and Applications, Proc. 10th International Workshop, Taormina, Italy, March 3-7, 2003, eds. Egon Boerger, Angelo Gargantin...
Bertrand Meyer