1. Daniel Bauer & Owen Rambow (2016): Hyperedge Replacement and Nonprojective Dependency Structures. In: David Chiang & Alexander Koller: Proceedings of the 12th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+12), June 29 - July 1, 2016, Heinrich Heine University, Düsseldorf, Germany. The Association for Computer Linguistics, pp. 103–111. Available at
  2. Frank Drewes & Anna Jonsson (2017): Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations. In: Marco Kuhlmann & Tatjana Scheffler: Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, TAG 2017, Umeå, Sweden, September 4-6, 2017. Association for Computational Linguistics, pp. 102–111. Available at
  3. Frank Drewes, Hans-Jörg Kreowski & Annegret Habel (1997): Hyperedge Replacement Graph Grammars. In: Grzegorz Rozenberg: Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations. World Scientific, pp. 95–162, doi:10.1142/9789812384720_0002.
  4. Sorcha Gilroy, Adam Lopez & Sebastian Maneth (2017): Parsing Graphs with Regular Graph Grammars. In: Nancy Ide, Aurélie Herbelot & Lluís Màrquez: Proceedings of the 6th Joint Conference on Lexical and Computational Semantics, *SEM @ACM 2017, Vancouver, Canada, August 3-4, 2017. Association for Computational Linguistics, pp. 199–208, doi:10.18653/v1/S17-1024.
  5. Annegret Habel (1992): Hyperedge Replacement: Grammars and Languages. Lecture Notes in Computer Science 643. Springer, doi:10.1007/BFb0013875.
  6. Bevan K. Jones, Jacob Andreas, Daniel Bauer, Karl Moritz Hermann & Kevin Knight (2012): Semantics-Based Machine Translation with Hyperedge Replacement Grammars. In: Martin Kay & Christian Boitet: COLING 2012, 24th International Conference on Computational Linguistics, Proceedings of the Conference: Technical Papers, 8-15 December 2012, Mumbai, India. Indian Institute of Technology Bombay, pp. 1359–1376. Available at
  7. Joachim Lambek (1958): The Mathematics of Sentence Structure. The American Mathematical Monthly 65(3), pp. 154–170, doi:10.1080/00029890.1958.11989160. Available at
  8. Mati Pentus (1993): Lambek Grammars Are Context Free. In: Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), Montreal, Canada, June 19-23, 1993. IEEE Computer Society, pp. 429–433, doi:10.1109/LICS.1993.287565.
  9. Mati Pentus (1995): Models for the Lambek Calculus. Ann. Pure Appl. Log. 75(1-2), pp. 179–213, doi:10.1016/0168-0072(94)00063-9.
  10. Tikhon Pshenitsyn (2020): Hypergraph Basic Categorial Grammars. In: Fabio Gadducci & Timo Kehrer: Graph Transformation - 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Online, June 25-26, 2020, Proceedings, Lecture Notes in Computer Science 12150. Springer, pp. 146–162, doi:10.1007/978-3-030-51372-6_9.
  11. Tikhon Pshenitsyn (2020): Weak Greibach Normal Form for Hyperedge Replacement Grammars. In: Berthold Hoffmann & Mark Minas: Proceedings of the Eleventh International Workshop on Graph Computation Models, GCM@STAF 2020, Online-Workshop, 24th June 2020, EPTCS 330, pp. 108–125, doi:10.4204/EPTCS.330.7.
  12. Tikhon Pshenitsyn (2021): Introduction to a Hypergraph Logic Unifying Different Variants of the Lambek Calculus. Available at
  13. Tikhon Pshenitsyn (2021): Powerful and NP-Complete: Hypergraph Lambek Grammars. In: Fabio Gadducci & Timo Kehrer: Graph Transformation - 14th International Conference, ICGT 2021, Held as Part of STAF 2021, Virtual Event, June 24-25, 2021, Proceedings, Lecture Notes in Computer Science 12741. Springer, pp. 102–121, doi:10.1007/978-3-030-78946-6_6.

Comments and questions to:
For website issues: