Automated higher-order complexity analysis
type: Item
instance of: scholarly article
title: Automated higher-order complexity analysis
zbMATH Open document ID: 1071.68029
author: Ralph Benzinger
published in: Theoretical Computer Science
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68N18
zbMATH DE Number: 2083404
zbMATH Keywords: Computational complexity analysis
zbMATH Keywords: Functional programs
zbMATH Keywords: Higher-order complexity
zbMATH Keywords: Program synthesis
zbMATH Keywords: Feasible mathematics
describes a project that uses: Nuprl
describes a project that uses: ACE
MaRDI profile type: Publication
full work available at URL: j.tcs.2003.10.022
OpenAlex ID: W2135155734
cites work: Proofs as programs
cites work: Higher type recursion, ramification and polynomial time
cites work: Computational complexity via programming languages: Constant factors do matter
cites work: Automated complexity analysis of Nuprl extracted programs
cites work: Q3794177
cites work: A note on complexity measures for inductive classes in constructive type theory
cites work: Q4133141
cites work: Optimality and inefficiency: what isn't a cost model of the lambda calculus?
cites work: Q4850553
cites work: Q4726219
cites work: Q4038672
cites work: A Naïve Time Analysis and its Theory of Cost Equivalence
cites work: Intensional interpretations of functionals of finite type I
cites work: Mechanical program analysis
DOI: 10.1016/J.TCS.2003.10.022
description: scientific article; zbMATH DE number 2083404