Hans Leiß

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 7

Top Topics

Pronoun Resolution

Top Venues

Math. Struct. Comput. Sci.

Publications

Mark Hopkins, Hans Leiß
'. CoRR (2023)
Mark Hopkins, Hans Leiß
-continuous Kleene Algebras $K\mathop {\otimes _\mathcal{R}}C_2'$. RAMiCS (2023)
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) (2022)
Hans Leiß, Mark Hopkins
C-Dioids and \mu -Continuous Chomsky-Algebras. RAMiCS (2018)
Mark Hopkins, Hans Leiß
Coequalizers and Tensor Products for Continuous Idempotent Semirings. RAMiCS (2018)
Hans Leiß
On Equality of Contexts and Completeness of the Indexed epsilon-Calculus. FLAP 4 (2) (2017)
Hans Leiß, Shuqian Wu
Type Reconstruction for \lambda -DRT Applied to Pronoun Resolution. LACL (2016)
Hans Leiß
Learning Context Free Grammars with the Finite Context Property: A Correction of A. Clark's Algorithm. FG (2014)
Hans Leiß
Resolving Plural Ambiguities by Type Reconstruction. FG (2011)
Martin Lange, Hans Leiß
To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm. Informatica Didact. 8 (2009)
Hans Leiß
Kleene modules and linear languages. J. Log. Algebraic Methods Program. 66 (2) (2006)
Zoltán Ésik, Hans Leiß
Algebraically complete semirings and Greibach normal form. Ann. Pure Appl. Log. 133 (1-3) (2005)
Foto N. Afrati, Hans Leiß, Michel de Rougemont
Definability and Compression. Fundam. Informaticae 56 (1-2) (2003)
Hans Leiß, Michel de Rougemont
Automata on Lempel-ziv Compressed Strings. CSL (2003)
Zoltán Ésik, Hans Leiß
Greibach Normal Form in Algebraically Complete Semirings. CSL (2002)
Hans Leiß
Kleenean semimodules and linear languages. FICS (2002)
Hans Leiß
Second-Order Pre-Logical Relations and Representation Independence. TLCA (2001)
Foto N. Afrati, Hans Leiß, Michel de Rougemont
Definability and Compression. LICS (2000)
Martin Emms, Hans Leiß
Extending the Type Checker of Standard ML by Polymorphic Recursion. Theor. Comput. Sci. 212 (1-2) (1999)
Hans Leiß
Bounded Fixed-Point Definability and Tabular Recognition of Languages. TAPD (1998)
Hans Leiß
Bounded Fixed-Point Definability and Tabular Recognition of Languages. CSL (1995)
Hans Leiß
Combining Recursive and Dynamic Types. TLCA (1993)
Hans Leiß, Fritz Henglein
A Decidable Case of the Semi-Unification Problem. MFCS (1991)
Hans Leiß
Towards Kleene Algebra with Recursion. CSL (1991)
Hans Leiß
Polymorphic Constructs in Natural and Programming Languages. JELIA (1990)
Hans Leiß
On Kilbury's Modification of Earley's Algorithm. ACM Trans. Program. Lang. Syst. 12 (4) (1990)
Hans Leiß
Polymorphic Recursion and Semi-Unification. CSL (1989)
Hans Leiß
On Type Inference for Object-Oriented Programming Languages. CSL (1987)