On a Categorical Framework for Coalgebraic Modal Logic. - Liang-Ting Chen 001; Achim Jung (MFPS, 2014)

On a purely categorical framework for coalgebraic modal logic. - Liang-Ting Chen 001 (2014)

A Fibrational Approach to Automata Theory. - Liang-Ting Chen 001; Henning Urbat (CALCO, 2015)

Schützenberger Products in a Category. - Liang-Ting Chen 001; Henning Urbat (DLT, 2016)

Profinite Monads, Profinite Equations, and Reiterman's Theorem. - Liang-Ting Chen 001; Jirí Adámek; Stefan Milius; Henning Urbat (FoSSaCS, 2016)

One Eilenberg Theorem to Rule Them All. - Henning Urbat; Jirí Adámek; Liang-Ting Chen 001; Stefan Milius (CoRR, 2016)

Eilenberg Theorems for Free. - Henning Urbat; Jirí Adámek; Liang-Ting Chen 001; Stefan Milius (MFCS, 2017)

An Algebraic Theory for Data Linkage. - Liang-Ting Chen 001; Markus Roggenbach; John V. Tucker (WADT, 2018)

Reiterman's Theorem on Finite Algebras for a Monad. - Jirí Adámek; Liang-Ting Chen 001; Stefan Milius; Henning Urbat (ACM Trans. Comput. Log., 2021)

Realising Intensional S4 and GL Modalities. - Liang-Ting Chen 001; Hsiang-Shang Ko (CSL, 2022)

Datatype-generic programming meets elaborator reflection. - Hsiang-Shang Ko; Liang-Ting Chen 001; Tzu-Chi Lin (Proc. ACM Program. Lang., 2022)

A Formal Treatment of Bidirectional Typing. - Liang-Ting Chen 001; Hsiang-Shang Ko (ESOP (1), 2024)