Chen, Liang-Ting 陳亮廷

Postdoctoral Researcher

Institute of Information Science
Academia Sinica, Taiwan

Research

My research interests include, but are not limited to,

I generally find the categorical perspective of theory B interesting to me.

Academic service

Award

Grants

Publications

(See also: DBLP or Google Scholar)

[1]
H.-S. Ko, L.-T. Chen, T.-C. Lin, Datatype-generic programming meets elaborator reflection, in: 27th ACM SIGPLAN International Conference on Functional Programming (ICFP 2022), 2022. doi:10.1145/3547629.
[2]
L.-T. Chen, H.-S. Ko, Realising intensional S4 and GL modalities, in: F. Manea, A. Simpson (Eds.), 30th EACSL Annual Conference on Computer Science Logic (CSL 2022), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022: pp. 14:1–14:17. doi:10.4230/LIPIcs.CSL.2022.14.
[3]
J. Adámek, L.-T. Chen, S. Milius, H. Urbat, Reiterman’s theorem on finite algebras for a monad, ACM Transactions on Computational Logic. 22 (2021) 1–48. doi:10.1145/3464691.
[4]
L.-T. Chen, M. Roggenbach, J.V. Tucker, An algebraic theory for data linkage, in: I. Fiadeiro, José Luiz and Ţuţu (Ed.), 24th IFIP WG 1.3 International Workshop on Algebraic Development Techniques (WADT’18), Springer, 2019: pp. 47–66. doi:10.1007/978-3-030-23220-7_3.
[5]
H. Urbat, J. Adámek, L.-T. Chen, S. Milius, Eilenberg theorems for free, in: K.G. Larsen, H.L. Bodlaender, J.-F. Raskin (Eds.), 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS’17), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2017: pp. 43:1–43:15. doi:10.4230/LIPIcs.MFCS.2017.43.
[6]
L.-T. Chen, H. Urbat, Schützenberger products in a category, in: S. Brlek, C. Reutenauer (Eds.), 20th International Conference on Developments in Language Theory (DLT’16), Springer Berlin Heidelberg, 2016: pp. 89–101. doi:10.1007/978-3-662-53132-7.
[7]
L.-T. Chen, J. Adámek, S. Milius, H. Urbat, Profinite monads, profinite equations, and Reiterman’s theorem, in: B. Jacobs, C. Löding (Eds.), 19th International Conference on the Foundations of Software Sciences and Computer Structures (FoSSaCS’15), Springer Berlin Heidelberg, 2016: pp. 531–547. doi:10.1007/978-3-662-49630-5_31.
[8]
L.-T. Chen, H. Urbat, A fibrational approach to automata theory, in: L.S. Moss, P. Sobocinski (Eds.), 6th Conference on Algebra and Coalgebra in Computer Science (CALCO’15), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2015: pp. 50–65. doi:10.4230/LIPIcs.CALCO.2015.50.
[9]
L.-T. Chen, A. Jung, On a categorical framework for coalgebraic modal logic, in: 30th Conference on the Mathematical Foundations of Programming Semantics (MFPS’14), Elsevier, 2014: pp. 109–128. doi:10.1016/j.entcs.2014.10.007.