Using term-graph rewriting models to analyse relative space efficiency

MaRDI QIDQ2843929zbMATH OpenFDO

Authors Adam Bakewell

Publication date 27 August 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066107005476

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1708150
• On term-graph rewrite strategies
• Analysing parallel complexity of term rewriting
• Modular complexity analysis for term rewriting
• Analyzing innermost runtime complexity of term rewriting by dependency pairs
• A graph reduction approach to incremental term rewriting
• scientific article; zbMATH DE number 234035
• Minimizing space usage in evaluation of expression trees
• Automated amortised resource analysis for term rewrite systems
• Complexity analysis of term-rewriting systems

Cited in

(1)

• Structure and properties of traces for functional programs

This page was built for publication: Using term-graph rewriting models to analyse relative space efficiency

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