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