Concurrent Clean

Nöcker, Eric; Smetsers, J.E.W.; Eekelen, M.C.J.D. van; Plasmeijer, M.J.

doi:10.1007/978-3-662-25209-3_39

Cited by 29 publications

(11 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sisal [39], NESL [40], Concurrent Clean [41], Id [42], or Paralation Lisp [43]), Clayman's criticisms do still apply to some extent in a general setting, however. Despite the fact that many parallel implementations of functional languages have been produced, there are relatively few systems that have been developed beyond the prototype stage, and fewer that can also claim to demonstrate architecture independence.…”

Section: Related Workmentioning

confidence: 97%

Engineering parallel symbolic programs in GPH

Loidl

Trinder

Hammond

et al. 1999

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 97%

Engineering parallel symbolic programs in GPH

Loidl

Trinder

Hammond

et al. 1999

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

“…Concurrent Clean [5], [13], [17] is a lazy functional programming language based on Term Graph Rewriting [4]. Here is an example of a Clean function defining the well-known fibonacci function.…”

Section: Concurrent Cleanmentioning

confidence: 99%

“…For one reason this is caused by the fact that only recently functional programs have gained execution speeds comparable to their imperative rivals [13], [18], [8]. Another important reason is that functional programming defected on performing input output (I/O hereafter) with the outer world.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper we present Clean's Event I/O, a new solution for the I/O problem that has been implemented in the lazy functional graph rewriting language Concurrent Clean [5], [13], [17] developed at the University of Nijmegen. This solution not only deals with the problems mentioned above but it also allows the specification of complicated window based I/O on a very high-level of abstraction.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

High Level Specification of I/O in Functional Languages

Achten

Groningen

Plasmeijer

1993

Functional Programming, Glasgow 1992

View full text Add to dashboard Cite

show abstract

“…For this reason, the designers of programming languages have developed mechanisms to give the user more flexible control of the program execution. For instance, syntactic annotations (which are associated to arguments of symbols) have been used in programming languages such as Clean [57] [24], etc. to improve the termination and efficiency of computations.…”

Section: Introductionmentioning

confidence: 99%

Towards a Framework for Proving Termination of Maude Programs

Jiménez¹

View full text Add to dashboard Cite

Españato Bienve, responsible for my happiness. AcknowledgmentsI would like to thank Salvador Lucas, my scientific father, for being a good advisor, not only for this thesis but also about life. He was often very strict, but just did what any good father would do. He has helped me appreciate the satisfaction of doing things well.I would also like to thank María Alpuente for giving me the first opportunity to join the elp family. It has been a pleasure to share these five years with all of them and the mist group: Toni, Tama, Raúl, Rafa, Josep, Gustavo, Mauricio, Diego, Alexei, Sonia, Marco, Dani, Pepe, Nando, Alicia, Germán, Cesar, Santi, Jose, María José, . . . and those that came only for a few months and gained a place in my heart: Vesna, Michele and Patricia.Special mention goes to those that were not just workmates but also friends: Cesar (little bird) is the most incredible person I have met here, only he knows how much I owe him. Toni is the best lab mate ever. We have walked together from the beginning and we have shared many good moments. Tama, my spoiled child, I can only wish him all the best in the life, he certainly deserves it.Many thanks to my coauthors, especially to Raúl, for all his help and support. I am proud of the great work that we have done together. It has been a pleasure having such a good companion along this difficult path. Thanks to Rafa for always having a nice word to say and making me laugh.I would also like to thank all the people that I met around the world and allowed me to learn from them. These include Jürgen Giesl and the group at the RWTH Aachen: Carsten, Peter, Stephan, Ivan, René,. . . ; and José Meseguer and the group at UIUC that made me feel at home: Camilo, Ralf, Edgar,. . . and specially Mike.Special thanks go to my parents and brothers. I know you will never understand a word of this thesis, but you have always supported me in any decision I have made. AbstractMaude is a declarative programming language based on rewriting logic that incorporates many features that in order to prove certain computational properties lead to difficulties. The task of proving termination of rewrite systems in indeed quite hard but applied to real programming languages, becomes more complicated due to these inherent features. Therefore, methods for proving termination of such programs require specific techniques and a careful analysis. Several papers have studied how to prove termination of (a subset of) Maude programs. However, all of them follow a transformational approach where the original program is transformed until it reaches a rewrite system that can be managed with existing techniques and termination tools. In practice, the fact of transforming the original systems used to complicate the proof of termination since it introduces new symbols and rules in the system. In this thesis, we tackle the problem of proving termination of (a subset of) Maude programs by means of direct methods.On the one hand, we pay attention to the strategy of Maude. Maude is an eager language where the a...

show abstract

Concurrent Clean

Cited by 29 publications

References 5 publications

Engineering parallel symbolic programs in GPH

Engineering parallel symbolic programs in GPH

High Level Specification of I/O in Functional Languages

Towards a Framework for Proving Termination of Maude Programs

Contact Info

Product

Resources

About