A Note on Complexity Measures for Inductive Classes in Constructive Type Theory
Work
Year: 1998
Type: article
Abstract: It is notoriously hard to express computational complexity properties of programs in programming logics based on a semantics which respects extensional function equality. That is a serious impediment ... more
Source: Information and Computation
Author Robert L. Constable
Institution Cornell University
Cites: 54
Cited by: 4
Related to: 10
FWCI: 0.813
Citation percentile (by year/subfield): 58.02
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,630