Extending pruning techniques to polymorphic second order λ-calculus

  • Luca Boerio
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 788)


Type theory and constructive logics allow us, from a proof of a formula, to extract a program that satisfies the specification expressed by this formula. Normally, programs extracted in this way are inefficient. Optimization algorithms for these programs have been developed. In this paper we show an algorithm to optimize programs represented by second order typed λ-terms. We prove also that the simplified programs are observational equivalent to the original ones.


  1. [1]
    M. Beeson, Foundations of Constructive Mathematics, Berlin, Springer-Verlag, 1985Google Scholar
  2. [2]
    S. Berardi, Extensional Equality for Simply Typed λ-calculi, Technical Report, Turin University, 1993.Google Scholar
  3. [3]
    S. Berardi, A canonical Projection between Simply Typed λ-calculi, Technical Report, Turin University, 1993.Google Scholar
  4. [4]
    S. Berardi, Pruning Simply Typed λ-terms, Technical Report, Turin University, 1993.Google Scholar
  5. [5]
    R. L. Constable et al., Implementing Mathematics with the Nuprl Proof Development System, Prentice-Hall, 1986.Google Scholar
  6. [6]
    G. Dowek, A. Felty, H. Herbelin, G. Huet, C. Murthy, C. Parent, C. Pauling-Mohring, B. Werner, The Coq Proof Assistant-User's Guide, INRIA — Rocquencourt, 1983.Google Scholar
  7. [7]
    J.-Y. Girard, Interpretation Fonctionelle et Elimination des Coupures de l'Arithmetique d'Ordre Superieur, These de Doctorat d'Etat, Soutenue le 26 Juin 1972.Google Scholar
  8. [8]
    W.A. Howard, The Formulae-as-Types notion of Construction, in ‘Essays on Combinatory Logic, Lambda Calculus and Formlism', Eds J. P. Seldin and j. R. Hindley, Accademic Press, 1980.Google Scholar
  9. [9]
    C. Paulin-Mohring, Extracting F ω 's Programs from Proofs in the Calculus of Constructions, In: Association for Computing Machinery, editor, Sixteenth Annual ACM Symposium on Priciples of Programming Languages, 1989.Google Scholar
  10. [10]
    Y. Takayama, Extraction of Redundancy-free Programs from Constructive Natural Deduction Proofs, Journal of Symbolic Computation, 1991, 12, 29–69Google Scholar
  11. [11]
    A. S. Troelstra, Mathematical Investigation of Intuitionistic Arithmetic and Analysis, Lecture Notes in Mathematics, 344, Springer-Verlag, 1973Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Luca Boerio
    • 1
  1. 1.Dipartimento di InformaticaUniversita' di TorinoTorinoItaly

Personalised recommendations