Hans Leiß

According to our database, Hans Leiß authored at least 27 papers between 1987 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Normal Forms for Elements of the ^*-Continuous Kleene Algebras K ⊗_R C₂'.

Mark Hopkins, Hans Leiß

CoRR, 2023

Normal Forms for Elements of the ^*-continuous Kleene Algebras $K\mathop {\otimes _\mathcal{R}}C_2'$.

Mark Hopkins, Hans Leiß

Proceedings of the Relational and Algebraic Methods in Computer Science, 2023

2022

An algebraic representation of the fixed-point closure of *-continuous Kleene algebras - A categorical Chomsky-Schützenberger theorem.

Hans Leiß

Math. Struct. Comput. Sci., June, 2022

2018

C-Dioids and \mu -Continuous Chomsky-Algebras.

Hans Leiß, Mark Hopkins

Proceedings of the Relational and Algebraic Methods in Computer Science, 2018

Coequalizers and Tensor Products for Continuous Idempotent Semirings.

Mark Hopkins, Hans Leiß

Proceedings of the Relational and Algebraic Methods in Computer Science, 2018

2017

On Equality of Contexts and Completeness of the Indexed epsilon-Calculus.

Hans Leiß

FLAP, 2017

2016

Type Reconstruction for \lambda -DRT Applied to Pronoun Resolution.

Hans Leiß, Shuqian Wu

Proceedings of the Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996-2016), 2016

The Matrix Ring of a μ-Continuous Chomsky Algebra is mu-Continuous.

Hans Leiss

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2014

Learning Context Free Grammars with the Finite Context Property: A Correction of A. Clark's Algorithm.

Hans Leiß

Proceedings of the Formal Grammar - 19th International Conference, 2014

2011

Resolving Plural Ambiguities by Type Reconstruction.

Hans Leiß

Proceedings of the Formal Grammar, 2011

2009

To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm.

Martin Lange, Hans Leiß

Informatica Didact., 2009

2006

Kleene modules and linear languages.

Hans Leiß

J. Log. Algebraic Methods Program., 2006

2005

Algebraically complete semirings and Greibach normal form.

Zoltán Ésik, Hans Leiß

Ann. Pure Appl. Log., 2005

2003

Definability and Compression.

Foto N. Afrati, Hans Leiß, Michel de Rougemont

Fundam. Informaticae, 2003

Automata on Lempel-ziv Compressed Strings.

Hans Leiß, Michel de Rougemont

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002

Kleenean semimodules and linear languages.

Hans Leiß

Proceedings of the Fixed Points in Computer Science, 2002

Greibach Normal Form in Algebraically Complete Semirings.

Zoltán Ésik, Hans Leiß

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

Second-Order Pre-Logical Relations and Representation Independence.

Hans Leiß

Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

1999

Extending the Type Checker of Standard ML by Polymorphic Recursion.

Martin Emms, Hans Leiß

Theor. Comput. Sci., 1999

1998

Bounded Fixed-Point Definability and Tabular Recognition of Languages.

Hans Leiß

Proceedings of the 1st Workshop on Tabulation in Parsing and Deduction, 1998

1993

Combining Recursive and Dynamic Types.

Hans Leiß

Proceedings of the Typed Lambda Calculi and Applications, 1993

1991

A Decidable Case of the Semi-Unification Problem.

Hans Leiß, Fritz Henglein

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Towards Kleene Algebra with Recursion.

Hans Leiß

Proceedings of the Computer Science Logic, 5th Workshop, 1991

1990

On Kilbury's Modification of Earley's Algorithm.

Hans Leiß

ACM Trans. Program. Lang. Syst., 1990

Polymorphic Constructs in Natural and Programming Languages.

Hans Leiß

Proceedings of the Logics in AI, European Workshop, 1990

1989

Polymorphic Recursion and Semi-Unification.

Hans Leiß

Proceedings of the CSL '89, 1989

1987

On Type Inference for Object-Oriented Programming Languages.

Hans Leiß

Proceedings of the CSL '87, 1987