A generalized Kahn Principle for abstract asynchronous networks-Reference-Cited by-同舟云学术

A generalized Kahn Principle for abstract asynchronous networks

Published: Issue: Volume: Page:1-21
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Abramsky Samson

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0040252.pdf

Reference32 articles.

1. S. Abramsky. Reasoning about concurrent systems: a functional approach. In F. Chambers, D. Duce, and G. Jones, editors, Distributed Computing, volume 20 of APIC Studies in Data Processing, pages 307–319. Academic Press, 1984.

2. M. A. Arbib and E. Manes. Arrows, Structures and Functors: the Categorical Imperative. Academic Press, 1975.

3. J. D. Brock and W. B. Ackerman. Scenarios: a model of nondeterminate computation. In Formalization of Programming Concepts, pages 252–259. Springer-Verlag, 1981. Lecture Notes in Computer Science Vol. 107.

4. H. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition, 1984.

5. T. Coquand, C. Gunter, and G. Winskel. dI-domains as a model of polymorphism. In Third Workshop on the Mathematical Foundations of Programming Language Semantics, pages 344–363. Springer-Verlag, 1987.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fairness, Resources, and Separation;Electronic Notes in Theoretical Computer Science;2010-09

2. A relational model of non-deterministic dataflow;CONCUR'98 Concurrency Theory;1998

3. The expressive power of indeterminate primitives in asynchronous computation;Lecture Notes in Computer Science;1995

4. Causality and true concurrency: A data-flow analysis of the Pi-Calculus;Algebraic Methodology and Software Technology;1995

5. On nets, algebras and modularity;Lecture Notes in Computer Science;1991