Using subtyping in program optimization

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

Volumn 902, Issue , 1995, Pages 63-77

  Berardi, S ^a   Boerio, L ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; PATHOLOGY;

AUTOMATICALLY GENERATED; CONSTRUCTIVE LOGIC; CONSTRUCTIVE PROOF; CURRY-HOWARD ISOMORPHISM; EXECUTABLE CODES; LAMBDA TERMS; LOGIC FORMULAS; PROGRAM OPTIMIZATION;

FORMAL LANGUAGES;

EID: 84947439044     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014045     Document Type: Conference Paper

References (7)

1. M. Beeson, Foundations of Constructive Mathematics, Berlin, Springer-Verlag, 1985
2. S. Berardi, An Application of PER Models to Program Extraction, Technical Report, Turin University, 1992.
3. S. Berardi, Pruning Simply Typed X-terms, Technical Report, Turin University, 1993.
4. L. Boerio, Extending Pruning Techniques to Polymorphic Second Order X-Calculus, Proceedings of ESOP '94, Edinburgh, April 1994, LNCS 788, D. SanneUa (ed.), Springer-Verlag, pp. 120-134.
5. C. Paulin-Mohring, Extracting Fu '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.
6. Y. Takayama, Extraction of Redundancy-free Programs from Constructive Natural Deduction Proofs, Journal of Symbolic Computation, 1991, 12, 29-69
7. A. S. Troelstra, Mathematical Investigation of Intuitionistic Arithmetic and Analysis, Lecture Notes in Mathematics, 344, Springer-Verlag, 1973