Journal: Electronic Notes in Theoretical Computer Science

Volume 203, Issue 1

1 -- 2Ian Mackie, Detlef Plump. Preface
3 -- 17Emilie Balland, Paul Brauner. Term-graph Rewriting in Tom Using Relative Positions
19 -- 30Denis Béchet, Sylvain Lippi. Universal Boolean Systems
31 -- 48Denis Béchet, Sylvain Lippi. Hard combinators
49 -- 63Davide Grohmann, Marino Miculan. An Algebra for Directed Bigraphs
65 -- 77Guillaume Bonfante, Yves Guiraud. Intensional Properties of Polygraphs
79 -- 92Abubakar Hassan, Shinya Sato. Interaction Nets With Nested Pattern Matching
93 -- 108Herman Geuvers, Iris Loeb. Deduction Graphs with Universal Quantification
109 -- 121Christophe Fouqueré, Virgile Mogbil. Rewritings for Polarized Multiplicative and Exponential Proof Structures
123 -- 133François-Régis Sinot. Sub-lambda-calculi, Classified
135 -- 148Martin Strecker. Modeling and Verifying Graph Transformations in Proof Assistants