Harry G. Mairson

Publication Activity (10 Years)

Years Active: 1977-2013
Publications (10 Years): 0

Top Topics

Probabilistic Databases

Expressive Power

Top Venues

Publications

David Van Horn, Harry G. Mairson
Deciding $k$CFA is complete for EXPTIME. CoRR (2013)
Harry G. Mairson
Functional geometry and the Traité de Lutherie: functional pearl. ICFP (2013)
David Van Horn, Harry G. Mairson
Flow analysis, linearity, and PTIME. CoRR (2013)
David Van Horn, Harry G. Mairson
Flow Analysis, Linearity, and PTIME. SAS (2008)
David Van Horn, Harry G. Mairson
CFA is complete for EXPTIME. ICFP (2008)
David Van Horn, Harry G. Mairson
Relating complexity and precision in control flow analysis. ICFP (2007)
Harry G. Mairson
Robert Paige (1947-1999). High. Order Symb. Comput. 18 (1-2) (2005)
Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi
Editorial. High. Order Symb. Comput. 18 (1-2) (2005)
Harry G. Mairson
Linear lambda calculus and PTIME-completeness. J. Funct. Program. 14 (6) (2004)
Peter Møller Neergaard, Harry G. Mairson
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work. ICFP (2004)
Harry G. Mairson
From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis. SIGPLAN Notices (2003)
Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi
Editorial: Special Issue Dedicated to Bob Paige. High. Order Symb. Comput. 16 (1-2) (2003)
Harry G. Mairson, Kazushige Terui
On the Computational Complexity of Cut-Elimination in Linear Logic. ICTCS (2003)
Harry G. Mairson
From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis. ICFP (2003)
Harry G. Mairson, Xavier Rival
Proofnets and Context Semantics for the Additives. CSL (2002)
Harry G. Mairson
From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple. FSTTCS (2002)
Andrea Asperti, Harry G. Mairson
Parallel Beta Reduction Is Not Elementary Recursive. Inf. Comput. 170 (1) (2001)
Harry G. Mairson
Programming language foundations of computation theory. ACM SIGSOFT Softw. Eng. Notes 25 (1) (2000)
Julia L. Lawall, Harry G. Mairson
Sharing Continuations: Proofnets for Languages with Explicit Control. ESOP (2000)
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Turbak, J. B. Wells
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract). ICFP (1999)
Andrea Asperti, Harry G. Mairson
Parallel Beta Reduction is not Elementary Recursive. POPL (1998)
Julia L. Lawall, Harry G. Mairson
on Global Dynamics of Optimal Graph Reduction. ICFP (1997)
Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson
Database Query Languages Embedded in the Typed Lambda Calculus. Inf. Comput. 127 (2) (1996)
Harry G. Mairson
Complexity-Theoretic Aspects for Programming Language Design. CP (1996)
Serge Abiteboul, Gabriel M. Kuper, Harry G. Mairson, Alexander A. Shvartsman, Moshe Y. Vardi
In Memoriam Paris C. Kanellakis. ACM Comput. Surv. 28 (1) (1996)
Julia L. Lawall, Harry G. Mairson
Optimality and Inefficiency: What Isn't a Cost Model of the Lambda Calculus? ICFP (1996)
Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi
Undecidable Boundedness Problems for Datalog Programs. J. Log. Program. 25 (2) (1995)
Fritz Henglein, Harry G. Mairson
The Complexity of Type Inference for Higher-Order Typed lambda Calculi. J. Funct. Program. 4 (4) (1994)
Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson
An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction. ICALP (1994)
Harry G. Mairson
Generating Words in a Context-Free Language Uniformly at Random. Inf. Process. Lett. 49 (2) (1994)
Harry G. Mairson
A Constructive Logic of Multiple Subtyping. POPL (1993)
Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi
Undecidable Optimization Problems for Database Logic Programs. J. ACM 40 (3) (1993)
Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson
Database Query Languages Embedded in the Typed Lambda Calculus LICS (1993)
Harry G. Mairson
Quantifier Elimination and Parametric Polymorphism in Programming Languages. J. Funct. Program. 2 (2) (1992)
Harry G. Mairson
The Effect of Table Expansion on the Program Complexity of Perfect Hash Funtions. BIT 32 (3) (1992)
Harry G. Mairson
A Simple Proof of a Theorem of Statman. Theor. Comput. Sci. 103 (2) (1992)
Paris C. Kanellakis, Harry G. Mairson, John C. Mitchell
Unification and ML-Type Reconstruction. Computational Logic - Essays in Honor of Alan Robinson (1991)
Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi
Tools for Datalog Boundedness. PODS (1991)
Harry G. Mairson
Outline of a Proof Theory of Parametricity. FPCA (1991)
Fritz Henglein, Harry G. Mairson
The Complexity of Type Inference for Higher-Order Typed Lambda Calculi. POPL (1991)
Harry G. Mairson
Deciding ML Typability is Complete for Deterministic Exponential Time. POPL (1990)
Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi
Undecidable Optimization Problems for Database Logic Programs LICS (1987)
Harry G. Mairson
Average Case Lower Bounds on the Construction and Searching of Partial Orders FOCS (1985)
Danny Dolev, David Maier, Harry G. Mairson, Jeffrey D. Ullman
Correcting Faults in Write-Once Memory STOC (1984)
Harry G. Mairson
The Program Complexity of Searching a Table FOCS (1983)
Harry G. Mairson
Some New Upper Bounds on the Generation of Prime Numbers. Commun. ACM 20 (9) (1977)