Computational Complexity and Induction for Partial ComputableFunctions in Type

@inproceedings{ConstableCornell1999ComputationalCA,
  title={Computational Complexity and Induction for Partial ComputableFunctions in Type},
  author={TheoryRobert L. ConstableCornell},
  year={1999}
}
  • TheoryRobert L. ConstableCornell
  • Published 1999
An adequate theory of partial computable functions should provide a basis for deening computational complexity measures and should justify the principle of computational induction for reasoning about programs on the basis of their recursive calls. There is no practical account of these notions in type theory, and consequently such concepts are not available in applications of type theory where they are greatly needed. It is also not clear how to provide a practical and adequate account in… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 45 references

Type-Theoretic Methodology for Practical Programming Languages

  • Karl Crary
  • PhD thesis,
  • 1998
Highly Influential
12 Excerpts

The semantics of re ected proof

  • Stuart F. Allen, Robert L. Constable, Douglas J. Howe, WilliamAitken
  • In Proceedings of the Fifth Symposium on Logic in…
  • 1990
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…