![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Stefan Kahrs
Person information
- affiliation: University of Kent, UK
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j7]Stefan Kahrs
, Colin Runciman:
Simplifying regular expressions further. J. Symb. Comput. 109: 124-143 (2022)
2010 – 2019
- 2016
- [c16]Stefan Kahrs, Connor Smith:
Non-Omega-Overlapping TRSs are UN. FSCD 2016: 22:1-22:17 - 2013
- [j6]Stefan Kahrs:
Infinitary rewriting: closure operators, equivalences and models. Acta Informatica 50(2): 123-156 (2013) - 2010
- [j5]Stefan Kahrs:
Modularity of Convergence and Strong Convergence in Infinitary Rewriting. Log. Methods Comput. Sci. 6(3) (2010) - [c15]Stefan Kahrs:
Infinitary Rewriting: Foundations Revisited. RTA 2010: 161-176
2000 – 2009
- 2009
- [c14]Stefan Kahrs:
Modularity of Convergence in Infinitary Rewriting. RTA 2009: 179-193 - 2007
- [j4]Stefan Kahrs:
Infinitary rewriting: meta-theory and convergence. Acta Informatica 44(2): 91-121 (2007) - 2006
- [c13]Stefan Kahrs:
Genetic programming with primitive recursion. GECCO 2006: 941-942 - 2003
- [c12]Stefan Kahrs:
Well-Going Programs Can Be Typed. TLCA 2003: 167-179 - 2001
- [j3]Stefan Kahrs:
Red-black trees with types. J. Funct. Program. 11(4): 425-432 (2001)
1990 – 1999
- 1998
- [c11]Stefan Kahrs, Donald Sannella
:
Reflections on the Design of a Specification language. FASE 1998: 154-170 - 1997
- [j2]Stefan Kahrs, Donald Sannella
, Andrzej Tarlecki
:
The Definition of Extended ML: A Gentle Introduction. Theor. Comput. Sci. 173(2): 445-484 (1997) - 1996
- [c10]Stefan Kahrs:
Limits of ML-Definability. PLILP 1996: 17-31 - 1995
- [j1]Stefan Kahrs:
Confluence of Curried Term-Rewriting Systems. J. Symb. Comput. 19(6): 601-623 (1995) - [c9]Stefan Kahrs:
The Variable Containment Problem. HOA 1995: 109-123 - [c8]Stefan Kahrs:
Towards a Domain Theory for Termination Proofs. RTA 1995: 241-255 - 1994
- [c7]Stefan Kahrs:
First-Class Polymorphism for ML. ESOP 1994: 333-347 - [c6]Stefan Kahrs, Donald Sannella
, Andrzej Tarlecki
:
Interfaces and Extended ML. Workshop on Interface Definition Languages 1994: 111-118 - 1993
- [c5]Stefan Kahrs:
Compilation of Combinatory Reduction Systems. HOA 1993: 169-188 - [c4]Stefan Kahrs:
PAnndA Standard Types and Predefined Type Schemata. PROSPECTRA Book 1993: 239-249 - [c3]Stefan Kahrs, Donald Sannella, Andrzej Tarlecki:
The Semantics of Extended ML: A Gentle Introduction. Semantics of Specification Languages 1993: 186-215 - 1992
- [c2]Stefan Kahrs:
Context Rewriting. CTRS 1992: 21-35 - [c1]Stefan Kahrs:
Unlimp, Uniqueness as a Leitmotiv for Implementation. PLILP 1992: 115-129 - 1991
- [b1]Stefan Kahrs:
λ-rewriting. University of Bremen, Germany, 1991, pp. 1-151
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint