Upper Bounds on Stream I/O Using Semantic Interpretations

DOI10.1007/978-3-642-04027-6_21MaRDI QIDQ3644754zbMATH OpenOpenAlexFDO

Authors Marco Gaboardi, Romain Péchoux

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Global and local space properties of stream programs
• scientific article; zbMATH DE number 3903937
• Infinite streams and finite observations in the semantics of uniform concurrency
• Relating operational and denotational semantics for input/output effects
• scientific article; zbMATH DE number 2079038

Cites work

• A Characterization of NC k by First Order Functional Programs
• A term calculus for (co-)recursive definitions on streamlike data structures
• An extensional treatment of dataflow deadlock
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• scientific article; zbMATH DE number 2182486 (Why is no real title available?)
• Orderings for term-rewriting systems
• Productivity of Stream Definitions
• Quasi-interpretations. A way to control resources
• Recursion Schemata for NC k
• Sup-interpretations, a semantic method for static analysis of program resources

Cited in

(3)

• Characterizing polynomial time complexity of stream programs using interpretations
• Parsimonious types and non-uniform computation
• Global and local space properties of stream programs

This page was built for publication: Upper Bounds on Stream I/O Using Semantic Interpretations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644754)