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
1 The Ultimate Challenge: The – Jeffery C Lagarias - 2010
29 On Folk Theorems – David Harel - 1980
22 The Tower of Hanoi – A M Hinz - 1997
61 Containers - constructing strictly positive types, Theoretical Computer Science 342 (2005) 3–27, applied Semantics: Selected Topics – M Abott, T Altenkirch, N Ghani
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
475 Recursively Enumerable Sets and Degrees – R Soare - 1987
44 Recursive predicates and quantifiers – S C Kleene - 1943
52 Behavioural Differential Equations: A Coinductive Calculus of Streams, Automata, and Power Series – J. J. M. M. Rutten - 2000
60 Theory of recursive functions and effective computability Second edition – Hartley Rogers Jr - 1987
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
14 Termination proofs by multiset path orderings imply primitive recursive derivation lengths – D Hofbauer - 1992