PROVING PRODUCTIVITY IN INFINITE DATA STRUCTURES

DOI10.4230/LIPIcs.RTA.2010.401zbMath1236.68056OpenAlexW1560126479MaRDI QIDQ5389158

Matthias Raffelsieper, Hans Zantema

Publication date: 25 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_6448.html

zbMATH Keywords

productivitystreamsinfinite data structures

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Data structures (68P05)

Related Items (5)

Transducer degrees: atoms, infima and suprema ⋮ Highlights in infinitary rewriting and lambda calculus ⋮ Lazy productivity via termination ⋮ Applications and extensions of context-sensitive rewriting ⋮ Unnamed Item

This page was built for publication: PROVING PRODUCTIVITY IN INFINITE DATA STRUCTURES