Transforming derivational complexity of term rewriting to runtime complexity

DOI10.1007/978-3-030-29007-8_20zbMath1435.68132OpenAlexW2969639005MaRDI QIDQ2180239

Carsten Fuhs

Publication date: 13 May 2020

Full work available at URL: https://eprints.bbk.ac.uk/id/eprint/28185/1/FroCoS19-rcdc.pdf

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

Applications and extensions of context-sensitive rewriting

Uses Software

• AProVE

This page was built for publication: Transforming derivational complexity of term rewriting to runtime complexity