Equality of streams is a ∏20-complete problem

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn 2006, Issue , 2006, Pages 184-191

  Roşu, Grigore ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Algebraic specification; Infinite structures; Streams

Indexed keywords

ALGEBRAIC SPECIFICATION; CO-RECURSIVELY ENUMERABLE CLASSES; INFINITE STRUCTURES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIFFERENTIAL EQUATIONS; RECURSIVE FUNCTIONS;

PROBLEM SOLVING;

EID: 34247185928     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1159803.1159827     Document Type: Conference Paper

References (14)

1. F. Baader and T. Nipkow. Term rewriting and all that. Cambridge University Press, New York, NY, USA, 1998.
2. J. Bergstra and J. V. Tucker. Equational specifications, complete term rewriting systems, and computable and semicomputable algebras. Journal of the Association for Computing Machinery, 42(6):1194-1230, 1995.
3. M. Bidoit, R. Hennicker, and A. Kurz. Observational logic, constructor-based logic, and their duality. Theoretical Computer Science, 3(298):471-510, 2003.
4. S. Buss and G. Roşu. Incompleteness of behavioral logics. In H. Reichel, editor, Proceedings of Coalgebraic Methods in Computer Science (CMCS'00), Berlin, Germany, March 2000, volume 33 of Electronic Notes in Theoretical Computer Science, pages 61-79. Elsevier Science, 2000.
5. H. Geuvers. Inductive and coinductive types with iteration and recursion. In B. Nordström, K. Pettersson, and O. Plotkin, editors, Informal Proceedings Workshop on Types for Proofs and Programs, Båstad, Sweden, 8-12 June 1992, pages 193-217. Dept. of Computing Science, Chalmers Univ. of Technology and Göteborg Univ., 1992.
6. J. Goguen. Types as theories. In G. M. Reed, A. W. Roscoe, and R. F. Wachter, editors, Topology and Category Theory in Computer Science, pages 357-390. Oxford, 1991.
7. J. Goguen and G. Malcolm. A hidden agenda. Theoretical Computer Science, 245(1):55-101, 2000.
8. R. Hennicker. Context induction: a proof principle for behavioral abstractions. Formal Aspects of Computing, 3(4):326-345, 1991.
9. R. Kennaway, J. W. Klop, M. R. Sleep, and F.-J. de Vries. Transfinite reductions in orthogonal term rewriting systems. Inf. Comput., 119(1):18-38, 1995.
10. G. Roşu. Hidden Logic. PhD thesis, University of California at San Diego, 2000.
11. 0-complete problem. Technical Report UIUCDCS-R-2006-2708, University of Illinois at Urbana-Champaign, Department of Computer Science, Apr. 2006.
12. G. Roşu and J. Goguen. Hidden congruent deduction. In R. Caferra and G. Salzer, editors, Automated Deduction in Classical and Non-Classical Logics. Springer, 2000. Lecture Notes in Artificial Intelligence, Volume 1761.
13. H. Rogers Jr. Theory of Recursive Functions and Effective Computability. MIT press, Cambridge, MA, 1987.
14. J. Rutten. A tutorial on coinductive stream calculus and signal flow graphs. Journal of Theoretical Computer Science, pages 443-481, Oct. 2005.