#### Filter Results:

- Full text PDF available (18)

#### Publication Year

1977

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi
- LICS
- 1987

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â€¦ (More)

- Paris C. Kanellakis, Harry G. Mairson, John C. Mitchell
- Computational Logic - Essays in Honor of Alanâ€¦
- 1991

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â€¦ (More)

- Harry G. Mairson
- Theor. Comput. Sci.
- 1992

In this note, we reprove a theorem of Statman that deciding the-equality of two rst-order typable-terms is not elementary recursive Sta79]. The basic idea of our proof, like that of Statman's, is theâ€¦ (More)

We investigate finite-rank intersection type systems, analyzing the complexity of their type inference problems and their relation to the problem of recognizing semantically equivalent terms.â€¦ (More)

- Peter MÃ¸ller Neergaard, Harry G. Mairson
- ICFP
- 2004

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â€¦ (More)

- Harry G. Mairson
- J. Funct. Program.
- 2004

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 simplytyped Î»-calculus isâ€¦ (More)

We investigate the expressive power of the typed-calculus when expressing computations over nite structures, i.e., databases. We show that the simply typed-calculus can express various database queryâ€¦ (More)

- Julia L. Lawall, Harry G. Mairson
- ICFP
- 1996

We investigate the computational efficiency of the sharing graphs of Lamping [Lam90], Gonthier, Abadi, and Lévy [GAL92], and Asperti [Asp94], designed to effect so-called optimal evaluation,â€¦ (More)

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â€¦ (More)

- Harry G. Mairson
- FSTTCS
- 2002

We give a first-principles description of the context semantics of Gonthier, Abadi, and LÃ©vy, a computer-science analogue of Girardâ€™s geometry of interaction. We explain how this denotationalâ€¦ (More)