Taming Modal Impredicativity: Superlazy Reduction

  • Ugo Dal Lago
  • Luca Roversi
  • Luca Vercelli
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5407)


Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is considered as computation. We introduce modal impredicativity as a new form of impredicativity causing cut-elimination to be problematic from a complexity point of view. Modal impredicativity occurs when, during reduction, the conclusion of a residual of a box b interacts with a node that belongs to the proof net inside another residual of b. Technically speaking, superlazy reduction is a new notion of reduction that allows to control modal impredicativity. More specifically, superlazy reduction replicates a box only when all its copies are opened. This makes the overall cost of reducing a proof net finite and predictable. Specifically, superlazy reduction applied to any pure proof nets takes primitive recursive time. Moreover, any primitive recursive function can be computed by a pure proof net via superlazy reduction.


Linear logic implicit computational complexity proof theory 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dal Lago, U.: The geometry of linear higher-order recursion. In: Proc. 20th Annual Symposium on Logic in Computer Science, pp. 366–375. IEEE Computer Society, Los Alamitos (2005)Google Scholar
  2. 2.
    Dal Lago, U., Roversi, L., Vercelli, L.: Taming modal impredicativity: Superlazy reduction. Extended Version (2008),
  3. 3.
    Feferman, S.: Predicativity. In: Shapiro, S. (ed.) The Oxford Handbook of the Philosophy of Mathematics and Logic, pp. 590–624. Oxford University Press, Oxford (2005)CrossRefGoogle Scholar
  4. 4.
    Girard, J.-Y., Scedrov, A., Scott, P.: Bounded linear logic: A modular approach to polynomial time computability. Theor. Comput. Sci. 97, 1–66 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Girard, J.-Y.: Geometry of interaction 1: interpretation of system F. In: Proc. Logic Colloquium 1988, pp. 221–260 (1989)Google Scholar
  6. 6.
    Girard, J.-Y.: Light linear logic. Information and Computation 143(2), 175–204 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Hofmann, M.: Linear types and non-size-increasing polynomial time computation. In: Proceedings of the 14th Symposium on Logic in Computer Science, pp. 464–473. IEEE Computer Society, Los Alamitos (1999)Google Scholar
  8. 8.
    Lafont, Y.: Soft linear logic and polynomial time. Theor. Comput. Sci. 318, 163–180 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Leivant, D.: Stratified functional programs and computational complexity. In: Proceedings of 20th ACM Symposium on Principles of Programming Languages, pp. 325–333 (1993)Google Scholar
  10. 10.
    Leivant, D.: Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity. Ann. Pure Appl. Logic 96(1-3), 209–229 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Leivant, D., Danner, N.: Stratified polymorphism and primitive recursion. Math. Struct. in Comp. Science 9, 507–522 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Leivant, D., Marion, J.-Y.: A characterization of alternating log time by ramified recurrence. Theor. Comput. Sci. 236(1-2), 193–208 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Mascari, G., Pedicini, M.: Head linear reduction and pure proof net extraction. Theor. Comput. Sci. 135(1), 111–137 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Simmons, H.: Tiering as a recursion technique. Bulletin of Symbolic Logic 11(3), 321–350 (2005)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Ugo Dal Lago
    • 1
  • Luca Roversi
    • 2
  • Luca Vercelli
    • 3
  1. 1.Dipartimento di InformaticaUniversità di BolognaItaly
  2. 2.Dipartimento di InformaticaUniversità di TorinoItaly
  3. 3.Dipartimento di MatematicaUniversità di TorinoItaly

Personalised recommendations