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

Showing results 21 to 40 of 71.
Sorted by year (citations)
  1. Affeldt, Reynald; Kobayashi, Naoki: A Coq library for verification of concurrent programs (2007)
  2. Bidinger, Philippe; Compagnoni, Adriana: Pict correctness revisited (2007)
  3. Carbone, Marco; Honda, Kohei; Yoshida, Nobuko: A calculus of global interaction based on session types (2007)
  4. Gorla, Daniele: Synchrony vs asynchrony in communication primitives (2007)
  5. Johnsen, Einar Broch; Owe, Olaf: An asynchronous communication model for distributed concurrent objects (2007) ioport
  6. Misra, Jayadev; Cook, William R.: Computation orchestrationa. A basis for wide-area computing (2007) ioport
  7. Sewell, Peter; Leifer, James J.; Wansbrough, Keith; Nardelli, Francesco Zappa; Allen-Williams, Mair; Habouzit, Pierre; Vafeiadis, Viktor: Acute: high-level programming language design for distributed computation (2007)
  8. Vigliotti, Maria Grazia; Phillips, Iain; Palamidessi, Catuscia: Tutorial on separation results in process calculi via leader election problems (2007)
  9. Cervesato, Iliano; Scedrov, Andre: Relating state-based and process-based concurrency through linear logic (2006)
  10. Guillen-Scholten, Juan; Arbab, Farhad; de Boer, Frank; Bonsangue, Marcello: A component coordination model based on mobile channels (2006)
  11. Johnsen, Einar Broch; Owe, Olaf; Yu, Ingrid Chieh: Creol: A type-safe object-oriented model for distributed concurrent systems (2006)
  12. Niehren, J.; Schwinghammer, J.; Smolka, G.: A concurrent lambda calculus with futures (2006)
  13. Raja, N.; Shyamasundar, R. K.: A closer look at constraints as processes (2006)
  14. Achermann, Franz; Nierstrasz, Oscar: A calculus for reasoning about software composition (2005)
  15. Berger, Martin; Honda, Kohei; Yoshida, Nobuko: Genericity and the (\pi)-calculus (2005)
  16. Cuesta, Carlos E.; de la Fuente, Pablo; Barrio-Solórzano, Manuel; Beato, M. Encarnación: An “abstract process” approach to algebraic dynamic architecture description (2005)
  17. Gardner, Philippa; Maffeis, Sergio: Modelling dynamic web data (2005)
  18. Garg, Deepak; Pfenning, Frank: Type-directed concurrency (2005)
  19. Gay, Simon; Hole, Malcolm: Subtyping for session types in the pi calculus (2005)
  20. Gustavsson, Rune; Fredriksson, Martin: Process algebras as support for sustainable systems of services (2005)