Chen, Liang-Ting 陳亮廷

Assistant Research Fellow (Assistant Professor)

Institute of Information Science
Academia Sinica, Taiwan

About me

I am an assistant research fellow in the Theory Research Group at the Institute of Information Science, Academia Sinica in Taiwan.

Research Interests

I am generally interested in mathematical structures in computer science, specifically, the so-called ‘theory B’ of theoretical computer science. My work so far spans dependently typed programming, programming languages, logic, and automata theory, employing logical and categorical methods.

Recently, I have been exploring the computational and logical aspects of type theory, particularly through the lens of the lens of Curry-Howard correspondence. I have worked on both the theory and practice of programming languages using Agda, a proof assistant and a dependently typed language. This approach allows me to produce reliable, reproducible, and sometimes useful results.

Prospective postdocs / assistants

I have some funding available to hire a self-motivated postdoc and research assistants to join me at Academia Sinica.
If you find my work interesting to you, please feel free to send me an email with your résumé to initiate the conversation.

Academic service


Invited Talk


(See also: DBLP or Google Scholar)

L.-T. Chen, H.-S. Ko, A formal treatment of bidirectional typing, in: S. Weirich (Ed.), 33rd European Symposium on Programming (ESOP), 2024. doi:10.1007/978-3-031-57262-3_5 (Slides).
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. doi:10.1145/3547629.
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), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022. doi:10.4230/LIPIcs.CSL.2022.14.
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). doi:10.1145/3464691.
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. doi:10.1007/978-3-030-23220-7_3.
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), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2017. doi:10.4230/LIPIcs.MFCS.2017.43.
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), Springer Berlin Heidelberg, 2016. doi:10.1007/978-3-662-53132-7_8.
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), Springer Berlin Heidelberg, 2016. doi:10.1007/978-3-662-49630-5_31.
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), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2015. doi:10.4230/LIPIcs.CALCO.2015.50.
L.-T. Chen, A. Jung, On a categorical framework for coalgebraic modal logic, in: 30th Conference on the Mathematical Foundations of Programming Semantics (MFPS), Elsevier, 2014. doi:10.1016/j.entcs.2014.10.007.