Stream Productivity by Outermost Termination (original) (raw)
Related papers
A Tool Proving Well-Definedness of Streams Using Termination Tools
Lecture Notes in Computer Science, 2009
Well-definedness of Streams by Termination
Well-definedness of Streams by Transformation and Termination
Logical Methods in Computer Science, 2010
Proving Productivity in Infinite Data Structures
A Transformational Approach to Prove Outermost Termination Automatically
Electronic Notes in Theoretical Computer Science, 2009
Proving Equality of Streams Automatically
AProVE: A system for proving termination
2003
Proving operational termination of membership equational programs
Higher-Order and Symbolic Computation, 2008
Computation on abstract data types. The extensional approach, with an application to streams
2020
G : a language based on demand-driven evaluation of streams
1987
Lecture Notes in Computer Science, 1994
Proving termination of membership equational programs
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '04, 2004
Functional Programming with Streams, Part II
Ngc, 1984
Correctness of dataflow and systolic algorithms using algebras of streams
Acta Informatica, 2001
Infinitary Algebraic Specifications for Stream Algebras
The size-change principle and dependency pairs for termination of term rewriting
Applicable Algebra in Engineering, Communication and Computing, 2005
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation, 2007
mu-term: Verify Termination Properties Automatically (System Description)
Automated Reasoning, 2020
Proceedings of the sixth workshop on Declarative aspects of multicore programming - DAMP '11, 2011
A path ordering for proving termination of term rewriting systems
Mathematical Foundations of …, 1985
Semantics and compilation of recursive sequential streams in 8 1/2
… Languages: Implementations, Logics, …, 1997
Non-transformational Termination Analysis of Logic Programs
Based on General Term-Orderings, Selected Papers …, 2000
Relaxing monotonicity for innermost termination
Information Processing Letters, 2005
mu-term: a tool for proving termination of rewriting with replacement restrictions?
Representations of Stream Processors Using Nested Fixed Points
Logical Methods in Computer Science, 2009
A Dependency Pair Framework for A ∨ C-Termination
Lecture Notes in Computer Science, 2010
Proving Termination Properties with mu-term
Lecture Notes in Computer Science, 2011
Termination Analysis by Dependency Pairs and Inductive Theorem Proving
Jürgen Giesl, Peter Schneider-kamp
Lecture Notes in Computer Science, 2009
Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs
Lecture Notes in Computer Science, 2015
Ensuring the Productivity of Infinite Structures
1997