Skip to main content
SpringerLink
Log in

First order marked types

  • Conference paper
  • First Online:
Types for Proofs and Programs (TYPES 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1158))

Included in the following conference series:

  • 217 Accesses

Abstract

We present a simple notion of marking of first order formulas, which enables to optimize program extraction from intuitionistic Natural Deduction proofs. It gives a way to mark some parts of a proof depending on the marking of its conclusion. Thus it allows to remove useless code from the extracted λ-terms. We define a notion of realizability by which we prove the correctness of programs extracted from marked proofs. We also detail a proof-marking algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Berardi, Pruning Simply Typed λ-terms, Technical Report, Turin University, 1993.

    Google Scholar 

  2. S. Berardi and L. Boerio, Using Subtyping in Program Optimization, Proceedings of TLCA '95, Edinburgh, April 1995, LNCS, Springer-Verlag.

    Google Scholar 

  3. L. Boerio, Extending Pruning Techniques to Polymorphic Second Order λ-Calculus, Proceedings of ESOP '94, Edinburgh, Avril 1994, LNCS 788, D. Sannella (ed.), Springer-Verlag, pp. 120–134.

    Google Scholar 

  4. C. Goad, Computational Uses of the Manipulation of Formal Proofs, Stanford Technical Report CS-80-819, 1980.

    Google Scholar 

  5. S. Hayashi and H. Nakano, PX: A Computational Logic, The MIT Press, 1988.

    Google Scholar 

  6. S. Hayashi and Y. Takayama ”Lifschitz's Logic of Calculable Numbers and Optimizations in Program Extraction”, 1994, LNCS 792, Springer Verlag.

    Google Scholar 

  7. J.L. Krivine and M. Parigot, Programming with proofs, J. Inform. Process. Cybern. EIK 26 (1990) 146–167.

    Google Scholar 

  8. Ch. Paulin-Mohring, Extracting F ω's Programs from Proofs in the Calculus of Constructions, in: Association for Computing Machinery, editor, Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989.

    Google Scholar 

  9. Y. Takayama, Extraction of Redundancy-free Programs from Constructive Natural Deduction Proofs, Journal of Symbolic Computation, 1991, 12, 29–69.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Logique Mathématique, Paris VII University, France

    Philippe Curmin

Authors
  1. Philippe Curmin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stefano Berardi Mario Coppo

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Curmin, P. (1996). First order marked types. In: Berardi, S., Coppo, M. (eds) Types for Proofs and Programs. TYPES 1995. Lecture Notes in Computer Science, vol 1158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61780-9_65

Download citation

  • DOI: https://doi.org/10.1007/3-540-61780-9_65

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61780-8

  • Online ISBN: 978-3-540-70722-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation