default search action
Cynthia Kop
Person information
- affiliation: Radboud University Nijmegen, Department of Software Science, The Netherlands
- affiliation (former): University of Copenhagen, Denmark
- affiliation (former): University of Innsbruck, Austria
- affiliation (former): VU University of Amsterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c25]Liye Guo
, Cynthia Kop
Higher-Order LCTRSs and Their Termination. ESOP (2) 2024: 331-357 - [c24]Patrick Baillot
On Basic Feasible Functionals and the Interpretation Method. FoSSaCS (2) 2024: 70-91 - [c23]Kasper Hagens
Rewriting Induction for Higher-Order Constrained Term Rewriting Systems. LOPSTR 2024: 202-219 - [c22]Liye Guo, Kasper Hagens, Cynthia Kop, Deivid Vale:
Higher-Order Constrained Dependency Pairs for (Universal) Computability. MFCS 2024: 57:1-57:15 - [i24]Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale:
On Basic Feasible Functionals and the Interpretation Method. CoRR abs/2401.12385 (2024) - [i23]Cynthia Kop:
A weakly monotonic, logically constrained, HORPO-variant. CoRR abs/2406.18493 (2024) - [i22]Liye Guo, Kasper Hagens, Cynthia Kop, Deivid Vale:
Higher-Order Constrained Dependency Pairs for (Universal) Computability. CoRR abs/2406.19379 (2024) - 2023
- [j5]Siddharth Bhaskar
Subclasses of Ptime Interpreted by Programming Languages. Theory Comput. Syst. 67(3): 437-472 (2023) - [c21]Cynthia Kop, Deivid Vale
Cost-Size Semantics for Call-By-Value Higher-Order Rewriting. FSCD 2023: 15:1-15:19 - [c20]Niels van der Weide, Deivid Vale
Certifying Higher-Order Polynomial Interpretations. ITP 2023: 30:1-30:20 - [i21]Niels van der Weide, Deivid Vale, Cynthia Kop:
Certifying Higher-Order Polynomial Interpretations. CoRR abs/2302.11892 (2023) - [i20]Cynthia Kop, Deivid Vale:
Complexity Analysis for Call-by-Value Higher-Order Rewriting. CoRR abs/2307.13426 (2023) - [i19]Liye Guo, Cynthia Kop:
Higher-Order LCTRSs and Their Termination. CoRR abs/2307.13519 (2023) - 2022
- [c19]Cynthia Kop:
Cutting a Proof into Bite-Sized Chunks: Incrementally proving termination in higher-order term rewriting (Invited Talk). FSCD 2022: 1:1-1:17 - [i18]Cynthia Kop, Deivid Vale:
Tuple Interpretations and Applications to Higher-Order Runtime Complexity. CoRR abs/2206.15202 (2022) - 2021
- [c18]Cynthia Kop, Deivid Vale
Tuple Interpretations for Higher-Order Complexity. FSCD 2021: 31:1-31:22 - [i17]Deivid Vale, Cynthia Kop:
Tuple Interpretations for Higher-Order Rewriting. CoRR abs/2105.01112 (2021) - 2020
- [c17]Markus Klinik, Bernard van Gastel, Cynthia Kop, Marko C. J. D. van Eekelen:
Skylines for Symbolic Energy Consumption Analysis. FMICS 2020: 93-112 - [c16]Cynthia Kop
WANDA - a Higher Order Termination Tool (System Description). FSCD 2020: 36:1-36:19 - [c15]Neil D. Jones, Siddharth Bhaskar
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME. VPT/HCVS@ETAPS 2020: 65-79
2010 – 2019
- 2019
- [c14]Carsten Fuhs, Cynthia Kop:
A Static Higher-Order Dependency Pair Framework. ESOP 2019: 752-782 - [c13]Lukasz Czajka
Polymorphic Higher-Order Termination. FSCD 2019: 12:1-12:18 - [i16]Carsten Fuhs, Cynthia Kop:
A static higher-order dependency pair framework. CoRR abs/1902.06733 (2019) - [i15]Lukasz Czajka, Cynthia Kop:
Polymorphic Higher-order Termination. CoRR abs/1904.09859 (2019) - 2018
- [i14]Carsten Fuhs, Cynthia Kop:
The unified higher-order dependency pair framework. CoRR abs/1805.09390 (2018) - 2017
- [j4]Cynthia Kop, Aart Middeldorp
Complexity of Conditional Term Rewriting. Log. Methods Comput. Sci. 13(1) (2017) - [j3]Cynthia Kop, Jakob Grue Simonsen:
Complexity Hierarchies and Higher-order Cons-free Term Rewriting. Log. Methods Comput. Sci. 13(3) (2017) - [j2]Carsten Fuhs, Cynthia Kop, Naoki Nishida:
Verifying Procedural Programs via Constrained Rewriting Induction. ACM Trans. Comput. Log. 18(2): 14:1-14:50 (2017) - [c12]Cynthia Kop, Jakob Grue Simonsen:
The Power of Non-determinism in Higher-Order Implicit Complexity - Characterising Complexity Classes Using Non-deterministic Cons-Free Programming. ESOP 2017: 668-695 - [i13]Cynthia Kop, Jakob Grue Simonsen:
The Power of Non-Determinism in Higher-Order Implicit Complexity. CoRR abs/1701.05382 (2017) - [i12]Cynthia Kop:
Quasi-reductivity of Logically Constrained Term Rewriting Systems. CoRR abs/1702.02397 (2017) - [i11]Cynthia Kop:
On First-order Cons-free Term Rewriting and PTIME. CoRR abs/1711.03399 (2017) - [i10]Cynthia Kop, Jakob Grue Simonsen:
Higher-order Cons-free Interpreters. CoRR abs/1711.03407 (2017) - [i9]Cynthia Kop:
Non-deterministic Characterisations. CoRR abs/1711.03415 (2017) - [i8]Cynthia Kop:
Cons-free Programming with Immutable Functions. CoRR abs/1711.03424 (2017) - [i7]Cynthia Kop, Kristoffer Rose:
h: A Plank for Higher-order Attribute Contraction Schemes. CoRR abs/1711.03433 (2017) - 2016
- [c11]Cynthia Kop, Jakob Grue Simonsen:
Complexity Hierarchies and Higher-Order Cons-Free Rewriting. FSCD 2016: 23:1-23:18 - [i6]Cynthia Kop:
Termination of LCTRSs. CoRR abs/1601.03206 (2016) - [i5]Cynthia Kop, Jakob Grue Simonsen:
Complexity Hierarchies and Higher-Order Cons-Free Rewriting. CoRR abs/1604.08936 (2016) - [i4]Cynthia Kop, Jakob Grue Simonsen:
Complexity Hierarchies and Higher-order Cons-free Term Rewriting. CoRR abs/1611.10334 (2016) - 2015
- [c10]Cynthia Kop, Naoki Nishida:
Constrained Term Rewriting tooL. LPAR 2015: 549-557 - [c9]Cynthia Kop, Aart Middeldorp
Conditional Complexity. RTA 2015: 223-240 - 2014
- [c8]Cynthia Kop, Naoki Nishida:
Automatic Constrained Rewriting Induction towards Verifying Procedural Programs. APLAS 2014: 334-353 - [c7]Carsten Fuhs, Cynthia Kop:
First-Order Formative Rules. RTA-TLCA 2014: 240-256 - [i3]Carsten Fuhs, Cynthia Kop:
First-Order Formative Rules. CoRR abs/1404.7695 (2014) - [i2]Cynthia Kop, Naoki Nishida:
Towards Verifying Procedural Programs using Constrained Rewriting Induction. CoRR abs/1409.0166 (2014) - 2013
- [c6]Cynthia Kop, Naoki Nishida:
Term Rewriting with Logical Constraints. FroCos 2013: 343-358 - 2012
- [j1]Cynthia Kop, Femke van Raamsdonk:
Dynamic Dependency Pairs for Algebraic Functional Systems. Log. Methods Comput. Sci. 8(2) (2012) - [c5]Carsten Fuhs, Cynthia Kop:
Polynomial Interpretations for Higher-Order Rewriting. RTA 2012: 176-192 - [i1]Carsten Fuhs, Cynthia Kop:
Polynomial Interpretations for Higher-Order Rewriting. CoRR abs/1203.5754 (2012) - 2011
- [c4]Cynthia Kop:
Simplifying Algebraic Functional Systems. CAI 2011: 201-215 - [c3]Carsten Fuhs, Cynthia Kop:
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs. FroCoS 2011: 147-162 - [c2]Cynthia Kop, Femke van Raamsdonk:
Higher Order Dependency Pairs for Algebraic Functional Systems. RTA 2011: 203-218
2000 – 2009
- 2008
- [c1]Cynthia Kop, Femke van Raamsdonk:
A Higher-Order Iterative Path Ordering. LPAR 2008: 697-711
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-10-04 19:59 CEST 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: