scientific article; zbMATH DE number 2061700

zbMath1039.68030MaRDI QIDQ4457446

Roberto M. Amadio

Publication date: 22 March 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2701/27010031.htm

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

zbMATH Keywords

functional languagesstatic analysisterm rewritingimplicit computational complexityfunction algebrasmax-plus algebraspolynomial interpretations

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Inferring Static Non-monotone Size-aware Types Through Testing ⋮ Quasi-interpretations. A way to control resources ⋮ A semantic proof of polytime soundness of light affine logic ⋮ Resource control for synchronous cooperative threads