Max-plus quasi-interpretations

DOI10.1007/3-540-44904-3_3MaRDI QIDQ4457446zbMATH OpenFDO

Authors Roberto M. Amadio

Publication date 22 March 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

function algebrasfunctional languagesimplicit computational complexitymax-plus algebraspolynomial interpretationsstatic analysisterm rewriting

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2182486
• Quasi-interpretations. A way to control resources
• Efficient first order functional program interpreter with time bound certifications
• On quasi-interpretations, blind abstractions and implicit complexity
• Synthesis of sup-interpretations: a survey

Cited in

(10)

• Resource control for synchronous cooperative threads
• On quasi-interpretations, blind abstractions and implicit complexity
• Sup-interpretations, a semantic method for static analysis of program resources
• Quasi-interpretation Synthesis by Decomposition
• Complexity invariance of real interpretations
• scientific article; zbMATH DE number 2182486 (Why is no real title available?)
• Inferring static non-monotone size-aware types through testing
• Quasi-interpretations. A way to control resources
• Interpretation and inference with maximal referential terms
• A semantic proof of polytime soundness of light affine logic

This page was built for publication: Max-plus quasi-interpretations

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