Lucid

Lucid, the dataflow programming language. Lucid is a programming language born in 1974. The authors’ intention was that Lucid make a new approach to programming, displacing the ordinary imperative languages and offering a language compatible with the technologies of the supercomputers. This language ought also to prove that more realistic applications could be programmed in the equational style. The approach to programming in such a way proved to be a new approach to computation itself - the dataflow approach. The dataflow approach to computation was developed by M. McIlroy, J. Dennis, G. Kahn, and others. While the fundamental concepts of the von Neumann computer architecture and imperative programming languages are those of ”command” and ”storage location”, the dataflow is based on the principle of processing the data while it is in motion through a dataflow network. A dataflow network is a system of nodes and processing stations connected by a number of communication channels or arcs. The processing stations may have more than one input and/or output port, they will not be connected sequentially (the network may even have loops in it). ..


References in zbMATH (referenced in 39 articles , 2 standard articles )

Showing results 1 to 20 of 39.
Sorted by year (citations)

1 2 next

  1. Beck, Jarryd P.; Plaice, John; Wadge, William W.: Multidimensional infinite data in the language Lucid (2015)
  2. Liu, Hai; Cheng, Eric; Hudak, Paul: Causal commutative arrows (2011)
  3. Grelck, Clemens; Scholz, Sven-Bodo; Shafarenko, Alex: Asynchronous stream processing with S-Net (2010)
  4. Dragoi, Cezara; Stefanescu, Gheorghe: AGAPIA v0.1: A programming language for interactive systems and its typing system (2008) ioport
  5. Mills, Jonathan W.: The nature of the extended analog computer (2008)
  6. Orchard, Dominic A.; Matthews, Steve: Integrating Lucid’s declarative dataflow paradigm into object-orientation (2008)
  7. Plaice, John; Mancilla, Blanca; Ditu, Gabriel: From Lucid to TransLucid: Iteration, dataflow, intensional and Cartesian programming (2008)
  8. Uustalu, Tarmo; Vene, Varmo: Comonadic notions of computation (2008)
  9. Colaço, Jean-Louis; Pouzet, Marc: Type-based initialization analysis of a synchronous dataflow language (2004) ioport
  10. Colaço, Jean-Louis; Pouzet, Marc: Type-based initialization analysis of a synchronous dataflow language (2004) ioport
  11. Colaço, Jean-Louis; Pouzet, Marc: Type-based initialization analysis of a synchronous dataflow language (2004) ioport
  12. Paterson, Ross: A new notation for arrows (2001)
  13. Rondogiannis, P.: Stratified negation in temporal logic programming and the cycle-sum test (2001)
  14. Paquet, Joey; Plaice, John: The semantics of dimensions as values (2000)
  15. Elliott, Conal; Hudak, Paul: Functional reactive animation (1997)
  16. Orgun, Mehmet A.; Du, Weichang: Multi-dimensional logic programming: theoretical foundations (1997)
  17. Matthews, S. G.: An extensional treatment of lazy data flow deadlock (1995)
  18. Zhang, Ying; Mackworth, Alan K.: Constraint nets: a semantic model for hybrid dynamic systems (1995)
  19. Staples, John; Robinson, Peter J.; Hazel, Daniel: A functional logic for higher level reasoning about computation (1994)
  20. Kahn, G.; Plotkin, G. D.: Concrete domains (1993)

1 2 next