|
Vol: 4(4) No: 1 / March 1994 Dataflow Semantics in NPL Eneia Todoran Department of Computer Engineering, Tehnical University of Cluj-Napoca, 26 Baritiu Street, Cluj-Napoca, Romania Keywords: NPL, dataflow mechanism Abstract The dataflow mechanism in NPL provides a better connection between data and processes. The Lisp. Evaluator is extended to deal witch unbound variables. The data flow programming in NPL is based on mechanisms for suspension and matching and on the mechanism for the transmission of the parameters by reference in NPL. Suspension may be dealt with at the data level if is it used a parallel evaluation model for the expressions over the data algebra. We thus build a special parallel Lisp for NPL. References [1] J. W. de Bakker, Processes and the denotational semantics of concurrency. Inform and Control 54 (1982). [2] J. W. de Bakker. Mathematical Theory of Program Corectness, Prentice-Hall International, (1980). [3] J. A. Bergstra, J. W. Klop. Algebra of Comunicating Processes. Proc. CWI Symp. Math and Comp. Sci., North-Holland,(1986). [4] G.L. Burn. Derving a Parallel Evalution Model for Lazy Functional Languages Using Abstract Interpretation, in “Languages for Parallel Arhitectures: Design, Semantics, Implementation Models”, ed. By. J. W. de Bakker, (1989). [5] T. Conloa, Programming in Parlog. Addison Wesley Publishing Company, (1989). [6] E. J. Dijkstra A Discipline of Programming, Prentice-Hill, (1976). [7] J. Mesegner, Conditional Rewriting Logic as a Unifield Model of Concurrency. TheoretichalComputer Science (19910. [8] E. Shapira. Concurent Prolog Collected Papers. MIT-Pree (1987). [9] G. L. Steele Jr. Et al. Common Lisp. Digital Press, (1994). [10] E. Todoran, A Process Algebra Language. The 9th Romanian Symposium on Computer Science, Iasi (1993). [11] E. Todoran, Limbajul NPL: Consideratii Operationale, si Exemple de Programare. (in Romanian). The annual session of communications of the Romanian Society for Informatics, Bucharest (1994). |