some image logo

HOME

SEARCH

CURRENT ISSUE

REGULAR ISSUES

   Volume 1 (2005)

   Volume 2 (2006)

   Volume 3 (2007)

   Volume 4 (2008)

   Volume 5 (2009)

   Volume 6 (2010)

   Volume 7 (2011)

   Volume 8 (2012)

   Volume 9 (2013)

      Issue 1

      Issue 2

      Issue 3

      Issue 4

   Volume 10 (2014)

   Volume 11 (2015)

   Volume 12 (2016)

   Volume 13 (2017)

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

VOLUME 9, ISSUE 3


1. Graph Logics with Rational Relations
  Pablo Barcelo, Diego Figueira and Leonid Libkin


2. Well-Pointed Coalgebras
  Jiří Adámek, Stefan Milius, Lawrence S. Moss and Lurdes Sousa


3. Regular Cost Functions, Part I: Logic and Algebra over Words
  Thomas Colcombet


4. Modal Interface Automata
  Gerald Lüttgen and Walter Vogler


5. Computably regular topological spaces
  Klaus Weihrauch


6. Indexed Induction and Coinduction, Fibrationally
  Neil Ghani, Patricia Johann and Clement Fumex


7. Universal codes of the natural numbers
  Yuval Filmus


8. Algebraic Structure of Combined Traces
  Lukasz Mikulski


9. Computability of Probability Distributions and Characteristic Functions
  Takakazu Mori, Yoshiki Tsujii and Mariko Yasugi


10. Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
  Tom Hirschowitz


11. Measure Transformer Semantics for Bayesian Machine Learning
  Johannes Borgström, Andrew D Gordon, Michael Greenberg, James Margetson and Jurgen Van Gael


12. Linearizability with Ownership Transfer
  Alexey Gotsman and Hongseok Yang


13. Reachability Problem for Weak Multi-Pushdown Automata
  Wojciech Czerwiński, Piotr Hofman and Sławomir Lasota


14. Coalgebraic Characterizations of Context-Free Languages
  Joost Winter, Jan J.M. Rutten and Marcello M. Bonsangue


15. Pebble Games, Proof Complexity, and Time-Space Trade-offs
  Jakob Nordstrom


16. Connector algebras for C/E and P/T nets' interactions
  Roberto Bruni, Hernan Melgratti, Ugo Montanari and Pawel Sobocinski


17. On Characterising Distributability
  Rob J. van Glabbeek, Ursula Goltz and Jens-Wolfhard Schicke-Uffmann


18. A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets
  Victor Khomenko, Roland Meyer and Reiner Hüchting


19. Automatic functions, linear time and learning
  John Case, Sanjay Jain and Frank Stephan


20. Induction in Algebra: a First Case Study
  Peter M. Schuster


21. Reachability under Contextual Locking
  Remi Bonnet, Rohit Chadha, Mahesh Viswanathan and P. Madhusudan


22. Exploring the Boundaries of Monad Tensorability on Set
  Nathan Bowler, Sergey Goncharov, Paul Blain Levy and Lutz Schröder


23. Bases as Coalgebras
  Bart Jacobs


24. A Static Analysis Framework for Livelock Freedom in CSP
  Joel Ouaknine, Hristina Palikareva, A. W. Roscoe and James Worrell


25. Unary negation
  Luc Segoufin and Balder ten Cate


26. Modelling Probabilistic Wireless Networks
  Andrea Cerone and Matthew Hennessy


27. Randomness extraction and asymptotic Hamming distance
  Cameron E. Freer and Bjoern Kjos-Hanssen


28. Abstract GSOS Rules and a Modular Treatment of Recursive Definitions
  Stefan Milius, Lawrence S. Moss and Daniel Schwencke


29. Alternating Turing machines for inductive languages
  Daniel M. Leivant


Creative Commons