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)

   Volume 10 (2014)

   Volume 11 (2015)

   Volume 12 (2016)

      Issue 1

      Issue 2

      Issue 3

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

VOLUME 12, ISSUE 2


1. Generic algorithms for halting problem and optimal machines revisited
  Laurent Bienvenu, Damien Desfontaines and Alexander Shen


2. Non-Obfuscated Unprovable Programs & Many Resultant Subtleties
  John Case and Michael Ralston


3. FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems
  Florent Jacquemard, Luc Segoufin and Jérémie Dimino


4. On the characterization of models of H*
  Flavien Breuvart


5. Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
  Paola Bruscoli, Alessio Guglielmi, Tom Gundersen and Michel Parigot


6. Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda
  Jean-Philippe Bernardy and Patrik Jansson


7. Formalized linear algebra over elementary divisor rings in Coq
  Guillaume Cano, Cyril Cohen, Maxime Dénčs, Anders Mörtberg and Vincent Siles


8. Two-variable Logic with Counting and a Linear Order
  Witold Charatonik and Piotr Witkowski


9. Weighted Pushdown Systems with Indexed Weight Domains
  Yasuhiko Minamide


10. Using higher-order contracts to model session types
  Giovanni Bernardi and Matthew Hennessy


11. The Largest Respectful Function
  Joachim Parrow and Tjark Weber


12. No solvable lambda-value term left behind
  Álvaro García-Pérez and Pablo Nogueira


Creative Commons