@InProceedings{asada_et_al:LIPIcs.FSTTCS.2018.14,
author = {Asada, Kazuyuki and Kobayashi, Naoki},
title = {{Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {14:1--14:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.14},
URN = {urn:nbn:de:0030-drops-99138},
doi = {10.4230/LIPIcs.FSTTCS.2018.14},
annote = {Keywords: higher-order grammar, pumping lemma, Kruskal's tree theorem, well-quasi-ordering, simply-typed lambda calculus}
}