A generalized Kahn Principle for abstract asynchronous networks

DOI10.1007/BFb0040252WikidataQ57006945 ScholiaQ57006945MaRDI QIDQ5887509

Samson Abramsky

Publication date: 12 April 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.0427

zbMATH Keywords

lambda calculuscompact elementfunctional nodenetwork compositionoperational semantic

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Fairness, Resources, and Separation, On schematological equivalence of partially interpreted dataflow networks, On nets, algebras and modularity, Causality and true concurrency: A data-flow analysis of the Pi-Calculus, Connectedness and synchronization, Non-interleaving Semantics with Causality for Nondeterministic Dataflow, Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin

Uses Software

• Lucid

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• What is a model of the lambda calculus?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item