BibSLEIGH — Robert

Travelled to:

1 × Brazil
1 × Estonia
1 × France
19 × USA
2 × Finland
2 × Italy
2 × Sweden
2 × United Kingdom
3 × Canada

Collaborated with:

D.R.Licata K.Crary G.E.Blelloch ∅ J.G.Morrisett B.C.Pierce M.Lillibridge P.Lee C.A.Stone J.C.Mitchell N.Zeilberger U.A.Acar P.Cheng D.Dreyer T.M.VII F.Pfenning H.Xi R.Pollack D.K.Lee Y.Mandelbaum D.Walker A.Nanevski S.Puri D.Tarditi Y.Minamide M.Felleisen B.F.Duba D.B.MacQueen E.Moggi D.Sannella A.Tarlecki F.Honsell G.D.Plotkin R.Milner M.Tofte C.Angiuli E.Morehouse D.Spoonhower P.B.Gibbons M.M.T.Chakravarty G.Keller L.Petersen E.Biagioni B.Milnes A.D.Gordon J.Harrison A.Jeffrey P.Sewell

Talks about:

type (15) comput (6) modul (6) ml (6) theori (5) program (4) polymorph (3) function (3) calculus (3) languag (3)

Person: Robert Harper

DBLP: Harper:Robert

Facilitated 1 volumes:

Contributed to:

2014

2013

2012

2011

2009

2008

2007

2005

2004

2003

2002

2001

2000

1999

1998

1996

1995

1994

1993

1991

1990

1989

1988

1987

1989

Wrote 42 papers:

ICFP-2014-AngiuliMLH #topic: Homotopical patch theory (CA, EM, DRL, RH), pp. 243–256.
POPL-2013-BlellochH #algorithm #functional: Cache and I/O efficent functional algorithms (GEB, RH), pp. 39–50.
POPL-2012-LicataH #2d #type system: Canonicity for 2-dimensional type theory (DRL, RH), pp. 337–348.
POPL-2011-GordonHHJS #concurrent #verification: Robin Milner 1934--2010: verification, languages, and concurrency (ADG, RH, JH, AJ, PS), pp. 473–474.
ICFP-2009-LicataH: A universe of binding and computation (DRL, RH), pp. 123–134.
TLCA-2009-HarperLZ #approach: A Pronominal Approach to Binding and Computation (RH, DRL, NZ), pp. 3–4.
ICFP-2008-SpoonhowerBHG #functional #parallel #profiling #source code: Space profiling for parallel functional programs (DS, GEB, RH, PBG), pp. 253–264.
LICS-2008-LicataZH: Focusing on Binding and Computation (DRL, NZ, RH), pp. 241–252.
POPL-2007-DreyerHCK #composition: Modular type classes (DD, RH, MMTC, GK), pp. 63–70.
POPL-2007-LeeCH #ml #standard #towards: Towards a mechanized metatheory of standard ML (DKL, KC, RH), pp. 173–184.
CSL-2005-VIICH #control flow #distributed #logic: Distributed Control Flow with Classical Modal Logic (TMV, KC, RH), pp. 51–69.
ICFP-2005-Harper #programming language: Mechanizing the meta-theory of programming languages (RH), p. 240.
ICALP-2004-Harper #self: Self-Adjusting Computation (RH), pp. 1–2.
LICS-2004-Harper #self: Self-Adjusting Computation (RH), pp. 254–255.
LICS-2004-VIICHP #distributed #symmetry #λ-calculus: A Symmetric Modal λ Calculus for Distributed Computing (TMV, KC, RH, FP), pp. 286–295.
ICFP-2003-MandelbaumWH #effectiveness: An effective theory of type refinements (YM, DW, RH), pp. 213–225.
POPL-2003-AcarBH: Selective memoization (UAA, GEB, RH), pp. 14–25.
POPL-2003-DreyerCH #higher-order #type system: A type system for higher-order modules (DD, KC, RH), pp. 236–249.
POPL-2003-PetersenHCP #layout #memory management #type system: A type theory for memory allocation and data layout (LP, RH, KC, FP), pp. 172–184.
POPL-2002-AcarBH #adaptation #functional #programming: Adaptive functional programming (UAA, GEB, RH), pp. 247–259.
ICFP-2001-NanevskiBH #automation #generative #geometry #staged: Automatic Generation of Staged Geometric Predicates (AN, GEB, RH), pp. 217–228.
ICFP-2001-XiH #assembly: A Dependently Typed Assembly Language (HX, RH), pp. 169–180.
ICFP-2000-HarperP: Advanced module systems: a guide for the perplexed (RH, BCP), p. 130.
POPL-2000-StoneH #equivalence: Deciding Type Equivalence with Singleton Kinds (CAS, RH), pp. 214–227.
PLDI-1999-CraryHP #question #recursion #what: What is a Recursive Module? (KC, RH, SP), pp. 50–63.
PLDI-1998-ChengHL #stack: Generational Stack Collection and Profile-Driven Pretenuring (PC, RH, PL), pp. 162–173.
Best-of-PLDI-1996-TarditiMCSHL96a #compilation #ml #named #optimisation: TIL: a type-directed, optimizing compiler for ML (with retrospective) (DT, JGM, PC, CAS, RH, PL), pp. 554–567.
PLDI-1996-TarditiMCSHL #compilation #ml #named #optimisation: TIL: A Type-Directed Optimizing Compiler for ML (DT, JGM, PC, CAS, RH, PL), pp. 181–192.
POPL-1996-MinamideMH: Typed Closure Conversion (YM, JGM, RH), pp. 271–283.
FPCA-1995-MorrisettFH #memory management #modelling: Abstract Models of Memory Management (JGM, MF, RH), pp. 66–77.
POPL-1995-HarperM #analysis #compilation #morphism #polymorphism #using: Compiling Polymorphism Using Intensional Type Analysis (RH, JGM), pp. 130–141.
LFP-1994-BiagioniHLM #ml #network #protocol #stack #standard: Signatures for a Network Protocol Stack: A Systems Application of Standard ML (EB, RH, PL, BM), pp. 55–64.
POPL-1994-HarperL #approach #higher-order: A Type-Theoretic Approach to Higher-Order Modules with Sharing (RH, ML), pp. 123–137.
POPL-1993-HarperL #continuation #morphism #polymorphism: Explicit Polymorphism and CPS Conversion (RH, ML), pp. 206–219.
POPL-1991-DubaHM #continuation #ml #type system: Typing First-Class Continuations in ML (BFD, RH, DBM), pp. 163–173.
POPL-1991-HarperP #calculus #symmetry: A Record Calculus Based on Symmetric Concatenation (RH, BCP), pp. 131–142.
POPL-1990-HarperMM #higher-order: Higher-Order Modules and the Phase Distinction (RH, JCM, EM), pp. 341–354.
LICS-1989-HarperST #representation: Structure and Representation in LF (RH, DS, AT), pp. 226–237.
POPL-1988-MitchellH #ml: The Essence of ML (JCM, RH), pp. 28–46.
LICS-1987-HarperHP #framework #logic: A Framework for Defining Logics (RH, FH, GDP), pp. 194–204.
CFLP-1987-HarperMT: A Type Discipline for Program Modules (RH, RM, MT), pp. 308–319.
CCIPL-1989-HarperP #ambiguity #calculus #morphism #polymorphism #type checking: Type Checking, Universe Polymorphism, and Typical Ambiguity in the Calculus of Constructions (Draft) (RH, RP), pp. 241–256.