Abstract
These lecture notes are meant to serve as a short introduction to implicit computational complexity for those students who have little or no knowledge of recursion theory and proof theory. They have been obtained by enriching and polishing a set of notes the author wrote for a course (on the same subject) he gave at ESSLLI 2010. These notes are definitely not meant to be comprehensive nor exhaustive, but on the other hand much effort has been done to keep them self-contained.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, New York (2009)
Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press (1998)
Barendregt, H.P.: The Lambda Calculus – Its Syntax and Semantics. North-Holland (1984)
Bellantoni, S., Cook, S.A.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity 2, 97–110 (1992)
Bonfante, G., Cichon, A., Marion, J.-Y., Touzet, H.: Algorithms with polynomial interpretation termination proof. Journal of Functional Programming 11(1), 33–53 (2001)
Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: Quasi-interpretations a way to control resources. Theoretical Computer Science 412(25), 2776–2796 (2011)
Cobham, A.: The intrinsic computational difficulty of functions. In: Bar-Hillel, Y. (ed.) Logic, Methodology and Philosophy of Science, Proceedings of the 1964 International Congress, pp. 24–30. North-Holland (1965)
Cutland, N.: Computability: An Introduction to Recursive Function Theory. Cambridge University Press (1980)
Girard, J.-Y.: Light linear logic. Information and Computation 143(2), 175–204 (1998)
Hartmanis, J., Stearns, R.: On the computational complexity of algorithms. Transactions of the American Mathematical Society 117, 285–306 (1965)
Hindley, J.R., Seldin, J.P.: Lambda-Calculus and Combinators: An Introduction. Cambridge University Press (2008)
Hofmann, M.: Linear types and non-size-increasing polynomial time computation. Information and Computation 183(1), 57–85 (2003)
Kristiansen, L., Niggl, K.-H.: On the computational complexity of imperative programming languages. Theoretical Computer Science 318(1-2), 139–161 (2004)
Lafont, Y.: Soft linear logic and polynomial time. Theoretical Computer Science 318(1-2), 163–180 (2004)
Leivant, D.: Stratified functional programs and computational complexity. In: Proceedings of Twentieth Annual Symposium on Principles of Programming Languages, pp. 325–333 (1993)
Leivant, D., Marion, J.-Y.: Lambda Calculus Characterizations of Poly-Time. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, pp. 274–288. Springer, Heidelberg (1993)
Leivant, D., Marion, J.-Y.: Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, pp. 486–500. Springer, Heidelberg (1993)
Marion, J.-Y.: Analysing the implicit complexity of programs. Information and Computation 183(1), 2–18 (2003)
Neergaard, P.M.: A Functional Language for Logarithmic Space. In: Chin, W.-N. (ed.) APLAS 2004. LNCS, vol. 3302, pp. 311–326. Springer, Heidelberg (2004)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1993)
Rogers, H.: The Theory of Recursive Functions and Effective Computability. MIT Press (1987)
Terui, K.: Light affine lambda calculus and polynomial time strong normalization. Archive for Mathematical Logic 46(3-4), 253–280 (2007)
Turing, A.: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 2, 230–265 (1937)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dal Lago, U. (2012). A Short Introduction to Implicit Computational Complexity. In: Bezhanishvili, N., Goranko, V. (eds) Lectures on Logic and Computation. ESSLLI ESSLLI 2011 2010. Lecture Notes in Computer Science, vol 7388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31485-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-31485-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31484-1
Online ISBN: 978-3-642-31485-8
eBook Packages: Computer ScienceComputer Science (R0)