Pict

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 67 articles )

Showing results 1 to 20 of 67.
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. Chen, Tzu-Chun; Dezani-Ciancaglini, Mariangiola; Scalas, Alceste; Yoshida, Nobuko: On the preciseness of subtyping in session types (2017)
  3. Bósa, Károly: Formal modeling of mobile computing systems based on ambient abstract state machines (2013)
  4. Ritson, Carl G.; Sampson, Adam T.; Barnes, Frederick R. M.: Multicore scheduling for lightweight communicating processes (2012) ioport
  5. Vasconcelos, Vasco T.: Fundamentals of session types (2012)
  6. da Silva, Paulo Salem; de Melo, Ana C. V.: A formal environment model for multi-agent systems (2011)
  7. Matiello, Pedro; de Melo, Ana C. V.: PiStache: implementing $\pi $-calculus in Scala (2011)
  8. Gorla, Daniele: A taxonomy of process calculi for distribution and mobility (2010)
  9. Ohmori, Kenji; Kunii, Tosiyasu L.: Designing and modeling cyberworlds using the incrementally modular abstraction hierarchy based on homotopy theory (2010) ioport
  10. Sroka, Jacek; Hidders, Jan; Missier, Paolo; Goble, Carole: A formal semantics for the Taverna 2 workflow model (2010)
  11. Bidinger, Philippe; Compagnoni, Adriana: Pict correctness revisited (2009)
  12. Cervesato, Iliano; Scedrov, Andre: Relating state-based and process-based concurrency through linear logic (full-version) (2009)
  13. Gorla, Daniele: On the relative expressive power of calculi for mobility (2009)
  14. Hassan, Abubakar; Mackie, Ian; Sato, Shinya: Compilation of interaction nets (2009)
  15. Hennessy, Matthew; Gaur, Manish: Counting the cost in the picalculus (extended abstract) (2009)
  16. Kitchin, David; Quark, Adrian; Cook, William; Misra, Jayadev: The Orc programming language (2009)
  17. Gorla, Daniele: Comparing communication primitives via their relative expressive power (2008)
  18. Kobayashi, Naoki; Sangiorgi, Davide: A hybrid type system for lock-freedom of mobile processes (2008)
  19. Ma, Qin; Maranget, Luc: Algebraic pattern matching in join calculus (2008)
  20. Affeldt, Reynald; Kobayashi, Naoki: A Coq library for verification of concurrent programs (2007)

1 2 3 4 next