Searching for "Computational inductive definability." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Computational Complexity and Induction for Partial Computable Functions in Type Theory
by Robert L. Constable, Karl Crary — 1999 — In Preprint
… induction and to define computational complexity classes. Complexity classes take the form of complexity…
Cited by 12 (7 self) – Add To MetaCart

A metalanguage for structural operational semantics
by Matthew R. Lakin, Andrew M. Pitts — 2007 — In Symposium on Trends in Functional Programming
… as defined in §1 and ans stands for the type of proof-search computations on inductively defined relations. 3…
Cited by 4 (1 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB