@InProceedings{kop:LIPIcs.FSCD.2022.1,
  author =	{Kop, Cynthia},
  title =	{{Cutting a Proof into Bite-Sized Chunks: Incrementally proving termination in higher-order term rewriting}},
  booktitle =	{7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022)},
  pages =	{1:1--1:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-233-4},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{228},
  editor =	{Felty, Amy P.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2022.1},
  URN =		{urn:nbn:de:0030-drops-162827},
  doi =		{10.4230/LIPIcs.FSCD.2022.1},
  annote =	{Keywords: Termination, Modularity, Higher-order term rewriting, Dependency Pairs, Algebra Interpretations}
}