Hans Leiß

29 papers A* 1B 10C 3Journal 10Unranked 5
YearRankTypeTitle / Venue / Authors
2024 J jnl
Normal Forms for Elements of
Fundam. Informaticae
Mark Hopkins, Hans Leiß
2023 C conf
Normal Forms for Elements of the
RAMiCS
Mark Hopkins, Hans Leiß
2023 J jnl
Normal Forms for Elements of the
CoRR
Mark Hopkins, Hans Leiß
2022 J jnl
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras - A categorical Chomsky-Schützenberger theorem.
Math. Struct. Comput. Sci.
Hans Leiß
2018 C conf
C-Dioids and \mu -Continuous Chomsky-Algebras.
RAMiCS
Hans Leiß, Mark Hopkins
2018 C conf
Coequalizers and Tensor Products for Continuous Idempotent Semirings.
RAMiCS
Mark Hopkins, Hans Leiß
2017 J jnl
On Equality of Contexts and Completeness of the Indexed epsilon-Calculus.
FLAP
Hans Leiß
2016 — conf
Type Reconstruction for \lambda -DRT Applied to Pronoun Resolution.
LACL
Hans Leiß, Shuqian Wu
2014 B conf
Learning Context Free Grammars with the Finite Context Property: A Correction of A. Clark's Algorithm.
FG
Hans Leiß
2011 B conf
Resolving Plural Ambiguities by Type Reconstruction.
FG
Hans Leiß
2009 J jnl
To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm.
Informatica Didact.
Martin Lange, Hans Leiß
2006 J jnl
Kleene modules and linear languages.
J. Log. Algebraic Methods Program.
Hans Leiß
2005 J jnl
Algebraically complete semirings and Greibach normal form.
Ann. Pure Appl. Log.
Zoltán Ésik, Hans Leiß
2003 B conf
Automata on Lempel-ziv Compressed Strings.
CSL
Hans Leiß, Michel de Rougemont
2003 J jnl
Definability and Compression.
Fundam. Informaticae
Foto N. Afrati, Hans Leiß, Michel de Rougemont
2002 B conf
Greibach Normal Form in Algebraically Complete Semirings.
CSL
Zoltán Ésik, Hans Leiß
2002 — conf
Kleenean semimodules and linear languages.
FICS
Hans Leiß
2001 — conf
Second-Order Pre-Logical Relations and Representation Independence.
TLCA
Hans Leiß
2000 A* conf
Definability and Compression.
LICS
Foto N. Afrati, Hans Leiß, Michel de Rougemont
1999 J jnl
Extending the Type Checker of Standard ML by Polymorphic Recursion.
Theor. Comput. Sci.
Martin Emms, Hans Leiß
1998 — conf
Bounded Fixed-Point Definability and Tabular Recognition of Languages.
TAPD
Hans Leiß
1995 B conf
Bounded Fixed-Point Definability and Tabular Recognition of Languages.
CSL
Hans Leiß
1993 — conf
Combining Recursive and Dynamic Types.
TLCA
Hans Leiß
1991 B conf
A Decidable Case of the Semi-Unification Problem.
MFCS
Hans Leiß, Fritz Henglein
1991 B conf
Towards Kleene Algebra with Recursion.
CSL
Hans Leiß
1990 J jnl
On Kilbury's Modification of Earley's Algorithm.
ACM Trans. Program. Lang. Syst.
Hans Leiß
1990 B conf
Polymorphic Constructs in Natural and Programming Languages.
JELIA
Hans Leiß
1989 B conf
Polymorphic Recursion and Semi-Unification.
CSL
Hans Leiß
1987 B conf
On Type Inference for Object-Oriented Programming Languages.
CSL
Hans Leiß