On the complexity of stream equality
From MaRDI portal
Publication:2875229
DOI10.1017/S0956796813000324zbMath1297.68050MaRDI QIDQ2875229
Jörg Endrullis, Rena Bakhshi, Dimitri Hendriks, Grigore Roşu
Publication date: 14 August 2014
Published in: Journal of Functional Programming (Search for Journal in Brave)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Levels of undecidability in rewriting
- Productivity of stream definitions
- Decision problems for Turing machines
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Context induction: A proof principle for behavioural abstractions and algebraic implementations
- Infinitary lambda calculus
- A hidden agenda
- Universal coalgebra: A theory of systems
- Observational logic, constructor-based logic, and their duality.
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Highlights in infinitary rewriting and lambda calculus
- Nondeterministic Ω-Computations and the Analytical Hierarchy
- Initial Algebra Semantics and Continuous Algebras
- A coinductive calculus of streams
- Correspondence between ALGOL 60 and Church's Lambda-notation
This page was built for publication: On the complexity of stream equality
