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)

   Volume 13 (2017)

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

VOLUME 4, ISSUE 1


1. Are there Hilbert-style Pure Type Systems?
  Martin W. Bunder and Wil J.M. Dekkers


2. Lambda-RBAC: Programming with Role-Based Access Control
  Radha Jagadeesan, Alan Jeffrey, Corin Pitcher and James Riely


3. Call-by-value Termination in the Untyped λ-calculus
  Neil D. Jones and Nina Bohr


4. Generative Unbinding of Names
  Andrew M. Pitts and Mark R. Shinwell


5. Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
  Qiqi Yan


6. Independence and concurrent separation logic
  Jonathan Mark Hayman and Glynn Winskel


7. Algebraic Pattern Matching in Join Calculus
  Qin Ma and Luc Maranget


8. An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
  Alexis Bs


9. Normalisation Control in Deep Inference via Atomic Flows
  Alessio Guglielmi and Tom Gundersen


Creative Commons