Levels of Undecidability in Rewriting (2011)

Cached

Download Links

by Jörg Endrullis , Herman Geuvers , Jakob Grue Simonsen , Hans Zantema
Citations:2 - 1 self

Documents Related by Co-Citation

8 Fractran: A simple universal programming language for arithmetic – John H Conway - 1987
2 Theorem on the normal form of a program – E Perkowska - 1974
4 The Π0 2-Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) – Jakob Grue Simonsen
5 Complexity of Fractran and productivity – Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks - 2009
2 Böhm and Giuseppe Jacopini. Flow diagrams, turing machines and languages with only two formation rules – Corrado - 1966
8 On the productivity of recursive definitions – Edsger W Dijkstra - 2010
3 Ariya Isihara, and Jan Willem Klop. Productivity of stream definitions – Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
27 On Folk Theorems – David Harel - 1980
50 Behavioural Differential Equations: A Coinductive Calculus of Streams, Automata, and Power Series – J. J. M. M. Rutten - 2000
45 Recursive predicates and quantifiers – S C Kleene - 1943
21 The Tower of Hanoi – A HINZ - 1989
477 Recursively enumerable sets and degrees – Robert I Soare - 1987
63 Containers: Constructing strictly positive types – M Abbott, T Altenkirch, N Ghani - 2005
2 The Ultimate Challenge: The – ed J C Lagarias - 2010
9 Sup-interpretations, a semantic method for static analysis of program resources – JEAN-YVES MARION , Romain Péchoux
19 Term Rewriting Systems, volume 55 of Cambridge Tracts – Terese - 2003
3 Heap-size analysis for assembly programs – J-Y Marion, J-Y Moyen - 2006
26 Termination of Term Rewriting – Hans Zantema - 2000
8 Equality of streams is a Π0 2-complete problem – G Roşu - 2006