Upper Bounds on Stream I/O Using Semantic Interpretations
From MaRDI portal
Publication:3644754
DOI10.1007/978-3-642-04027-6_21zbMath1257.68048OpenAlexW1492921884MaRDI QIDQ3644754
Romain Péchoux, Marco Gaboardi
Publication date: 12 November 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00431469/file/csl.pdf
Related Items
Parsimonious Types and Non-uniform Computation ⋮ Characterizing polynomial time complexity of stream programs using interpretations
Cites Work
- Unnamed Item
- Quasi-interpretations. A way to control resources
- Orderings for term-rewriting systems
- An extensional treatment of dataflow deadlock
- A term calculus for (co-)recursive definitions on streamlike data structures
- Sup-interpretations, a semantic method for static analysis of program resources
- A Characterization of NC k by First Order Functional Programs
- Recursion Schemata for NC k
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Productivity of Stream Definitions
