Heterogeneous substitution systems revisited

By Benedikt Ahrens, Benedikt Ahrens, Ralph Matthes. 2016

218 citations recorded by the source corpus.

Matthes and Uustalu (TCS 327(1-2):155-174, 2004) presented a categorical description of substitution systems capable of capturing syntax involving binding which is independent of whether the syntax is made up from least or greatest fixed points. We extend this work in two directions: we continue the analysis by creating more categorical structure, in particular by organizing substitution systems into a category and studying its properties, and we develop the proofs of the results of the cited paper and our new ones in UniMath, a recent library of univalent mathematics formalized in the Coq theorem prover.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Pure Mathematics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Percy Liang
  2. Quoc V. Le
  3. Yoshua Bengio
  4. Luke S. Zettlemoyer
  5. Mohit Bansal
  6. Tie-Yan Liu
  7. Sergey Levine
  8. Tao Qin

In Computational Theory and Mathematics

  1. Percy Liang
  2. Adam Coates
  3. Mohammad Norouzi
  4. Rui Peng
  5. Anelia Angelova
  6. Yihong Du
  7. Nate Kushman
  8. David L. Dill

In Pure Mathematics

  1. Mohammad Norouzi
  2. Percy Liang
  3. Anelia Angelova
  4. Michael Gygli

Citations in the corpus