# Harry G. Mairson

- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from

**public sources and our publisher partners.**Datalog is the language of logic programs without function symbols. It is used as a database query language. If it is possible to eliminate recursion from a Datalog program F’, then t’ is said to be… Expand

Abstract In this note, we reprove a theorem of Statman that deciding the βη-equality of two first-order typable λ-terms is not elementary recursive (Statman, 1982). The basic idea of our proof, like… Expand

Abstract A given Datalog program is bounded if its depth of recursion is independent of the input database. Deciding boundedness is a basic task for the analysis of database logic programs. The… Expand

We consider the problem of computing all intersections between two sets S and T of line segments in the plane, where no two segments in S (similarly, T) intersect. We present an asymptotically… Expand

Computational Logic - Essays in Honor of Alan…

We study the complexity of type reconstruction for a core fragment of ML with lambda abstraction, function application, and the polymorphic let declaration. We derive exponential upper and lower… Expand

Reynolds' Parametricity Theorem (also known as the Abstraction Theorem), a result concerning the model theory of the second order polymorphic typed λ-calculus (F2), has recently been used by Wadler… Expand

Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normalization and type… Expand

We give transparent proofs of the PTIME-completeness of two decision problems for terms in the λ-calculus. The first is a reproof of the theorem that type inference for the simply-typed λ-calculus is… Expand

A given Datalog program is bounded if its dependent of the input database) is interesting because depth of recursion is independent of the input database. Deciding boundedness is a basic task for the… Expand