Publication:4681361
From MaRDI portal
zbMath1102.68017MaRDI QIDQ4681361
Publication date: 23 June 2005
Full work available at URL: http://iospress.metapress.com/link.asp?id=rkdb2xjtn603me4p
Static analysis; Function algebras and implicit computational complexity; Functional languages and term rewriting; Polynomial interpretations and max-plus algebras
68Q25: Analysis of algorithms and problem complexity
68N18: Functional programming and lambda calculus
68Q42: Grammars and rewriting systems
Related Items
Reactive Concurrent Programming Revisited, Higher-order interpretations and program complexity, Characterizing polynomial time complexity of stream programs using interpretations, Realizability models for a linear dependent PCF, Resource control for synchronous cooperative threads, A Characterization of NC k by First Order Functional Programs, Arctic Termination ...Below Zero, Automatic Termination, Upper Bounds on Stream I/O Using Semantic Interpretations