Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 2006: Computer Science Logic pp 606–621Cite as

Space-Efficient Computation by Interaction

A Type System for Logarithmic Space

  • Conference paper

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

Abstract

We introduce a typed functional programming language for logarithmic space. Its type system is an annotated subsystem of Hofmann’s polytime LFPL. To guide the design of the programming language and to enable the proof of logspace-soundness, we introduce a realisability model over a variant of the Geometry of Interaction. This realisability model, which takes inspiration from Møller-Neergaard and Mairson’s work on BC \(^{\rm --}_{\epsilon}\), provides a general framework for modelling space-restricted computation.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Abramsky, S., Ghica, D.R., Murawski, A.S., Ong, C.-H.L.: Applying game semantics to compositional software modeling and verification. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 421–435. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Abramsky, S., Haghverdi, E., Scott, P.J.: Geometry of interaction and linear combinatory algebras. Mathematical Structures in Computer Science 12(5), 625–665 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Abramsky, S., Jagadeesan, R.: Games and full completeness for multiplicative linear logic (extended abstract). In: Shyamasundar, R.K. (ed.) FSTTCS 1992. LNCS, vol. 652, pp. 291–301. Springer, Heidelberg (1992)

    Google Scholar 

  4. Bellantoni, S.J.: Predicative Recursion and Computational Complexity. PhD thesis, University of Toronto (1992)

    Google Scholar 

  5. Dal Lago, U., Hofmann, M.: Quantitative models and implicit complexity. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 189–200. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Danos, V., Herbelin, H., Regnier, L.: Game semantics & abstract machines. In: LICS 1996, pp. 394–405 (1996)

    Google Scholar 

  7. Ghica, D.R., McCusker, G.: Reasoning about idealized algol using regular languages. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 103–115. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Hahgverdi, E.: A Categorical Approach to Linear Logic, Geometry of Proofs and Full Completeness. PhD thesis, University of Ottawa (2000)

    Google Scholar 

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

    Article  Google Scholar 

  10. Hofmann, M.: Semantics of linear/modal lambda calculus. Journal of Functional Programming 9(3), 247–277 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hofmann, M.: Programming languages capturing complexity classes. SIGACT News 31(1), 31–42 (2000)

    Article  Google Scholar 

  12. Hyland, J.M.E., Schalk, A.: Glueing and orthogonality for models of linear logic. Theoretical Computer Science 294(1–2), 183–231 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Jones, N.D.: logspace and ptime characterized by programming languages. Theoretical Computer Science 228(1–2), 151–174 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kristiansen, L.: Neat function algebraic characterizations of LOGSPACE andLINESPACE. Computational Complexity 14, 72–88 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  15. Longley, J.R.: Realizability Toposes and Language Semantics. PhD thesis, University of Edinburgh (1994)

    Google Scholar 

  16. Mackie, I.: The geometry of interaction machine. In: POPL 1995 (1995)

    Google Scholar 

  17. Møller-Neegaard, P.: Complexity Aspects of Programming Language Design. PhD thesis, Brandeis University (2004)

    Google Scholar 

  18. Neergaard, P.M.: A functional language for logarithmic space. In: Chin, W.-N. (ed.) APLAS 2004. LNCS, vol. 3302, pp. 311–326. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Sannella, D., Hofmann, M., Aspinall, D., Gilmore, S., Stark, I., Beringer, L., Loidl, H.-W., MacKenzie, K., Momigliano, A., Shkaravska, O.: Mobile Resource Guarantees. Trends in Functional Programing 6 (2005) Intellect

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ludwig-Maximilians-Universität München, Oettingenstraße 67, D-80538, München, Germany

    Ulrich Schöpp

Authors
  1. Ulrich Schöpp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

    Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schöpp, U. (2006). Space-Efficient Computation by Interaction. In: Ésik, Z. (eds) Computer Science Logic. CSL 2006. Lecture Notes in Computer Science, vol 4207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11874683_40

Download citation

  • DOI: https://doi.org/10.1007/11874683_40

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45459-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation