Skip to main content
SpringerLink
Log in

Indexed Realizability for Bounded-Time Programming with References and Type Fixpoints

  • Conference paper
Programming Languages and Systems (APLAS 2012)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7705))

Included in the following conference series:

Abstract

The field of implicit complexity has recently produced several bounded-complexity programming languages. This kind of language allows to implement exactly the functions belonging to a certain complexity class. We present a realizability semantics for a higher-order functional language based on a fragment of linear logic called LAL which characterizes the complexity class PTIME. This language features recursive types and higher-order store. Our realizability is based on biorthogonality, indexing and is quantitative. This last feature enables us not only to derive a semantical proof of termination, but also to give bounds on the number of computational steps of typed programs.

Work partially supported by the Future and Emerging Technologies (FET) programme within the Seventh Framework Programme for Research of the European Commission, under FET-Open grant number: 243881 (project CerCo).

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amadio, R.M.: On Stratified Regions. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol. 5904, pp. 210–225. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Appel, A.W., McAllester, D.: An indexed model of recursive types for foundational proof-carrying code. ACM Transactions on Programming Languages and Systems (TOPLAS) 23(5), 657–683 (2001)

    Article  Google Scholar 

  3. Asperti, A.: Light affine logic. In: Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, pp. 300–308 (1998)

    Google Scholar 

  4. Baillot, P.: Stratified coherence spaces: a denotational semantics for light linear logic. Theoretical Computer Science 318(1), 29–55 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Brunel, A.: Quantitative classical realizability (submitted, 2012)

    Google Scholar 

  6. Dal Lago, U., Martini, S., Sangiorgi, D.: Light logics and higher-order processes. Electronic Proceedings in Theoretical Computer Science 41 (2010)

    Google Scholar 

  7. Girard, J.-Y.: Light Linear Logic. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 145–176. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  8. Hofmann, M.: Linear types and non-size-increasing polynomial time computation. Information and Computation 183(1), 57–85 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Krivine, J-L.: Realizability in classical logic. Course notes of a series of lectures given in the University of Marseille (May 2004) (last revision: July 2005), Panoramas et syntheses, Société Mathéematique de France (2005)

    Google Scholar 

  10. Lafont, Y.: Soft linear logic and polynomial time. Theoretical Computer Science 318(1-2), 163–180 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Dal Lago, U., Hofmann, M.: Bounded Linear Logic, Revisited. In: Curien, P.-L. (ed.) TLCA 2009. LNCS, vol. 5608, pp. 80–94. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Dal Lago, U., Hofmann, M.: A semantic proof of polytime soundness of light affine logic. Theory of Computing Systems 46, 673–689 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  13. Dal Lago, U., Hofmann, M.: Realizability models and implicit complexity. Theoretical Computer Science 412(20), 2029–2047 (2011), Girard’s Festschrift

    Article  MathSciNet  MATH  Google Scholar 

  14. Lucassen, J.M., Gifford, D.K.: Polymorphic effect systems. In: Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1988, pp. 47–57. ACM, New York (1988)

    Chapter  Google Scholar 

  15. Madet, A., Amadio, R.M.: An Elementary Affine λ-Calculus with Multithreading and Side Effects. In: Ong, L. (ed.) TLCA 2011. LNCS, vol. 6690, pp. 138–152. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  16. Okada, M., Kanovich, M.I., Scedrov, A.: Phase semantics for light linear logic. Theoretical Computer Science 294(3), 525–549 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  17. Nakano, H.: A modality for recursion. In: Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, pp. 255–266. IEEE (2000)

    Google Scholar 

  18. Benton, N., Krishnaswami, N.R., Hoffmann, J.: Higher-order functional reactive programming in bounded space. In: Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 45–58. ACM (2012)

    Google Scholar 

  19. Baillot, P., Gaboardi, M., Mogbil, V.: A PolyTime Functional Language from Light Linear Logic. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 104–124. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  20. Terui, K.: Light affine lambda calculus and polynomial time strong normalization. Archive for Mathematical Logic 46(3-4), 253–280 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique de Paris-Nord, Université Paris 13, France

    Aloïs Brunel

  2. PPS, UMR 7126, CNRS, Univ Paris Diderot, Sorbonne Paris Cité, F-75205, Paris, France

    Antoine Madet

Authors
  1. Aloïs Brunel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antoine Madet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of California, San Diego, 9500 Gilman Drive, 92092-6237, La Jolla, CA, USA

    Ranjit Jhala

  2. Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, 606-8501, Sakyo-ku, Kyoto, Japan

    Atsushi Igarashi

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brunel, A., Madet, A. (2012). Indexed Realizability for Bounded-Time Programming with References and Type Fixpoints. In: Jhala, R., Igarashi, A. (eds) Programming Languages and Systems. APLAS 2012. Lecture Notes in Computer Science, vol 7705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35182-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35182-2_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35181-5

  • Online ISBN: 978-3-642-35182-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation