Skip to main content
Springer Nature Link
Log in

Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk)

  • Conference paper
Rewriting and Typed Lambda Calculi (RTA 2014, TLCA 2014)

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

  • 750 Accesses

Abstract

The focus will be a presentation of new results and successes of semantic analyses of concurrent programs. These are accomplished by contextual equivalence, observing may- and should-convergence, and by adapting known techniques from deterministic programs to non-determinism and concurrency. The techniques are context lemmata, diagram techniques, applicative similarities, infinite tree reductions, and translations. The results are equivalences, correctness of program transformations, correctness of implementations and translations.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Abramsky, S.: The lazy lambda calculus. In: Turner, D.A. (ed.) Research Topics in Functional Programming, pp. 65–116. Addison-Wesley (1990)

    Google Scholar 

  2. Aprove-team: AProVE website (2014), http://aprove.informatik.rwth-aachen.de

  3. Bird, R.: Pearls of Functional Algorithm Design. Cambridge University Press, Cambridge (2010)

    Google Scholar 

  4. Bird, R.S., De Moor, O.: Algebra of Programming. International Series in Computer Science, vol. 100. Prentice Hall (1997)

    Google Scholar 

  5. Gill, A.: Cheap Deforestation for Non-strict Functional Languages. PhD thesis, Glasgow University, Department of Computing Science (1996)

    Google Scholar 

  6. Haskell-community: The Haskell Programming Language (2014), http://www.haskell.org/haskellwiki/Haskell

  7. Howe, D.: Equality in lazy computation systems. In: 4th IEEE Symp. on Logic in Computer Science, pp. 198–203 (1989)

    Google Scholar 

  8. Howe, D.: Proving congruence of bisimulation in functional programming languages. Inform. and Comput. 124(2), 103–112 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  9. Johann, P., Voigtländer, J.: The impact of seq on free theorems-based program transformations. Fundamenta Informaticae 69(1-2), 63–102 (2006)

    MATH  MathSciNet  Google Scholar 

  10. Jones, M.P.: Dictionary-free Overloading by PaRTIAL Evaluation. In: Partial Evaluation and Semantics-Based Program Manipulation, Orlando, Florida, pp. 107–117. Technical Report 94/9, Department of Computer Science, University of Melbourne (June 1994)

    Google Scholar 

  11. Jones, N.D.: An introduction to partial evaluation. ACM Comput. Surv. 28(3), 480–503 (1996)

    Article  Google Scholar 

  12. Mason, I., Smith, S.F., Talcott, C.L.: From operational semantics to domain theory. Inform. and Comput. 128, 26–47 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  13. McCarthy, J.: A Basis for a Mathematical Theory of Computation. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, pp. 33–70. North-Holland, Amsterdam (1963)

    Chapter  Google Scholar 

  14. Milner, R.: Fully abstract models of typed λ-calculi. Theoret. Comput. Sci. 4, 1–22 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  15. Milner, R.: Functions as processes. Mathematical Structures in Computer Science 2(2), 119–141 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  16. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, i & ii. Inform. and Comput. 100(1), 1–77 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  17. Morris, J.: Lambda-Calculus Models of Programming Languages. PhD thesis, MIT (1968)

    Google Scholar 

  18. Peyton Jones, S., Partain, W., Santos, A.: Let-floating: moving bindings to give faster programs. In: Harper, R., Wexelblat, R.L. (eds.) Proceedings of the first ACM SIGPLAN International Conference on Functional Programming, pp. 1–12. ACM Press (1996)

    Google Scholar 

  19. Peyton Jones, S.L., Santos, A.L.M.: A transformation-based optimiser for Haskell. Science of Computer Programming 32(1-3), 3–47 (1998)

    Article  MATH  Google Scholar 

  20. Plotkin, G.D.: Call-by-name, call-by-value, and the lambda-calculus. Theoret. Comput. Sci. 1, 125–159 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  21. Rau, C.: Automatic correctness proofs of program transformations (2014) (thesis in preparation)

    Google Scholar 

  22. Rau, C., Sabel, D., Schmidt-Schauß, M.: Correctness of program transformations as a termination problem. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS, vol. 7364, pp. 462–476. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  23. Sabel, D., Schmidt-Schauß, M.: A call-by-need lambda-calculus with locally bottom-avoiding choice: Context lemma and correctness of transformations. Math. Structures Comput. Sci. 18(3), 501–553 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  24. Sabel, D., Schmidt-Schauß, M.: A contextual semantics for Concurrent Haskell with futures. In: Schneider-Kamp, P., Hanus, M. (eds.) PPDP 2011, pp. 101–112. ACM, New York (2011)

    Google Scholar 

  25. Sabel, D., Schmidt-Schauß, M.: Conservative concurrency in Haskell. In: Dershowitz, N. (ed.) LICS, pp. 561–570. IEEE (2012)

    Google Scholar 

  26. Schmidt-Schauß, M., Niehren, J., Schwinghammer, J., Sabel, D.: Adequacy of compositional translations for observational semantics. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, C.H.L. (eds.) 5th IFIP TCS 2008. IFIP, vol. 273, pp. 521–535. Springer, Heidelberg (2008)

    Google Scholar 

  27. Schmidt-Schauß, M., Sabel, D.: On generic context lemmas for higher-order calculi with sharing. Theoret. Comput. Sci. 411(11-13), 1521–1541 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  28. Schmidt-Schauß, M., Sabel, D.: Correctness of an STM Haskell implementation. In: Morrisett, G., Uustalu, T. (eds.) Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming, ICFP 2013, pp. 161–172. ACM, New York (2013)

    Google Scholar 

  29. Schmidt-Schauß, M., Sabel, D., Machkasova, E.: Simulation in the call-by-need lambda-calculus with letrec. In: Lynch, C. (ed.) Proc. of 21st RTA 2010. LIPIcs, vol. 6, pp. 295–310. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)

    Google Scholar 

  30. Schmidt-Schauß, M., Sabel, D., Schütz, M.: Deciding inclusion of set constants over infinite non-strict data structures. RAIRO-Theoretical Informatics and Applications 41(2), 225–241 (2007)

    Article  MATH  Google Scholar 

  31. Schmidt-Schauß, M., Schütz, M., Sabel, D.: Safety of Nöcker’s strictness analysis. J. Funct. Programming 18(4), 503–551 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  32. Schwinghammer, J., Sabel, D., Schmidt-Schauß, M., Niehren, J.: Correctly translating concurrency primitives. In: Rossberg, A. (ed.) ML 2009: Proceedings of the 2009 ACM SIGPLAN Workshop on ML, pp. 27–38. ACM, New York (2009)

    Google Scholar 

  33. Sculthorpe, N., Farmer, A., Gill, A.: The HERMIT in the tree - mechanizing program transformations in the GHC core language. In: Hinze, R. (ed.) IFL 2012. LNCS, vol. 8241, pp. 86–103. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Goethe University, Frankfurt, Germany

    Manfred Schmidt-Schauß

Authors
  1. Manfred Schmidt-Schauß
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Inria, 23 avenue d’Italie, CS 81321, 75214, Paris Cedex 13, France

    Gilles Dowek

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Schmidt-Schauß, M. (2014). Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk). In: Dowek, G. (eds) Rewriting and Typed Lambda Calculi. RTA TLCA 2014 2014. Lecture Notes in Computer Science, vol 8560. Springer, Cham. https://doi.org/10.1007/978-3-319-08918-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08918-8_2

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08917-1

  • Online ISBN: 978-3-319-08918-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics