some image logo

HOME

SEARCH

CURRENT ISSUE

REGULAR ISSUES

   Volume 1 (2005)

   Volume 2 (2006)

   Volume 3 (2007)

   Volume 4 (2008)

      Issue 1

      Issue 2

      Issue 3

      Issue 4

   Volume 5 (2009)

   Volume 6 (2010)

   Volume 7 (2011)

   Volume 8 (2012)

   Volume 9 (2013)

   Volume 10 (2014)

   Volume 11 (2015)

   Volume 12 (2016)

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

VOLUME 4, ISSUE 3


1. Enriched μ-Calculi Module Checking
  Ferrante Alessandro, Aniello Murano and Mimmo Parente


2. Canonical calculi with (n,k)-ary quantifiers
  Arnon Avron and Anna Zamansky


3. Exhaustible sets in higher-type computation
  Martin Escardo


4. Separability in the Ambient Logic
  Etienne Lozes, Daniel Hirschkoff and Davide Sangiorgi


5. Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics
  Robert L. Constable and Wojciech Moczydlowski


6. Coinductive Formal Reasoning in Exact Real Arithmetic
  Milad Niqui


7. Game Refinement Relations and Metrics
  Luca de Alfaro, Rupak Majumdar, Vishwanath Raman and Mariëlle Stoelinga


8. Consistency and Completeness of Rewriting in the Calculus of Constructions
  Daria Walukiewicz-Chrząszcz and Jacek Chrząszcz


9. Rational streams coalgebraically
  Jan Rutten


10. Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
  Naokata Shikuma and Atsushi Igarashi


11. The Complexity of Enriched Mu-Calculi
  Piero A. Bonatti, Carsten Lutz, Aniello Murano and Moshe Y. Vardi


12. Model Checking Probabilistic Timed Automata with One or Two Clocks
  Marcin Jurdzinski, Jeremy Sproston and Francois Laroussinie


13. On the strength of proof-irrelevant type theories
  Benjamin Werner


Creative Commons