Skip to main content Accessibility help
×
Home

On the complexity of stream equality

  • JÖRG ENDRULLIS (a1), DIMITRI HENDRIKS (a1), RENA BAKHSHI (a1) and GRIGORE ROŞU (a2)

Abstract

We study the complexity of deciding the equality of streams specified by systems of equations. There are several notions of stream models in the literature, each generating a different semantics of stream equality. We pinpoint the complexity of each of these notions in the arithmetical or analytical hierarchy. Their complexity ranges from low levels of the arithmetical hierarchy such as Π02 for the most relaxed stream models, to levels of the analytical hierarchy such as Π11 and up to subsuming the entire analytical hierarchy for more restrictive but natural stream models. Since all these classes properly include both the semi-decidable and co-semi-decidable classes, it follows that regardless of the stream semantics employed, there is no complete proof system or algorithm for determining equality or inequality of streams. We also discuss several related problems, such as the existence and uniqueness of stream solutions for systems of equations, as well as the equality of such solutions.

Copyright

References

Hide All
Aczel, P. (1988) Non-well-founded Sets, Lecture Notes, no. 14. Stanford, CA: Center for the Study of Language and Information, Stanford University.
Bidoit, M., Hennicker, R. & Kurz, A. (2003) Observational logic, constructor-based logic, and their duality. Theor. Comput. Sci. 298, 471510.
Böhm, C. (ed.) (1975) Lambda-Calculus and Computer Science Theory: Proceedings of the Symposium Held in Rome, March 25-27, 1975, LNCS, vol. 37. Berlin: Springer.
Buss, S. R. & Roşu, G. (2000) Incompleteness of behavioral logics. Electron. Notes Theor. Comput. Sci. 33, 6179.
Castro, J. & Cucker, F. (1989) Nondeterministic ω-computations and the analytical hierarchy. Logik und Grundlagen der Mathematik 35, 333342.
Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J. & Talcott, C. (2003) The Maude 2.0 system. In Proceedings of the Conference on Rewriting Techniques and Applications (RTA 2003), Nieuwenhuis, R. (ed.), Lecture Notes in Computer Science, vol. 2706. Berlin: Springer, pp. 7687.
Coquand, Th. (1993) Infinite objects in type theory. In Proceedings of the Conference on Types for Proofs and Programs (TYPES 1993), Barendregt, H. & Nipkow, T. (eds), Lecture Notes in Computer Science, vol. 806. Berlin: Springer, pp. 6278.
Danielsson, N. A. (2010) Beating the productivity checker using embedded languages. EPTCS 43, 2948.
Dershowitz, N., Kaplan, S. & Plaisted, D. A. (1991) Rewrite, rewrite, rewrite, rewrite, rewrite. Theor. Comput. Sci. 83, 7196.
Ehrig, H. & Mahr, B. (1985) Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science. Berlin: Springer.
Endrullis, J., Geuvers, H., Simonsen, J. G. & Zantema, H. (2011b) Levels of undecidability in rewriting. Inf. Comput. 209 (2), 227245.
Endrullis, J., Grabmayer, C. & Hendriks, D. (2008) Data-oblivious stream productivity. In Proceedings of the Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR 2008), Cervesato, I., Veith, H. & Voronkov, A. (eds), Lecture Notes in Computer Science, vol. 5330. Berlin: Springer, pp. 7996.
Endrullis, J., Grabmayer, C. & Hendriks, D. (2009) Complexity of fractran and productivity. In Proceedings of ther Conference on Automated Deduction (CADE 22), Schmidt, R. A. (ed.), LNCS, vol. 5663. Berlin: Springer, pp. 371387.
Endrullis, J., Grabmayer, C., Hendriks, D., Isihara, A. & Klop, J. W. (2010a) Productivity of stream definitions. Theor. Comput. Sci. 411, 765782.
Endrullis, J., Grabmayer, C., Hendriks, D., Klop, J. W. & van Oostrom, V. (2010b) Unique normal forms in infinitary weakly orthogonal rewriting. LIPIcs 6, 85102.
Endrullis, J., Hendriks, D. & Bakhshi, R. (2012b) On the complexity of equivalence of specifications of infinite objects. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP 2013). New York: ACM, pp. 153164.
Endrullis, J., Hendriks, D. & Bodin, M. (2013) Circular coinduction in Coq using bisimulation-up-to techniques. In Proceedings of the Conference on Interactive Theorem Proving (ITP 2013), Lecture Notes in Computer Science, vol. 7998. Berlin: Springer, pp. 354369.
Endrullis, J., Hendriks, D. & Klop, J. W. (2011a) Degrees of streams. J. Integers 11B (A6), 140.
Endrullis, J., Hendriks, D. & Klop, J. W. (2012a) Highlights in infinitary rewriting and lambda calculus. Theor. Comput. Sci. 464, 4871.
Finkel, O. & Lecomte, D. (2009) Decision problems for Turing machines. Inf. Process. Lett. 109 (23–24), 12231226.
Friedman, D. P. & Wise, D. S. (1976) CONS should not evaluate its arguments. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP 1976), Edinburgh: Edinburgh University Press, pp. 257284.
Geuvers, H. (1992) Inductive and coinductive types with iteration and recursion. Paper presented at the Proceedings of the Workshop on Types for Proofs and Programs (TYPES 1992), Sweden, pp. 193217.
Goguen, J. (1991) Types as theories. In Topology and Category Theory in Computer Science. Oxford: Oxford University Press, pp. 357390.
Goguen, J. & Malcolm, G. (2000) A hidden agenda. Theor. Comput. Sci. 245 (1), 55101.
Goguen, J. A., Thatcher, J. W., Wagner, E. G. & Wright, J. B. (1977) Initial algebra semantics and continuous algebras. JACM 24 (1), 6895.
Grabmayer, C., Endrullis, J., Hendriks, D., Klop, J. W. & Moss, L. S. (2012) Automatic sequences and zip-specifications. In Proceedings of the Symposium on Logic in Computer Science (LICS 2012). Washington, DC: IEEE Computer Society, pp. 335344.
Harel, D. (1985). Recurring dominoes: Making the highly undecidable highly understandable. In Topics in the Theory of Computation, Selected Papers of the International Conference on Foundations of Computation Theory, FCT 1983, vol. 102. Amsterdam: North-Holland, pp. 5171.
Harel, D., Kozen, D. & Tiuryn, J. (2000) Dynamic Logic. Foundations of Computing. Cambridge, MA: MIT Press.
Henderson, P. & Morris, J. H. Jr. (1976) A lazy evaluator. In Proceedings of the ACM SIGACT-SIGPLAN Symposium on Principles on Programming Languages (POPL 1976). New York: ACM, pp. 95103.
Hennicker, R. (1991) Context induction: A proof principle for behavioural abstractions and algebraic implementations. Form. Asp. Comput. 3 (4), 326345.
Hinman, P. G. (1978) Recursion-Theoretic Hierarchies. Perspectives in Mathematical Logic, vol. 9. Berlin: Springer.
Kennaway, J. R., Klop, J. W., Sleep, M. R. & de Vries, F.-J. (1997) Infinitary lambda calculus. Theor. Comput. Sci. 175 (1), 93125.
Ketema, J. & Simonsen, J. G. (2010) Infinitary combinatory reduction systems: Normalising reduction strategies. Logical Methods Comput. Sci. 6 (1:7), 135.
Klop, J. W. & de Vrijer, R. (2005) Infinitary normalization. In We Will Show Them: Essays in Honour of Dov Gabbay (2). College Publications, pp. 169–192. Available at: ftp://ftp.cwi.nl/pub/CWIreports/SEN/SEN-R0516.pdf.
Landin, P. J. (1965) Correspondence between Algol 60 and Churchs lambda-notation: Part I. Commun. ACM 8 (2), 89101.
Lucanu, D., Goriac, E.-I., Caltais, G. & Rosu, G. (2009) CIRC: A behavioral verification tool based on circular coinduction. In Proceedings of the Conference on Algebra and Coalgebra in Computer Science (CALCO 2009), Lecture Notes in Computer Science, vol. 5728. Berlin: Springer, pp. 433442.
Malcolm, G. (1997) Hidden algebra and systems of abstract machines. Paper presented at the Proceedings of the Symposium on New Models for Software Architecture (IMSA).
Meyer, A. R., Streett, R. S. & Mirkowska, G. (1981) The deducibility problem in propositional dynamic logic. In Proceedings of the 8th Colloquium on Automata, Languages and Programming (ICALP 1981), Even, S. & Kariv, O. (eds), Lecture Notes in Computer Science, vol. 115. Berlin: Springer, pp. 238248.
Niqui, M. (2009) Coalgebraic reasoning in Coq: Bisimulation and the λ-coiteration scheme. In Proceedings of the Workshop on Types for Proofs and Programs (TYPES 2008), Lecture Notes in Computer Science, vol. 5497. Berlin: Springer, pp. 272288.
Odifreddi, P. G. (1992) Classical recursion theory. In The Theory of Functions and Sets of Natural Numbers, vol. 1, Studies in Logic and the Foundations of Mathematics, vol. 125. Amsterdam: Elsevier.
Odifreddi, P. G. (1999) Classical recursion theory. In The Theory of Functions and Sets of Natural Numbers, vol. 2, Studies in Logic and the Foundations of Mathematics, vol. 143. Amsterdam: Elsevier.
Peyton-Jones, S. (2003) Haskell 98 Language and Libraries, The Revised Report. Cambridge: Cambridge University Press.
Rogers, H. Jr. (1967) Theory of Recursive Functions and Effective Computability. New York: McGraw-Hill.
Roşu, G. (2000) Hidden Logic. Ph.D. thesis, University of California.
Roşu, G. (2006) Equality of streams is a Π02-complete problem. In Proceedings of the ACM SIGPLAN Conference on Functional Programming (ICFP 2006). New York: ACM, pp. 184191.
Rutten, J. J. M. M. (2000) Universal coalgebra: A theory of systems. Theor. Comput. Sci. 249 (1), 380.
Rutten, J. J. M. M. (2003) Behavioural differential equations: A coinductive calculus of streams, automata, and power series. Theor. Comput. Sci. 308 (1–3), 153.
Rutten, J. J. M. M. (2005) A coinductive calculus of streams. Math. Struct. Comput. Sci. 15, 93147.
Shoenfield, J. R. (1971) Degrees of Unsolvability. New York: North-Holland.
Sijtsma, B. A. (1989) On the productivity of recursive list definitions. ACM Trans. Program. Lang. Syst. 11 (4), 633649.
Sleep, M. R., Plasmeijer, M. J. & van Eekelen, M. C. J. D. (eds) (1993) Term Graph Rewriting: Theory and Practice. Chichester: John Wiley.
Terese. (2003) Term Rewriting Systems. Cambridge: Cambridge University Press.
Turner, D. A. (1986) An overview of Miranda. SIGPLAN Not. 21 (12), 158166.
Zantema, H. & Endrullis, J. (2011) Proving equality of streams automatically. Paper presented at the Proceedings of the Conference on Rewriting Techniques and Applications (RTA 2011), pp. 393–408.

On the complexity of stream equality

  • JÖRG ENDRULLIS (a1), DIMITRI HENDRIKS (a1), RENA BAKHSHI (a1) and GRIGORE ROŞU (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.

On the complexity of stream equality

  • JÖRG ENDRULLIS (a1), DIMITRI HENDRIKS (a1), RENA BAKHSHI (a1) and GRIGORE ROŞU (a2)
Submit a response

Discussions

No Discussions have been published for this article.

×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *