scientific article; zbMATH DE number 2182486

zbMath1102.68017MaRDI QIDQ4681361

Roberto M. Amadio

Publication date: 23 June 2005

Full work available at URL: http://iospress.metapress.com/link.asp?id=rkdb2xjtn603me4p

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Static analysisFunction algebras and implicit computational complexityFunctional languages and term rewritingPolynomial interpretations and max-plus algebras

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (9)

Higher-order interpretations and program complexity ⋮ A Characterization of NC k by First Order Functional Programs ⋮ Arctic Termination ...Below Zero ⋮ Resource control for synchronous cooperative threads ⋮ Automatic Termination ⋮ Upper Bounds on Stream I/O Using Semantic Interpretations ⋮ Reactive Concurrent Programming Revisited ⋮ Characterizing polynomial time complexity of stream programs using interpretations ⋮ Realizability models for a linear dependent PCF

This page was built for publication: