Skip to main content
SpringerLink
Log in
Book cover

International Conference on Typed Lambda Calculi and Applications

TLCA 2011: Typed Lambda Calculi and Applications pp 123–137Cite as

Controlling Program Extraction in Light Logics

  • Conference paper

  • 620 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6690))

Abstract

We present two refinements, based on program extraction in elementary affine logic and light affine logic, of Krivine & Leivant’s system FA2. This system allows higher-order equations to specify the computational content of extracted programs. The user can then prove a generic formula, using these equations as axioms. The system guarantees that the extracted program satisfies the specification and is computable in elementary time (for elementary affine logic) or polynomial time (for light affine logic). Finally, we show that both systems are complete with respect to elementary time and polynomial time functions.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asperti, A., Roversi, L.: Intuitionistic Light Affine Logic. ACM Trans. Comput. Log. 3(1), 137–175 (2002)

    Article  Google Scholar 

  2. Baillot, P.: Type inference for light affine logic via constraints on words. Theoretical Computer Science 328, 289–323 (2004)

    Article  MATH  Google Scholar 

  3. Bernardy, J.-P., Lasson, M.: Realizability and parametricity in pure type systems. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 108–122. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Danos, V., Joinet, J.B.: Linear Logic & Elementary Time. Information and Computation 183 (2001)

    Google Scholar 

  5. Girard, J.Y.: Light Linear Logic. Information and Computation 143(2), 175–204 (1998)

    Article  MATH  Google Scholar 

  6. Krivine, J.L.: Lambda-calculus, types and models. Ellis Horwood, England (1993)

    MATH  Google Scholar 

  7. Krivine, J.L., Parigot, M.: Programming with Proofs. Elektronische Informationsverarbeitung und Kybernetik 26(3), 149–167 (1990)

    MATH  Google Scholar 

  8. Leivant, D.: Reasoning about Functional Programs and Complexity Classes Associated with Type Disciplines. In: FOCS, pp. 460–469. IEEE, Los Alamitos (1983)

    Google Scholar 

  9. Martini, S., Coppola, P.: Typing lambda terms in elementary logic with linear constraints. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 76–90. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Plotkin, G.D., Abadi, M., Cardelli, L.: Subtyping and parametricity. In: LICS, pp. 310–319. IEEE Computer Society, Los Alamitos (1994)

    Google Scholar 

  11. Rose, H.: Sub-recursion: functions and hierarchy. Oxford University Press, Oxford (1984)

    Google Scholar 

  12. Takeuti, I.: An Axiomatic System of Parametricity. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol. 1210, pp. 354–372. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  13. Wadler, P.: The Girard-Reynolds isomorphism (second edition). Theor. Comput. Sci. 375(1-3), 201–226 (2007)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ENS Lyon, Université de Lyon, LIP, France

    Marc Lasson

Authors
  1. Marc Lasson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Laboratory, Oxford University, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Luke Ong

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lasson, M. (2011). Controlling Program Extraction in Light Logics. In: Ong, L. (eds) Typed Lambda Calculi and Applications. TLCA 2011. Lecture Notes in Computer Science, vol 6690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21691-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21691-6_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21690-9

  • Online ISBN: 978-3-642-21691-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation