scientific article; zbMATH DE number 3566181
From MaRDI portal
Publication:4138147
zbMATH Open0363.68076MaRDI QIDQ4138147FDOQ4138147
Authors: G. Kahn, David MacQueen 
Publication date: 1977
Title of this publication is not available (Why is that?)
Cited In (38)
- Compiling process networks to interaction nets
- Specification and top-down design of distributed systems
- Using fixed-point semantics to prove retiming lemmas
- Turing machines, transition systems, and interaction
- Computing with infinite objects
- A denotational theory of synchronous reactive systems
- Defining concurrent processes constructively
- A refinement of strong sequentiality for term rewriting with constructors
- Turing machines, transition systems, and interaction
- Sequential algorithms on concrete data structures
- The origins of structural operational semantics
- Asynchronous sequential processes
- Retracing CSP
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
- A theory for nondeterminism, parallelism, communication, and concurrency
- Modeling concurrency with partial orders
- Linear dynamic Kahn networks are deterministic
- A buffer minimization problem for the design of embedded systems
- DTL: A language for the design and implementation of concurrent programs as structured networks
- Semantic Foundations for Deterministic Dataflow and Stream Processing
- The equational theory of pomsets
- Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin
- A generalized Kahn Principle for abstract asynchronous networks
- Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable
- To be or not to be …lazy (In a Parallel Context)
- Monoidal streams for dataflow programming
- Towards a theory of parallel algorithms on concrete data structures
- A model and temporal proof system for networks of processes
- Full abstraction and the Context Lemma (preliminary report)
- Specification and verification of concurrent systems by causality and realizability
- An application of co-inductive types in Coq: verification of the alternating bit protocol
- Concurrent transition systems
- Compositional relational semantics for indeterminate dataflow networks
- Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog
- Algebraic specification of reactive systems
- Programming with streams in Coq a case study: The Sieve of Eratosthenes
- Graph-based communication in Eden
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4138147)
