Skip to main content

On Stratified Regions

  • Conference paper

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

Abstract

Type and effect systems are a tool to analyse statically the behaviour of programs with effects. We present a proof based on the so called reducibility candidates that a suitable stratification of the type and effect system entails the termination of the typable programs. The proof technique covers a simply typed, multi-threaded, call-by-value lambda-calculus, equipped with a variety of scheduling (preemptive, cooperative) and interaction mechanisms (references, channels, signals).

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

Buying options

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. Amadio, R.: On stratified regions. Report ArXiv:0904.2076

    Google Scholar 

  2. Amadio, R., Curien, P.-L.: Domains and Lambda Calculi. Cambridge University Press, Cambridge

    Google Scholar 

  3. Amadio, R., Dabrowski, F.: Feasible reactivity in a synchronous π-calculus. In: Proc. ACM Principles and Practice of Declarative Programming, pp. 221–230 (2007)

    Google Scholar 

  4. Boudol, G.: Typing termination in a higher-order concurrent imperative language. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 272–286. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Berry, G., Gonthier, G.: The Esterel synchronous programming language. Science of computer programming 19(2), 87–152 (1992)

    Article  MATH  Google Scholar 

  6. Deng, Y., Sangiorgi, D.: Ensuring termination by typability. Information and Computation 204(7), 1045–1082 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Gallier, J.: On Girard’s Candidats de Reductibilité. In: Odifreddi (ed.) Logic and Computer Science, pp. 123–203. Academic Press, London (1990)

    Google Scholar 

  8. Hennessy, M., Regan, T.: A process algebra of timed systems. Information and Computation 117(2), 221–239 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  9. Lucassen, J., Gifford, D.: Polymorphic effect systems. In: Proc. ACM-POPL (1988)

    Google Scholar 

  10. Sangiorgi, D.: Termination of processes. Math. Struct. in Comp. Sci. 16, 1–39 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Tofte, M., Talpin, J.-P.: Region-based memory management. Information and Computation 132(2), 109–176 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  12. Yoshida, N., Berger, M., Honda, K.: Strong normalisation in the π-calculus. Information and Computation 191(2), 145–202 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amadio, R.M. (2009). On Stratified Regions. In: Hu, Z. (eds) Programming Languages and Systems. APLAS 2009. Lecture Notes in Computer Science, vol 5904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10672-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10672-9_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10671-2

  • Online ISBN: 978-3-642-10672-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics