BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × France
1 × Israel
1 × Spain
1 × Sweden
1 × The Netherlands
1 × United Kingdom
11 × USA
2 × Germany
Collaborated with:
D.V.Horn J.L.Lawall P.C.Kanellakis G.G.Hillebrand P.M.Neergaard X.Rival A.Asperti M.Y.Vardi F.Henglein A.J.Kfoury F.A.Turbak J.B.Wells H.Gaifman Y.Sagiv D.Dolev D.Maier J.D.Ullman
Talks about:
type (6) analysi (4) languag (3) optim (3) flow (3) proofnet (2) function (2) express (2) control (2) context (2)

Person: Harry G. Mairson

DBLP DBLP: Mairson:Harry_G=

Contributed to:

ICFP 20132013
ICFP 20082008
SAS 20082008
ICFP 20072007
ICFP 20042004
ICFP 20032003
CSL 20022002
ESOP 20002000
ICFP 19991999
POPL 19981998
ICFP 19971997
ICFP 19961996
ICALP 19941994
POPL 19931993
FPCA 19911991
PODS 19911991
POPL 19911991
POPL 19901990
LICS 19871987
STOC 19841984

Wrote 20 papers:

ICFP-2013-Mairson #functional #geometry
Functional geometry and the Traité de Lutherie: functional pearl (HGM), pp. 123–132.
Deciding kCFA is complete for EXPTIME (DVH, HGM), pp. 275–282.
SAS-2008-HornM #analysis
Flow Analysis, Linearity, and PTIME (DVH, HGM), pp. 255–269.
ICFP-2007-HornM #analysis #complexity #control flow #precise
Relating complexity and precision in control flow analysis (DVH, HGM), pp. 85–96.
ICFP-2004-NeergaardM #type system #why
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work (PMN, HGM), pp. 138–149.
ICFP-2003-Mairson #analysis #game studies #semantics
From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis (HGM), p. 125.
CSL-2002-MairsonR #semantics
Proofnets and Context Semantics for the Additives (HGM, XR), pp. 151–166.
ESOP-2000-LawallM #continuation
Sharing Continuations: Proofnets for Languages with Explicit Control (JLL, HGM), pp. 245–259.
ICFP-1999-KfouryMTW #type system
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (AJK, HGM, FAT, JBW), pp. 90–101.
POPL-1998-AspertiM #parallel #recursion #reduction
Parallel β Reduction is not Elementary Recursive (AA, HGM), pp. 303–315.
ICFP-1997-LawallM #graph #on the #reduction
On Global Dynamics of Optimal Graph Reduction (JLL, HGM), pp. 188–195.
ICFP-1996-LawallM #cost analysis #question #what #λ-calculus
Optimality and Inefficiency: What Isn’t a Cost Model of the λ Calculus? (JLL, HGM), pp. 92–101.
ICALP-1994-KanellakisHM #analysis #re-engineering
An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction (PCK, GGH, HGM), pp. 83–105.
POPL-1993-Mairson #logic #multi #type system
A Constructive Logic of Multiple Subtyping (HGM), pp. 313–324.
FPCA-1991-Mairson #parametricity #proving
Outline of a Proof Theory of Parametricity (HGM), pp. 313–327.
PODS-1991-HillebrandKMV #bound #datalog #tool support
Tools for Datalog Boundedness (GGH, PCK, HGM, MYV), pp. 1–12.
POPL-1991-HengleinM #complexity #higher-order #type inference #λ-calculus
The Complexity of Type Inference for Higher-Order Typed λ Calculi (FH, HGM), pp. 119–130.
POPL-1990-Mairson #exponential #ml
Deciding ML Typability is Complete for Deterministic Exponential Time (HGM), pp. 382–401.
LICS-1987-GaifmanMSV #database #decidability #logic programming #optimisation #problem #source code
Undecidable Optimization Problems for Database Logic Programs (HG, HGM, YS, MYV), pp. 106–115.
STOC-1984-DolevMMU #fault #memory management
Correcting Faults in Write-Once Memory (DD, DM, HGM, JDU), pp. 225–229.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.