Pict is a language in the ML tradition, formed by adding a layer of convenient syntactic sugar and a static type system to a tiny core. The current release includes a Pict-to-C compiler, reference manual, language tutorial, numerous libraries, and example programs. The core language - an asynchronous variant of Milner, Parrow, and Walker’s pi-calculus - has been used as a theoretical foundation for a broad class of concurrent computations. The goal in Pict is to identify high-level idioms that arise naturally when these primitives are used to build working programs - idioms such as basic data structures, protocols for returning results, higher-order programming, selective communication, and concurrent objects. The type system integrates a number of features found in recent work on theoretical foundations for typed object-oriented languages.

References in zbMATH (referenced in 62 articles )

Showing results 1 to 20 of 62.
Sorted by year (citations)

1 2 3 4 next

  1. Bhattacharyya, Anirban; Mokhov, Andrey; Pierce, Ken: An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems (2017)
  2. Bósa, Károly: Formal modeling of mobile computing systems based on ambient abstract state machines (2013)
  3. Ritson, Carl G.; Sampson, Adam T.; Barnes, Frederick R.M.: Multicore scheduling for lightweight communicating processes (2012)
  4. Vasconcelos, Vasco T.: Fundamentals of session types (2012)
  5. da Silva, Paulo Salem; de Melo, Ana C.V.: A formal environment model for multi-agent systems (2011)
  6. Gorla, Daniele: A taxonomy of process calculi for distribution and mobility (2010)
  7. Ohmori, Kenji; Kunii, Tosiyasu L.: Designing and modeling cyberworlds using the incrementally modular abstraction hierarchy based on homotopy theory (2010)
  8. Sroka, Jacek; Hidders, Jan; Missier, Paolo; Goble, Carole: A formal semantics for the Taverna 2 workflow model (2010)
  9. Bidinger, Philippe; Compagnoni, Adriana: Pict correctness revisited (2009)
  10. Cervesato, Iliano; Scedrov, Andre: Relating state-based and process-based concurrency through linear logic (full-version) (2009)
  11. Gorla, Daniele: On the relative expressive power of calculi for mobility (2009)
  12. Hassan, Abubakar; Mackie, Ian; Sato, Shinya: Compilation of interaction nets (2009)
  13. Hennessy, Matthew; Gaur, Manish: Counting the cost in the picalculus (extended abstract) (2009)
  14. Gorla, Daniele: Comparing communication primitives via their relative expressive power (2008)
  15. Kobayashi, Naoki; Sangiorgi, Davide: A hybrid type system for lock-freedom of mobile processes (2008)
  16. Ma, Qin; Maranget, Luc: Algebraic pattern matching in join calculus (2008)
  17. Affeldt, Reynald; Kobayashi, Naoki: A Coq library for verification of concurrent programs (2007)
  18. Gorla, Daniele: Synchrony vs asynchrony in communication primitives (2007)
  19. Johnsen, Einar Broch; Owe, Olaf: An asynchronous communication model for distributed concurrent objects (2007)
  20. Misra, Jayadev; Cook, William R.: Computation orchestrationa. A basis for wide-area computing (2007)

1 2 3 4 next