Automated complexity analysis of Nuprl extracted programs

DOI10.1017/S0956796800003865zbMath0987.68013MaRDI QIDQ2740983

Ralph Benzinger

Publication date: 18 June 2002

Published in: Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

automated complexity analysis prototypesymbolic evaluation rules

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (2)

Analysing the implicit complexity of programs. ⋮ Automated higher-order complexity analysis

Uses Software

• Mathematica
• PVS
• Nuprl

This page was built for publication: Automated complexity analysis of Nuprl extracted programs