Advertisement

Lower and upper bounds for reductions of types in λ and λP (extended abstract)

  • Jan Springintveld
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 664)

Abstract

For several important systems of the λ-cube we study the time-complexity of type conversion. Non-elementary lower bounds are given for the type-conversion problem for λ\(\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{\omega }\)and λP and hence for the systems that include one of these systems. For λ\(\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{\omega }\)and λP a super-exponential upper bound is given to the length of reduction sequences starting from types that are legal in these systems.

Keywords

Induction Hypothesis Reduction Rule Application Rule Type Inference Active Occurrence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Barendregt, H.P., ‘Lambda calculi with types', in: Abramski, S., Gabbay, D.M. & Maibaum, T.S.E., eds., Handbook of Logic in Computer Science, Oxford University Press, 1992.Google Scholar
  2. [2]
    Coquand, Th. and Huet, G., ‘The calculus of constructions', Information and Computation, Vol. 76, pp. 95–120, 1988.Google Scholar
  3. [3]
    Geuvers, H. and Nederhof, M.-J., ‘Modular proof of strong normalization for the calculus of constructions', in: The Journal of Functional Programming, Vol.1, pp. 155–189, 1991.Google Scholar
  4. [4]
    Pollack, R., ‘Typechecking in pure type systems', in: Nördstrom, B., Petersson, K. and Plotkin, G., eds., Proceedings of the 1992 Workshop on Types for Proofs and Programs, Båstad, June 92, pp. 289–306.Google Scholar
  5. [5]
    Rose, H.E., Subrecursion. Functions and Hierarchies, Clarendon Press, Oxford, 1984.Google Scholar
  6. [6]
    Schwichtenberg, H., ‘An upperbound for reduction sequences in the typed λ-calculus', Archive for Mathematical Logic, Vol.30, pp. 405–408, 1991.Google Scholar
  7. [7]
    Statman, R., ‘The typed lambda calculus is not elementary recursive', Theoretical Computer Science, Vol. 9, pp. 73–81, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Jan Springintveld
    • 1
  1. 1.Department of PhilosophyUniversity of UtrechtTC UtrechtThe Netherlands

Personalised recommendations