Result 1 to 20 of 89 total
An approach to innocent strategies as graphs. (English)
Inf. Comput. 214, 119-155 (2012).
1
Preface to the special volume. (English ;French)
Theor. Comput. Sci. 412, No. 20, 1853-1859 (2011).
2
The duality of computation under focus. (English)
Calude, Christian S. (ed.) et al., Theoretical computer science. 6th IFIP WG 2.2 international conference, TCS 2010, held as a Part of the World Computer Congress (WCC 2010), Brisbane, Australia, September 20‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15239-9/hbk; 978-3-642-15240-5/ebook). IFIP Advances in Information and Communication Technology 323, 165-181 (2010).
3
The duality of computation under focus. (English)
Comput. Res. Repos. 2010, Article No. 1006.2283 (2010).
4
The duality of computation under focus (English)
IFIP TCS, 165-181 (2010).
5
Abstract machines for dialogue games. (English)
Curien, Pierre-Louis et al., Interactive models of computation and program behavior. Paris: Société Mathématique de France (SMF) (ISBN 978-2-85629-273-0/pbk). Panoramas et Synthèses 27, 231-275 (2009).
6
Interactive models of computation and program behavior. (English)
Panoramas et Synthèses 27. Paris: Société Mathématique de France (SMF) (ISBN 978-2-85629-273-0/pbk). xvi, 275~p. EUR~48.00; \$~72.00 (2009).
7
Sequential algorithms as bistable maps. (English)
Bertot, Yves (ed.) et al., From semantics to computer science. Essays in honour of Gilles Kahn. Cambridge: Cambridge University Press (ISBN 978-0-521-51825-3/hbk). 51-70 (2009).
8
Typed lambda calculi and applications. 9th international conference, TLCA 2009, Brasilia, Brazil, July 1‒3, 2009. Proceedings. (English)
Lecture Notes in Computer Science 5608. Berlin: Springer (ISBN 978-3-642-02272-2/pbk). xiii, 417~p. EUR~60.94 (2009).
9
The joy of string diagrams. (English)
Kaminski, Michael (ed.) et al., Computer science logic. 22nd international workshop, CSL 2008, 17th annual conference of the EACSL, Bertinoro, Italy, September 16‒19, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87530-7/pbk). Lecture Notes in Computer Science 5213, 15-22 (2008).
10
Computational self-assembly. (English)
Theor. Comput. Sci. 404, No. 1-2, 61-75 (2008).
11
Domains and lambda-calculi. Paperback reprint. (English)
Cambridge Tracts in Theoretical Computer Science 46. Cambridge: Cambridge University Press (ISBN 978-0-521-06292-3/pbk). xvi, 484~p. \sterling~43.00 (2008).
12
The joy of string diagrams (English)
CSL, 15-22 (2008).
13
Definability and full abstraction. (English)
Electron. Notes Theor. Comput. Sci. 172, 301-310 (2007).
14
Abstract machines for dialogue games. (English)
Comput. Res. Repos. 2007, Article No. 0706.2544 (2007).
15
Introduction to linear logic and ludics, part II. (English)
Comput. Res. Repos. 2005, Article No. 0501039 (2005).
16
Introduction to linear logic and ludics, part I. (English)
Comput. Res. Repos. 2005, Article No. 0501035 (2005).
17
Symmetry and interactivity in programming. (English)
Comput. Res. Repos. 2005, Article No. 0501034 (2005).
18
Playful, streamlike computation. (English)
Comput. Res. Repos. 2005, Article No. 0501033 (2005).
19
L-nets, strategies and proof-nets. (English)
Ong, Luke (ed.), Computer science logic. 19th international workshop, CSL 2005, 14th annual conference of the EACSL, Oxford, UK, August 22‒25, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28231-9/pbk). Lecture Notes in Computer Science 3634, 167-183 (2005).
20
Result 1 to 20 of 89 total
Start
Contact
Print
General Help
