Lucid
From MaRDI portal
swMATH21485MaRDI QIDQ33292FDOQ33292
Author name not available (Why is that?)
Official website: https://en.wikipedia.org/wiki/Lucid_(programming_language)
Cited In (47)
- Temporal logic programming
- Multi-dimensional logic programming: theoretical foundations
- Application of modal logic to programming
- A denotational theory of synchronous reactive systems
- Concrete domains
- Title not available (Why is that?)
- Dataflow analysis of array and scalar references
- Title not available (Why is that?)
- Comonadic notions of computation
- The semantics of dimensions as values
- An operator net model for distributed systems
- From Lucid to TransLucid: Iteration, dataflow, intensional and Cartesian programming
- Integrating Lucid's declarative dataflow paradigm into object-orientation
- An extensional treatment of dataflow deadlock
- Asynchronous stream processing with S-Net
- An extensional treatment of lazy data flow deadlock
- Design and correctness of a compiler for a non-procedural language
- A new notation for arrows
- A functional logic for higher level reasoning about computation
- A generalized Kahn Principle for abstract asynchronous networks
- CACTUS
- SIGNAL
- Agapia
- LUSTRE
- Fudgets
- Sisal
- Yampa
- Functional reactive animation
- Qu-Prolog
- ActiveVRML
- Hugs
- TBAG
- TransLucid
- PipLib
- Title not available (Why is that?)
- Connectedness and synchronization
- Clocks in dataflow languages
- Applications of coarse-grained dataflow in computational mechanis
- Specification and design of shared resource arbitration
- DisCoPy
- Causal commutative arrows
- The nature of the extended analog computer
- Title not available (Why is that?)
- Stratified negation in temporal logic programming and the cycle-sum test
- A functional model for describing and reasoning about time behaviour of computing systems
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- Constraint nets: a semantic model for hybrid dynamic systems
This page was built for software: Lucid
