@article{HASEGAWA2002113,
Abstract = {We apply the theory of analytic functors to two topics related to theoretical computer science. One is a mathematical foundation of certain syntactic well-quasi-orders and well-orders appearing in graph theory, the theory of term rewriting systems, and proof theory. The other is a new verification of the Lagrange--Good inversion formula using several ideas appearing in semantics of lambda calculi, especially the relation between categorical traces and fixpoint operators.},
Author = {Hasegawa, Ryu},
File = {Two applications of analytic functors - 1-s2.0-S0304397500003492-main - a.pdf},
ISSN = {0304-3975},
Journal = {Theoretical Computer Science},
Keywords = {Analytic functor, Recursive path ordering, Lagrange--Good inversion formula},
Note = {Theories of Types and Proofs 1997},
Number = {1},
Pages = {113-175},
Title = {Two applications of analytic functors},
URL = {https://www.sciencedirect.com/science/article/pii/S0304397500003492},
Volume = {272},
Year = {2002},
bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0304397500003492},
bdsk-url-2 = {https://doi.org/10.1016/S0304-3975(00)00349-2},
date-added = {2023-03-24 06:19:47 +0100},
date-modified = {2023-03-24 06:19:47 +0100},
doi = {10.1016/S0304-3975(00)00349-2}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A