Computational Complexity and Induction for Partial Computable Functions in Type Theory (1999)

by Robert L. Constable , Karl Crary
Venue:In Preprint
Citations:11 - 7 self

Document Versions

Computational Complexity and Induction for Partial Computable Functions in Type Theory –Robert L. Constable, Karl Crary — 1999 — In Preprint