×

Using Maude and its strategies for defining a framework for analyzing Eden semantics. (English) Zbl 1277.68104

Antoy, Sergio (ed.), Proceedings of the sixth international workshop on reduction strategies in rewriting and programming (WRS 2006), Seattle, WA, USA, August 11, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 174, No. 10, 119-137 (2007).
Summary: Eden is a parallel extension of the functional language Haskell. On behalf of parallelism Eden overrides Haskell’s pure lazy approach, combining a non-strict functional application with eager process creation and eager communication. We desire to investigate alternative semantics for Eden in order to analyze the consequences of some of the decisions adopted during the language design. In this paper we show how to implement in Maude the operational semantics of Eden in such a way that semantic rules can be modified easily. Moreover, other semantic features can be implemented by means of parameterized modules that allow to instantiate in different ways several parameters of the semantics but without modifying the semantic rules.
For the entire collection see [Zbl 1273.68012].

MSC:

68Q42 Grammars and rewriting systems
68N18 Functional programming and lambda calculus
68Q55 Semantics in the theory of computing

Software:

Haskell; GHC; Eden; Maude
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Baker-Finch, C.; King, D.; Trinder, P., An operational semantics for parallel lazy evaluation, (ACM-SIGPLAN International Conference on Functional Programming. ACM-SIGPLAN International Conference on Functional Programming, (ICFP’00) (2000)), 162-173 · Zbl 1321.68135
[2] Bouhoula, A.; Jouannaud, J.-P.; Meseguer, J., Specification and proof in membership equational logic, Theoretical Computer Science, 236, 35-132 (2000) · Zbl 0938.68057
[3] Clavel, M.; Durán, F.; Eker, S.; Lincoln, P.; Martí-Oliet, N.; Meseguer, J.; Talcott, C., Maude Manual (Version 2.2) (2005)
[4] Glasgow Haskell Compiler · Zbl 1037.68042
[5] M. Hidalgo-Herrero. Semánticas formales para un lenguaje funcional paralelo; M. Hidalgo-Herrero. Semánticas formales para un lenguaje funcional paralelo
[6] Hidalgo-Herrero, M.; Ortega-Mallén, Y., An operational semantics for the parallel language Eden, Parallel Processing Letters, 12, 2, 211-228 (2002)
[7] Hidalgo-Herrero, M.; Verdejo, A.; Ortega-Mallén, Y., Looking for Eden through Maude and its strategies (2006), Web page
[8] Klusik, U.; Ortega-Mallén, Y.; Peña, R., Implementing Eden - or: Dreams become reality, (Selected Papers 10th Int. Workshop on Implementation of Functional Languages. Selected Papers 10th Int. Workshop on Implementation of Functional Languages, (IFL’98). Selected Papers 10th Int. Workshop on Implementation of Functional Languages. Selected Papers 10th Int. Workshop on Implementation of Functional Languages, (IFL’98), LNCS, 1595 (1999), Springer), 103-119
[9] Launchbury, J., A natural semantics for lazy evaluation, (ACM Symposium on Principles of Programming Languages. ACM Symposium on Principles of Programming Languages, POPL’93 (1993), ACM Press), 144-154
[10] Loogen, R., Research Directions in Parallel Functional Programming, (Hammond, K.; Michaelson, G., Programming Language Constructs (1999), Springer), 63-92
[11] Loogen, R.; Ortega-Mallén, Y.; Peña-Marí, R., Parallel functional programming in Eden, Journal of Functional Programming, 15, 3, 431-445 (2005) · Zbl 1096.68018
[12] Martí-Oliet, N.; Meseguer, J., Rewriting logic as a logical and semantic framework, (Gabbay, D. M.; Guenthner, F., Handbook of Philosophical Logic, Second Edition, Volume 9 (2002), Kluwer), 1-87
[13] Martí-Oliet, N.; Meseguer, J.; Verdejo, A., Towards a strategy language for Maude, (Martí-Oliet, N., Proc. Fifth Int. Workshop on Rewriting Logic and its Applications. Proc. Fifth Int. Workshop on Rewriting Logic and its Applications, WRLA 2004. Proc. Fifth Int. Workshop on Rewriting Logic and its Applications. Proc. Fifth Int. Workshop on Rewriting Logic and its Applications, WRLA 2004, ENTCS, 117 (2004), Elsevier), 417-441
[14] Meseguer, J., Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science, 96, 1, 73-155 (1992) · Zbl 0758.68043
[15] Peyton Jones, S., Haskell 98 language and libraries: the Revised Report (2003), Cambridge University Press · Zbl 1067.68041
[16] Rosa-Velardo, F.; Segura, C.; Verdejo, A., Typed mobile ambients in Maude, (Cirstea, H.; Martí-Oliet, N., Proc. 6th Int. Workshop on Rule-Based Programming. Proc. 6th Int. Workshop on Rule-Based Programming, RULE 2005. Proc. 6th Int. Workshop on Rule-Based Programming. Proc. 6th Int. Workshop on Rule-Based Programming, RULE 2005, ENTCS, 147 (2006), Elsevier), 135-161 · Zbl 1276.68101
[17] F. Rubio. Programación funcional paralela eficiente en Eden; F. Rubio. Programación funcional paralela eficiente en Eden
[18] Verdejo, A.; Martí-Oliet, N., Implementing CCS in Maude 2, (Gadducci, F.; Montanari, U., Proc. Fourth Int. Workshop on Rewriting Logic and its Applications. Proc. Fourth Int. Workshop on Rewriting Logic and its Applications, WRLA 2002. Proc. Fourth Int. Workshop on Rewriting Logic and its Applications. Proc. Fourth Int. Workshop on Rewriting Logic and its Applications, WRLA 2002, ENTCS, 71 (2002), Elsevier), 239-257
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.