Skip to main content
SpringerLink
Log in

Towards a Substrate Framework of Computation

  • Chapter
Concurrent Objects and Beyond

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

Abstract

A grand challenge in computing is to establish a substrate computational model that encompasses diverse forms of non-sequential computation. This paper demonstrates how a hypergraph rewriting framework nicely integrates various forms and ingredients of concurrent computation and how simple static analyses help the understanding and optimization of programs. Hypergraph rewriting treats processes and messages in a unified manner, and treats message sending and parameter passing as symmetric reaction between two entities. Specifically, we show how fine-grained strong reduction of the λ-calculus can be concisely encoded into hypergraph rewriting with a small set of primitive operations.

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. van der Aalst, W., Stahl, C.: Modeling Business Processes: A Petri Net-Oriented Approach. The MIT Press, Cambridge (2011)

    MATH  Google Scholar 

  2. Abadi, M., Cardelli, L., Curien, P.-L., Lévy, J.-J.: Explicit Substitutions. Journal of Functional Programming 1(4), 375–416 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  3. Boyland, J.: Checking Interference with Fractional Permissions. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 55–72. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Curien, P.-L., Hardin, T., Lévy, J.-J.: Confluence Properties of Weak and Strong Calculi of Explicit Substitutions. J. ACM 43(2), 362–397 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Finkel, A.: The Minimal Coverability Graph for Petri Nets. In: Rozenberg, G. (ed.) APN 1993. LNCS, vol. 674, pp. 210–243. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  6. Frühwirth, T.: Constraint Handling Rules. Cambridge University Press, Cambridge (2009)

    Book  MATH  Google Scholar 

  7. Gallo, G., Longo, G., Pallottino, S., Nguyen, S.: Directed Hypergraphs and Applications. Discrete Applied Mathematics 42(2-3), 177–201 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lafont, Y.: Interaction Nets. In: Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages (POPL 1990), pp. 95–108. ACM (1990)

    Google Scholar 

  9. Lamping, J.: An Algorithm for Optimal Lambda-Calculus Reductions. In: Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages (POPL 1990), pp. 16–30. ACM (1990)

    Google Scholar 

  10. Lang, F.: Modèles de la β-réduction pour les implantations. Ph.D. Thesis, Ècole Normale Supérieure de Lyon (1998)

    Google Scholar 

  11. Mackie, I.: YALE: Yet Another Lambda Evaluator Based on Interaction Nets. In: Proc. Third ACM SIGPLAN International Conference on Functional Programming (ICFP 1998), pp. 117–128. ACM (1998)

    Google Scholar 

  12. Mackie, I.: Efficient λ-Evaluation with Interaction Nets. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 155–169. Springer, Heidelberg (2004)

    Google Scholar 

  13. Melliès, P.-A.: Typed λ-Calculi with Explicit Substitutions Not Terminate. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol. 902, pp. 328–334. Springer, Heidelberg (1995)

    Google Scholar 

  14. Milner, R.: The Space and Motion of Communicating Agents. Cambridge University Press, Cambridge (2009)

    Google Scholar 

  15. Reynier, P.-A., Servais, F.: Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol. 6709, pp. 69–88. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  16. Shapiro, E.Y., Warren, D.H.D., Fuchi, K., Kowalski, R.A., Furukawa, K., Ueda, K., Kahn, K.M., Chikayama, T., Tick, E.: The Fifth Generation Project: Personal Perspectives. Comm. ACM 36(3), 46–103 (1993), (This is actually a collection of single-authored articles, and my article (pp. 65–76) was originally titled “Kernel Language in the Fifth Generation Computer Project”)

    Google Scholar 

  17. Shapiro, E., Takeuchi, A.: Object oriented programming in Concurrent Prolog. New Generation Computing 1(1), 25–48 (1983)

    Article  Google Scholar 

  18. Sinot, F.-R.: Call-by-Name and Call-by-Value as Token-Passing Interaction Nets. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 386–400. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  19. Suenaga, K., Kobayashi, N.: Fractional Ownerships for Safe Memory Deallocation. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol. 5904, pp. 128–143. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  20. Ueda, K., Morita, M.: Moded Flat GHC and Its Message-Oriented Implementation Technique. New Generation Computing 13(1), 3–43 (1994)

    Article  Google Scholar 

  21. Ueda, K.: Resource-Passing Concurrent Programming. In: Kobayashi, N., Babu, C. S. (eds.) TACS 2001. LNCS, vol. 2215, pp. 95–126. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  22. Ueda, K., Kato, N.: LMNtal: A Language Model with Links and Membranes. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 110–125. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  23. Ueda, K.: LMNtal as a Hierarchical Logic Programming Language. Theoretical Computer Science 410(46), 4784–4800 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  24. Ueda, K.: Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 392–408. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  25. Ueda, K., Ayano, T., Hori, T., Iwasawa, H., Ogawa, S.: Hierarchical Graph Rewriting as a Unifying Tool for Analyzing and Understanding Nondeterministic Systems. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol. 5684, pp. 349–355. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  26. Ueda, K., Ogawa, S.: HyperLMNtal: An Extension of a Hierarchical Graph Rewriting Model. Künstliche Intelligenz 26(1), 27–36 (2012), doi:10.1007/s13218-011-0162-3

    Article  Google Scholar 

  27. Ueda, K.: Encoding Distributed Process Calculi into LMNtal. Electronic Notes in Theoretical Computer Science 209, 187–200 (2008)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Waseda University, 3-4-1, Okubo, Shinjuku-ku, Tokyo, 169-8555, Japan

    Kazunori Ueda

Authors
  1. Kazunori Ueda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, USA

    Gul Agha

  2. Department of Communications and Computer Engineering, Graduate School of Informatics, Kyoto University, Kyoto, Japan

    Atsushi Igarashi

  3. Department of Computer Science, The University of Tokyo, Tokyo, Japan

    Naoki Kobayashi

  4. Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan

    Hidehiko Masuhara

  5. Global Scientific Information and Computing Center, Tokyo Institute of Technology, Tokyo, Japan

    Satoshi Matsuoka

  6. Information Technology Center, The University of Tokyo, Tokyo, Japan

    Etsuya Shibayama

  7. Graduate School of Information Science and Technology, Department of Information and Communication Engineering, The University of Tokyo, Tokyo, Japan

    Kenjiro Taura

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ueda, K. (2014). Towards a Substrate Framework of Computation. In: Agha, G., et al. Concurrent Objects and Beyond. Lecture Notes in Computer Science, vol 8665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44471-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44471-9_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44470-2

  • Online ISBN: 978-3-662-44471-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation