Kenta Cho, Bart Jacobs, Bas Westerbaan & Abraham Westerbaan (2015):
An Introduction to Effectus Theory.
arXiv:1512.05813 [quant-ph].
Bob Coecke (2010):
Quantum Picturalism.
Contemporary Physics 51(1),
pp. 59–83,
doi:10.1080/00107510903257624.
Antonin Delpeuch & Jamie Vicary (2018):
Normalization for Planar String Diagrams and a Quadratic Equivalence Algorithm.
arXiv:1804.07832 [cs].
N. Halbwachs, P. Caspi, P. Raymond & D. Pilaud (1991):
The Synchronous Data Flow Programming Language LUSTRE.
Proceedings of the IEEE 79(9),
pp. 1305–1320,
doi:10.1109/5.97300.
Thomas T. Hildebrandt, Prakash Panangaden & Glynn Winskel (2004):
A Relational Model of Non-Deterministic Dataflow.
Mathematical Structures in Computer Science 14(5),
pp. 613–649,
doi:10.1017/S0960129504004293.
David Huynh, Tom Morris, Stefano Mazzocchi, Iain Sproat, Martin Magdinier, Thad Guidry, Jesus M. Castagnetto, James Home, Cora Johnson-Roberson, Will Moffat, Pablo Moyano, David Leoni, Peilonghui, Rudy Alvarez, Vishal Talwar, Scott Wiedemann, Mateja Verlic, Antonin Delpeuch, Shixiong Zhu, Charles Pritchard, Ankit Sardesai, Gideon Thomas, Daniel Berthereau & Andreas Kohn (2019):
OpenRefine,
doi:10.5281/zenodo.595996.
Gilles Kahn (1974):
The Semantics of a Simple Language for Parallel Programming.
Information processing 74,
pp. 471–475.
K. M. Kavi, B. P. Buckles & U. N. Bhat (1987):
Isomorphisms Between Petri Nets and Dataflow Graphs.
IEEE Transactions on Software Engineering SE-13(10),
pp. 1127–1134,
doi:10.1109/TSE.1987.232854.
José Meseguer, Ugo Montanari & Vladimiro Sassone (1992):
On the Semantics of Petri Nets.
In: W.R. Cleaveland: CONCUR '92 630.
Springer Berlin Heidelberg,
pp. 286–301,
doi:10.1007/BFb0084798.
Carl Adam Petri (1966):
Communication with Automata,
pp. 97.
Vaughn Pratt (1991):
Modeling Concurrency with Geometry.
In: Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '91.
ACM Press,
Orlando, Florida, United States,
pp. 311–322,
doi:10.1145/99583.99625.
P. Selinger (2010):
A Survey of Graphical Languages for Monoidal Categories.
In: Bob Coecke: New Structures for Physics,
Lecture Notes in Physics 813.
Springer Berlin Heidelberg,
pp. 289–355,
doi:10.1007/978-3-642-12821-9_4.
Eugene W. Stark (1991):
Dataflow Networks Are Fibrations,
doi:10.1007/BFb0013470.
In: David H. Pitt, Pierre-Louis Curien, Samson Abramsky, Andrew M. Pitts, Axel Poigné & David E. Rydeheard: Category Theory and Computer Science,
Lecture Notes in Computer Science.
Springer Berlin Heidelberg,
pp. 261–281.
Edward Walker, Weijia Xu & Vinoth Chandar (2009):
Composing and Executing Parallel Data-Flow Graphs with Shell Pipes.
In: Proceedings of the 4th Workshop on Workflows in Support of Large-Scale Science - WORKS '09.
ACM Press,
Portland, Oregon,
pp. 1–10,
doi:10.1145/1645164.1645175.
eptcs@eptcs.org