Harry G. Mairson

46 papers A* 11A 10B 2Journal 18Unranked 4

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