Extending pruning techniques to polymorphic second order λ-Calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 788 LNCS, Issue , 1994, Pages 120-134

  Boerio, Luca ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS;

CONSTRUCTIVE LOGIC; LAMBDA CALCULUS; LAMBDA TERMS; OPTIMIZATION ALGORITHMS; PRUNING TECHNIQUES; SECOND ORDERS; TYPE THEORY;

DIFFERENTIATION (CALCULUS);

EID: 84944187299     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57880-3_8     Document Type: Conference Paper

References (11)

1. M. Beeson, Foundations of Constructive Mathematics, Berlin, Springer-Verlag, 1985
2. S. Berardi, Extensional Equality for Simply Typed λ-calculi, Technical Report, Turin University, 1993.
3. S. Berardi, A canonical Projection between Simply Typed λ-calculi, Technical Report, Turin University, 1993.
4. S. Berardi, Pruning Simply Typed λ-terms, Technical Report, Turin University, 1993.
5. R. L. Constable et al., Implementing Mathematics with the Nuprl Proof Development System, Prentice-Hall, 1986.
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.
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.
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.
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.
10. Y. Takayama, Extraction of Redundancy-free Programs from Constructive Natural Deduction Proofs, Journal of Symbolic Computation, 1991, 12, 29-69
11. A. S. Troelstra, Mathematical Investigation of Intuitionistic Arithmetic and Analysis, Lecture Notes in Mathematics, 344, Springer-Verlag, 1973