default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiang-Ting Chen 0001
Person information
- affiliation: Academia Sinica Taiwan, Taipei, Taiwan
- unicode name: 陳亮廷
Other persons with the same name
- Liang-Ting Chen 0002 — National Taiwan University of Science and Technology, Taipei, Taiwan
- Liang-Ting Chen 0003
![[0009-0005-3189-2202]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0009-0005-3189-2202")
— National Yang Ming Chiao Tung University, Institute of Electronics, Hsinchu, Taiwan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Liang-Ting Chen, Hsiang-Shang Ko:
A Formal Treatment of Bidirectional Typing. ESOP (1) 2024: 115-142- 2022
- [j2]Hsiang-Shang Ko, Liang-Ting Chen, Tzu-Chi Lin:
Datatype-generic programming meets elaborator reflection. Proc. ACM Program. Lang. 6(ICFP): 225-253 (2022) - [c7]Liang-Ting Chen, Hsiang-Shang Ko:
Realising Intensional S4 and GL Modalities. CSL 2022: 14:1-14:17 - 2021
- [j1]Jirí Adámek, Liang-Ting Chen, Stefan Milius, Henning Urbat:
Reiterman's Theorem on Finite Algebras for a Monad. ACM Trans. Comput. Log. 22(4): 23:1-23:48 (2021) - [i6]Jirí Adámek, Liang-Ting Chen, Stefan Milius, Henning Urbat:
Reiterman's Theorem on Finite Algebras for a Monad. CoRR abs/2101.00942 (2021)
2010 – 2019
- 2018
- [c6]Liang-Ting Chen, Markus Roggenbach, John V. Tucker:
An Algebraic Theory for Data Linkage. WADT 2018: 47-66 - [i5]Liang-Ting Chen, Markus Roggenbach, John V. Tucker:
An algebraic theory for data linkage. CoRR abs/1810.08096 (2018) - 2017
- [c5]Henning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius:
Eilenberg Theorems for Free. MFCS 2017: 43:1-43:15 - 2016
- [c4]Liang-Ting Chen, Henning Urbat:
Schützenberger Products in a Category. DLT 2016: 89-101 - [c3]Liang-Ting Chen, Jirí Adámek, Stefan Milius, Henning Urbat:
Profinite Monads, Profinite Equations, and Reiterman's Theorem. FoSSaCS 2016: 531-547 - [i4]Henning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius:
One Eilenberg Theorem to Rule Them All. CoRR abs/1602.05831 (2016) - [i3]Liang-Ting Chen, Henning Urbat:
Schützenberger Products in a Category. CoRR abs/1605.01810 (2016) - 2015
- [c2]Liang-Ting Chen, Henning Urbat:
A Fibrational Approach to Automata Theory. CALCO 2015: 50-65 - [i2]Liang-Ting Chen, Henning Urbat:
A Fibrational Approach to Automata Theory. CoRR abs/1504.02692 (2015) - [i1]Liang-Ting Chen, Jirí Adámek, Stefan Milius, Henning Urbat:
Profinite Monads, Profinite Equations and Reiterman's Theorem. CoRR abs/1511.02147 (2015) - 2014
- [b1]Liang-Ting Chen:
On a purely categorical framework for coalgebraic modal logic. University of Birmingham, UK, 2014 - [c1]Liang-Ting Chen, Achim Jung:
On a Categorical Framework for Coalgebraic Modal Logic. MFPS 2014: 109-128
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
