Functional Nets

Functional nets combine key ideas of functional programming and Petri nets to yield a simple and general programming notation. They have their theoretical foundation in Join calculus. This paper presents functional nets, reviews Join calculus, and shows how the two relate.

[1]  Gérard Boudol.  Towards a Lambda-Calculus for Concurrent and Communicating Systems , 1989, TAPSOFT, Vol.1.

[2]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[3]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[4]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[5]  Gérard Boudol.  The π-calculus in direct style , 1997, POPL '97.

[6]  Gert Smolka,et al.  Object-Oriented Concurrent Constraint Programming in Oz , 1993, KI.

[7]  Amr Sabry,et al.  Correctness of monadic state: an imperative call-by-need calculus , 1998, POPL '98.

[8]  Nobuko Yoshida,et al.  On Reduction-Based Process Semantics , 1995, Theor. Comput. Sci..

[9]  A. Church.  The calculi of lambda-conversion , 1941 .

[10]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[11]  John H. Reppy,et al.  CML: A Higher-Order Concurrent Language , 1991, PLDI.

[12]  Cédric Fournet,et al.  The reflexive CHAM and the join-calculus , 1996, POPL '96.

[13]  P. J. Landin,et al.  The next 700 programming languages , 1966, CACM.

[14]  A. Church.  The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies) , 1985 .

[15]  John McCarthy,et al.  LISP 1.5 Programmer's Manual , 1962 .

[16]  Per Brinch Hansen,et al.  Structured multiprogramming , 1972, CACM.

[17]  Paul Hudak,et al.  Call by name, assignment, and the lambda calculus , 1993, POPL '93.

[18]  Ugo de'Liguoro,et al.  Non Deterministic Extensions of Untyped Lambda-Calculus , 1995, Inf. Comput..

[19]  Vipin Swarup,et al.  Assignments for Applicative Languages , 1991, FPCA.

[20]  C. Petri.  Kommunikation mit Automaten , 1962 .

[21]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[22]  Benjamin C. Pierce,et al.  Pict: a programming language based on the Pi-Calculus , 2000, Proof, Language, and Interaction.

[23]  Matthias Felleisen,et al.  Parameter-passing and the lambda calculus , 1991, POPL '91.

[24]  John H. Reppy,et al.  CML: A higher concurrent language , 1991, PLDI '91.

[25]  Oscar Nierstrasz,et al.  Piccola - A Small Composition Language , 1999, ECOOP Workshops.

[26]  Robert Hieb,et al.  The Revised Report on the Syntactic Theories of Sequential Control and State , 1992, Theor. Comput. Sci..

[27]  Oscar Nierstrasz,et al.  APPLICATIONS = COMPONENTS + SCRIPTS A tour of Piccola , 2001 .

[28]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[29]  Ugo de'Liguoro,et al.  Non deterministic extensions of untyped-calculus , 1995 .

[30]  Carolyn L. Talcott,et al.  A foundation for actor computation , 1997, Journal of Functional Programming.

[31]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

[32]  Gérard Boudol,et al.  Asynchrony and the Pi-calculus , 1992 .

[33]  C. A. R. Hoare,et al.  Monitors: an operating system structuring concept , 1974, CACM.

[34]  Kurt Jensen.  Coloured Petri Nets , 1992, EATCS Monographs in Theoretical Computer Science.

[35]  Amr Sabry,et al.  Reasoning about Explicit and Implicit Representations of State , 1993 .