default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans Leiß
Person information
- affiliation: Ludwig-Maximilians-Universität München, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j8]Hans Leiß
:
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras - A categorical Chomsky-Schützenberger theorem. Math. Struct. Comput. Sci. 32(6): 685-728 (2022)- 2017
- [j7]Hans Leiß:
On Equality of Contexts and Completeness of the Indexed epsilon-Calculus. FLAP 4(2) (2017) - 2009
- [j6]Martin Lange, Hans Leiß:
To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm. Informatica Didact. 8 (2009) - 2006
- [j5]Hans Leiß:
Kleene modules and linear languages. J. Log. Algebraic Methods Program. 66(2): 185-194 (2006) - 2005
- [j4]Zoltán Ésik, Hans Leiß:
Algebraically complete semirings and Greibach normal form. Ann. Pure Appl. Log. 133(1-3): 173-203 (2005) - 2003
- [j3]Foto N. Afrati, Hans Leiß, Michel de Rougemont:
Definability and Compression. Fundam. Informaticae 56(1-2): 155-180 (2003) - 1999
- [j2]Martin Emms, Hans Leiß:
Extending the Type Checker of Standard ML by Polymorphic Recursion. Theor. Comput. Sci. 212(1-2): 157-181 (1999) - 1990
- [j1]Hans Leiß:
On Kilbury's Modification of Earley's Algorithm. ACM Trans. Program. Lang. Syst. 12(4): 610-640 (1990)
Conference and Workshop Papers
- 2023
- [c20]Mark Hopkins, Hans Leiß:
Normal Forms for Elements of the *-continuous Kleene Algebras $K\mathop {\otimes _\mathcal{R}}C_2'$. RAMiCS 2023: 122-139 - 2018
- [c19]Hans Leiß, Mark Hopkins:
C-Dioids and \mu -Continuous Chomsky-Algebras. RAMiCS 2018: 21-36 - [c18]Mark Hopkins, Hans Leiß:
Coequalizers and Tensor Products for Continuous Idempotent Semirings. RAMiCS 2018: 37-52 - 2016
- [c17]Hans Leiss:
The Matrix Ring of a μ-Continuous Chomsky Algebra is mu-Continuous. CSL 2016: 6:1-6:15 - [c16]Hans Leiß, Shuqian Wu:
Type Reconstruction for \lambda -DRT Applied to Pronoun Resolution. LACL 2016: 149-174 - 2014
- [c15]Hans Leiß:
Learning Context Free Grammars with the Finite Context Property: A Correction of A. Clark's Algorithm. FG 2014: 121-137 - 2011
- [c14]Hans Leiß:
Resolving Plural Ambiguities by Type Reconstruction. FG 2011: 267-286 - 2003
- [c13]Hans Leiß, Michel de Rougemont:
Automata on Lempel-ziv Compressed Strings. CSL 2003: 384-396 - 2002
- [c12]Zoltán Ésik, Hans Leiß:
Greibach Normal Form in Algebraically Complete Semirings. CSL 2002: 135-150 - [c11]Hans Leiß:
Kleenean semimodules and linear languages. FICS 2002: 51-53 - 2001
- [c10]Hans Leiß:
Second-Order Pre-Logical Relations and Representation Independence. TLCA 2001: 298-314 - 2000
- [c9]Foto N. Afrati, Hans Leiß, Michel de Rougemont:
Definability and Compression. LICS 2000: 63-73 - 1998
- [c8]Hans Leiß:
Bounded Fixed-Point Definability and Tabular Recognition of Languages. TAPD 1998: 96-107 - 1995
- [c7]Hans Leiß:
Bounded Fixed-Point Definability and Tabular Recognition of Languages. CSL 1995: 388-402 - 1993
- [c6]Hans Leiß:
Combining Recursive and Dynamic Types. TLCA 1993: 258-273 - 1991
- [c5]Hans Leiß:
Towards Kleene Algebra with Recursion. CSL 1991: 242-256 - [c4]Hans Leiß, Fritz Henglein:
A Decidable Case of the Semi-Unification Problem. MFCS 1991: 318-327 - 1990
- [c3]Hans Leiß:
Polymorphic Constructs in Natural and Programming Languages. JELIA 1990: 348-365 - 1989
- [c2]Hans Leiß:
Polymorphic Recursion and Semi-Unification. CSL 1989: 211-224 - 1987
- [c1]Hans Leiß:
On Type Inference for Object-Oriented Programming Languages. CSL 1987: 151-172
Informal and Other Publications
- 2023
- [i1]Mark Hopkins, Hans Leiß:
Normal Forms for Elements of the *-Continuous Kleene Algebras K ⊗R C2'. CoRR abs/2310.17295 (2023)
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-04-25 05:45 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:
