Harry G. Mairson

According to our database1, Harry G. Mairson authored at least 41 papers between 1977 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2013
Deciding $k$CFA is complete for EXPTIME.
CoRR, 2013

Functional geometry and the Traité de Lutherie: functional pearl.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2008
Flow Analysis, Linearity, and PTIME.
Proceedings of the Static Analysis, 15th International Symposium, 2008

Deciding <i>k</i>CFA is complete for EXPTIME.
Proceedings of the Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, 2008

2007
Relating complexity and precision in control flow analysis.
Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, 2007

2005
Robert Paige (1947-1999).
High. Order Symb. Comput., 2005

Editorial.
High. Order Symb. Comput., 2005

2004
Linear lambda calculus and PTIME-completeness.
J. Funct. Program., 2004

Types, potency, and idempotency: why nonlinearity and amnesia make a type system work.
Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, 2004

2003
Editorial: Special Issue Dedicated to Bob Paige.
High. Order Symb. Comput., 2003

On the Computational Complexity of Cut-Elimination in Linear Logic.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis.
Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003

2002
From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

Proofnets and Context Semantics for the Additives.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001
Parallel Beta Reduction Is Not Elementary Recursive.
Inf. Comput., 2001

2000
Programming language foundations of computation theory.
ACM SIGSOFT Softw. Eng. Notes, 2000

Sharing Continuations: Proofnets for Languages with Explicit Control.
Proceedings of the Programming Languages and Systems, 2000

1999
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract).
Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), 1999

1997
on Global Dynamics of Optimal Graph Reduction.
Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP '97), 1997

1996
Database Query Languages Embedded in the Typed Lambda Calculus.
Inf. Comput., 1996

In Memoriam Paris C. Kanellakis.
ACM Comput. Surv., 1996

Optimality and Inefficiency: What Isn't a Cost Model of the Lambda Calculus?
Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, 1996

Complexity-Theoretic Aspects for Programming Language Design.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

1995
Undecidable Boundedness Problems for Datalog Programs.
J. Log. Program., 1995

1994
The Complexity of Type Inference for Higher-Order Typed lambda Calculi.
J. Funct. Program., 1994

Generating Words in a Context-Free Language Uniformly at Random.
Inf. Process. Lett., 1994

An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
Undecidable Optimization Problems for Database Logic Programs.
J. ACM, 1993

A Constructive Logic of Multiple Subtyping.
Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

1992
A Simple Proof of a Theorem of Statman.
Theor. Comput. Sci., 1992

Quantifier Elimination and Parametric Polymorphism in Programming Languages.
J. Funct. Program., 1992

The Effect of Table Expansion on the Program Complexity of Perfect Hash Funtions.
BIT, 1992

1991
Tools for Datalog Boundedness.
Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1991

Outline of a Proof Theory of Parametricity.
Proceedings of the Functional Programming Languages and Computer Architecture, 1991

Unification and ML-Type Reconstruction.
Proceedings of the Computational Logic - Essays in Honor of Alan Robinson, 1991

1990
Deciding ML Typability is Complete for Deterministic Exponential Time.
Proceedings of the Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990

1985
Average Case Lower Bounds on the Construction and Searching of Partial Orders
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
The program complexity of searching a table.
PhD thesis, 1984

Correcting Faults in Write-Once Memory
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983
The Program Complexity of Searching a Table
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1977
Some New Upper Bounds on the Generation of Prime Numbers.
Commun. ACM, 1977


  Loading...