 | 2010 |
|---|
| 96 |       | Kumar Avijit,
Anupam Datta,
Robert Harper:
Distributed programming with distributed authorization.
TLDI 2010: 27-38 |
| 2009 |
|---|
| 95 | | Daniel R. Licata,
Robert Harper:
A universe of binding and computation.
ICFP 2009: 123-134 |
| 94 | | Daniel R. Licata,
Robert Harper:
Positively dependent types.
PLPV 2009: 3-14 |
| 93 | | Mark W. Bailey,
Kim B. Bruce,
Kathleen Fisher,
Robert Harper,
Stuart Reges:
Report of the 2008 SIGPLAN programming languages curriculum workshop: preliminary report.
SIGCSE 2009: 132-133 |
| 92 | | Daniel Spoonhower,
Guy E. Blelloch,
Phillip B. Gibbons,
Robert Harper:
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures.
SPAA 2009: 91-100 |
| 91 | | Robert Harper,
Daniel R. Licata,
Noam Zeilberger:
A Pronominal Approach to Binding and Computation.
TLCA 2009: 3-4 |
| 90 | | Robert Harper:
FUNCTIONAL PEARL. Proof-directed debugging - Corrigendum.
J. Funct. Program. 19(2): 262 (2009) |
| 2008 |
|---|
| 89 | | Daniel Spoonhower,
Guy E. Blelloch,
Robert Harper,
Phillip B. Gibbons:
Space profiling for parallel functional programs.
ICFP 2008: 253-264 |
| 88 | | Daniel R. Licata,
Noam Zeilberger,
Robert Harper:
Focusing on Binding and Computation.
LICS 2008: 241-252 |
| 87 | | Ryan Eccles,
Thomas Kapler,
Robert Harper,
William Wright:
Stories in GeoTime.
Information Visualization 7(1): 3-17 (2008) |
| 86 | | Eric Allen,
Mark W. Bailey,
Rastislav Bodík,
Kim B. Bruce,
Kathleen Fisher,
Stephen N. Freund,
Robert Harper,
Chandra Krintz,
Shriram Krishnamurthi,
James R. Larus,
Doug Lea,
Gary T. Leavens,
Lori L. Pollock,
Stuart Reges,
Martin C. Rinard,
Mark A. Sheldon,
Franklyn A. Turbak,
Mitchell Wand:
SIGPLAN programming language curriculum workshop: Discussion Summaries and recommendations.
SIGPLAN Notices 43(11): 6-29 (2008) |
| 85 | | Robert Harper:
Position paper: practical foundations for lrogramming languages.
SIGPLAN Notices 43(11): 71-73 (2008) |
| 2007 |
|---|
| 84 | | Daniel K. Lee,
Karl Crary,
Robert Harper:
Towards a mechanized metatheory of standard ML.
POPL 2007: 173-184 |
| 83 | | Derek Dreyer,
Robert Harper,
Manuel M. T. Chakravarty,
Gabriele Keller:
Modular type classes.
POPL 2007: 63-70 |
| 82 | | Tom Murphy VII,
Karl Crary,
Robert Harper:
Type-Safe Distributed Programming with ML5.
TGC 2007: 108-123 |
| 81 | | Karl Crary,
Robert Harper:
Syntactic Logical Relations for Polymorphic and Recursive Types.
Electr. Notes Theor. Comput. Sci. 172: 259-299 (2007) |
| 80 | | Pascale Proulx,
Lynn Chien,
Robert Harper,
David Schroh,
Thomas Kapler,
David Jonker,
William Wright:
nSpace and GeoTime: A VAST 2006 Case Study.
IEEE Computer Graphics and Applications 27(5): 46-56 (2007) |
| 79 | | Robert Harper,
Daniel R. Licata:
Mechanizing metatheory in a logical framework.
J. Funct. Program. 17(4-5): 613-673 (2007) |
| 2006 |
|---|
| 78 | | John Ainsworth,
Robert Harper,
Ismael Juma,
Iain E. Buchan:
PsyGrid: Applying e-Science to Epidemiology.
CBMS 2006: 727-732 |
| 77 | | David Swasey,
Tom Murphy VII,
Karl Crary,
Robert Harper:
A separate compilation extension to standard ML.
ML 2006: 32-42 |
| 76 | | Christopher A. Stone,
Robert Harper:
Extensional equivalence and singleton types.
ACM Trans. Comput. Log. 7(4): 676-722 (2006) |
| 75 | | Umut A. Acar,
Guy E. Blelloch,
Robert Harper:
Adaptive functional programming.
ACM Trans. Program. Lang. Syst. 28(6): 990-1034 (2006) |
| 74 | | Karl Crary,
Robert Harper:
Logic Column 16: Higher-Order Abstract Syntax: Setting the Record Straight
CoRR abs/cs/0607141: (2006) |
| 73 | | Umut A. Acar,
Guy E. Blelloch,
Matthias Blume,
Robert Harper,
Kanat Tangwongsan:
A Library for Self-Adjusting Computation.
Electr. Notes Theor. Comput. Sci. 148(2): 127-154 (2006) |
| 72 | | Karl Crary,
Robert Harper:
Higher-order abstract syntax: setting the record straight.
SIGACT News 37(3): 93-96 (2006) |
| 2005 |
|---|
| 71 | | Tom Murphy VII,
Karl Crary,
Robert Harper:
Distributed Control Flow with Classical Modal Logic.
CSL 2005: 51-69 |
| 70 | | Robert Harper:
Mechanizing the meta-theory of programming languages.
ICFP 2005: 240 |
| 69 | | Adam J. Chlipala,
Leaf Petersen,
Robert Harper:
Strict bidirectional type checking.
TLDI 2005: 71-78 |
| 68 | | Daniel Spoonhower,
Guy E. Blelloch,
Robert Harper:
Using page residency to balance tradeoffs in tracing garbage collection.
VEE 2005: 57-67 |
| 67 | | Robert Harper,
Frank Pfenning:
On equivalence and canonical forms in the LF type theory.
ACM Trans. Comput. Log. 6(1): 61-101 (2005) |
| 2004 |
|---|
| 66 | | Robert Harper:
Self-Adjusting Computation.
ICALP 2004: 1-2 |
| 65 | | Robert Harper:
Self-Adjusting Computation.
LICS 2004: 254-255 |
| 64 | | Tom Murphy VII,
Karl Crary,
Robert Harper,
Frank Pfenning:
A Symmetric Modal Lambda Calculus for Distributed Computing.
LICS 2004: 286-295 |
| 63 | | Umut A. Acar,
Guy E. Blelloch,
Robert Harper,
Jorge L. Vittes,
Shan Leung Maverick Woo:
Dynamizing static algorithms, with applications to dynamic trees and history independence.
SODA 2004: 531-540 |
| 62 | | David A. Basin,
Olivier Danvy,
Robert Harper:
Editorial.
Higher-Order and Symbolic Computation 17(3): 171-171 (2004) |
| 2003 |
|---|
| 61 | | Yitzhak Mandelbaum,
David Walker,
Robert Harper:
An effective theory of type refinements.
ICFP 2003: 213-225 |
| 60 | | Umut A. Acar,
Guy E. Blelloch,
Robert Harper:
Selective memoization.
POPL 2003: 14-25 |
| 59 | | Leaf Petersen,
Robert Harper,
Karl Crary,
Frank Pfenning:
A type theory for memory allocation and data layout.
POPL 2003: 172-184 |
| 58 | | Derek Dreyer,
Karl Crary,
Robert Harper:
A type system for higher-order modules.
POPL 2003: 236-249 |
| 57 | | Joseph Vanderwaart,
Derek Dreyer,
Leaf Petersen,
Karl Crary,
Robert Harper,
Perry Cheng:
Typed compilation of recursive datatypes.
TLDI 2003: 98-108 |
| 56 | | Aleksandar Nanevski,
Guy E. Blelloch,
Robert Harper:
Automatic Generation of Staged Geometric Predicates.
Higher-Order and Symbolic Computation 16(4): 379-400 (2003) |
| 55 | | Yitzhak Mandelbaum,
David Walker,
Robert Harper:
An effective theory of type refinements.
SIGPLAN Notices 38(9): 213-225 (2003) |
| 54 |  | Christopher Colby,
Karl Crary,
Robert Harper,
Peter Lee,
Frank Pfenning:
Automated techniques for provably safe mobile code.
Theor. Comput. Sci. 290(2): 1175-1199 (2003) |
| 2002 |
|---|
| 53 | | Bor-Yuh Evan Chang,
Karl Crary,
Margaret DeLap,
Robert Harper,
Jason Liszka,
Tom Murphy VII,
Frank Pfenning:
Trustless Grid Computing in ConCert.
GRID 2002: 112-125 |
| 52 | | Umut A. Acar,
Guy E. Blelloch,
Robert Harper:
Adaptive functional programming.
POPL 2002: 247-259 |
| 2001 |
|---|
| 51 | | Robert Harper:
Types in Compilation, Third International Workshop, TIC 2000, Montreal, Canada, September 21, 2000, Revised Selected Papers
Springer 2001 |
| 50 | | Hongwei Xi,
Robert Harper:
A Dependently Typed Assembly Language.
ICFP 2001: 169-180 |
| 49 | | Aleksandar Nanevski,
Guy E. Blelloch,
Robert Harper:
Automatic Generation of Staged Geometric Predicates.
ICFP 2001: 217-228 |
| 48 | | Fred B. Schneider,
J. Gregory Morrisett,
Robert Harper:
A Language-Based Approach to Security.
Informatics 2001: 86-101 |
| 47 | | Joseph Y. Halpern,
Robert Harper,
Neil Immerman,
Phokion G. Kolaitis,
Moshe Y. Vardi,
Victor Vianu:
On the unusual effectiveness of logic in computer science.
Bulletin of Symbolic Logic 7(2): 213-236 (2001) |
| 46 | | Robert Harper,
Frank Pfenning:
On Equivalence and Canonical Forms in the LF Type Theory
CoRR cs.LO/0110028: (2001) |
| 45 | | Edoardo Biagioni,
Robert Harper,
Peter Lee:
A Network Protocol Stack in Standard ML.
Higher-Order and Symbolic Computation 14(4): 309-356 (2001) |
| 44 | | Guy E. Blelloch,
Hal Burch,
Karl Crary,
Robert Harper,
Gary L. Miller,
Noel Walkington:
Persistent triangulations Journal of Functional Programming.
J. Funct. Program. 11(5): 441-466 (2001) |
| 2000 |
|---|
| 43 | | Robert Harper,
Benjamin C. Pierce:
Advanced module systems: a guide for the perplexed (abstract of invited talk).
ICFP 2000: 130 |
| 42 | | Christopher A. Stone,
Robert Harper:
Deciding Type Equivalence with Singleton Kinds.
POPL 2000: 214-227 |
| 41 | | Robert Harper,
Christopher A. Stone:
A type-theoretic interpretation of standard ML.
Proof, Language, and Interaction 2000: 341-388 |
| 1999 |
|---|
| 40 | | Karl Crary,
Robert Harper,
Sidd Puri:
What is a Recursive Module?
PLDI 1999: 50-63 |
| 39 | | Lars Birkedal,
Robert Harper:
Relational Interpretations of Recursive Types in an Operational Setting.
Inf. Comput. 155(1-2): 3-63 (1999) |
| 38 | | Robert Harper,
John C. Mitchell:
Parametricity and Variants of Girard's J Operator.
Inf. Process. Lett. 70(1): 1-5 (1999) |
| 37 | | Robert Harper:
Proof-Directed Debugging.
J. Funct. Program. 9(4): 463-469 (1999) |
| 1998 |
|---|
| 36 | | Perry Cheng,
Robert Harper,
Peter Lee:
Generational Stack Collection and Profile-Driven Pretenuring.
PLDI 1998: 162-173 |
| 35 | | Andrew Bernard,
Robert Harper,
Peter Lee:
How Generic is a Generic Black End? Using MLRISC as a Black End for the TIL Compiler.
Types in Compilation 1998: 53-77 |
| 34 | | Robert Harper,
Frank Pfenning:
A Module System for a Programming Language Based on the LF Logical Framework.
J. Log. Comput. 8(1): 5-31 (1998) |
| 1997 |
|---|
| 33 | | Lars Birkedal,
Robert Harper:
Relational Interpretations of Recursive Types in an operational Setting (Summary).
TACS 1997: 458-490 |
| 32 | | J. Gregory Morrisett,
Robert Harper:
Typed Closure Conversion for Recursively-Defined Functions.
Electr. Notes Theor. Comput. Sci. 10: (1997) |
| 31 | | Robert Harper,
John C. Mitchell:
ML and Beyond.
SIGPLAN Notices 32(1): 80-85 (1997) |
| 1996 |
|---|
| 30 | | David Tarditi,
J. Gregory Morrisett,
Perry Cheng,
Christopher A. Stone,
Robert Harper,
Peter Lee:
TIL: a type-directed, optimizing compiler for ML (with retrospective)
Best of PLDI 1996: 554-567 |
| 29 | | David Tarditi,
J. Gregory Morrisett,
Perry Cheng,
Christopher A. Stone,
Robert Harper,
Peter Lee:
TIL: A Type-Directed Optimizing Compiler for ML.
PLDI 1996: 181-192 |
| 28 | | Yasuhiko Minamide,
J. Gregory Morrisett,
Robert Harper:
Typed Closure Conversion.
POPL 1996: 271-283 |
| 27 | | Robert Harper,
Peter Lee:
Research in Programming Languages for Composability, Safety, and Performance.
ACM Comput. Surv. 28(4es): 195 (1996) |
| 26 | | Robert Harper,
John C. Mitchell:
ML and Beyond.
ACM Comput. Surv. 28(4es): 219 (1996) |
| 25 | | Robert Harper:
A Note on ``A Simplified Account of Polymorphic References''.
Inf. Process. Lett. 57(1): 15-16 (1996) |
| 24 | | Robert Harper,
Mark Lillibridge:
Operational Interpretations of an Extension of Fomega with Control Operators.
J. Funct. Program. 6(3): 393-417 (1996) |
| 1995 |
|---|
| 23 | | J. Gregory Morrisett,
Matthias Felleisen,
Robert Harper:
Abstract Models of Memory Management.
FPCA 1995: 66-77 |
| 22 | | Robert Harper,
J. Gregory Morrisett:
Compiling Polymorphism Using Intensional Type Analysis.
POPL 1995: 130-141 |
| 1994 |
|---|
| 21 | | Edoardo Biagioni,
Robert Harper,
Peter Lee,
Brian Milnes:
Signatures for a Network Protocol Stack: A Systems Application of Standard ML.
LISP and Functional Programming 1994: 55-64 |
| 20 | | Robert Harper,
Mark Lillibridge:
A Type-Theoretic Approach to Higher-Order Modules with Sharing.
POPL 1994: 123-137 |
| 19 | | Robert Harper,
Donald Sannella,
Andrzej Tarlecki:
Structured Theory Presentations and Logic Representations.
Ann. Pure Appl. Logic 67(1-3): 113-160 (1994) |
| 18 | | Robert Harper:
A Simplified Account of Polymorphic References.
Inf. Process. Lett. 51(4): 201-206 (1994) |
| 1993 |
|---|
| 17 | | Robert Harper,
Mark Lillibridge:
Explicit Polymorphism and CPS Conversion.
POPL 1993: 206-219 |
| 16 | | Robert Harper,
John C. Mitchell:
On the Type Structure of Standard ML.
ACM Trans. Program. Lang. Syst. 15(2): 211-252 (1993) |
| 15 | | Robert Harper,
Furio Honsell,
Gordon D. Plotkin:
A Framework for Defining Logics.
J. ACM 40(1): 143-184 (1993) |
| 14 | | Robert Harper,
Bruce F. Duba,
David B. MacQueen:
Typing First-Class Continuations in ML.
J. Funct. Program. 3(4): 465-484 (1993) |
| 13 | | Robert Harper,
Mark Lillibridge:
Polymorphic Type Assignment and CPS Conversion.
Lisp and Symbolic Computation 6(3-4): 361-380 (1993) |
| 1992 |
|---|
| 12 | | Robert Harper:
Constructing Type Systems over an Operational Semantics.
J. Symb. Comput. 14(1): 71-84 (1992) |
| 1991 |
|---|
| 11 | | Robert Harper,
Benjamin C. Pierce:
A Record Calculus Based on Symmetric Concatenation.
POPL 1991: 131-142 |
| 10 | | Bruce F. Duba,
Robert Harper,
David B. MacQueen:
Typing First-Class Continuations in ML.
POPL 1991: 163-173 |
| 9 | | Robert Harper,
Robert Pollack:
Type Checking with Universes.
Theor. Comput. Sci. 89(1): 107-136 (1991) |
| 1990 |
|---|
| 8 | | Robert Harper,
John C. Mitchell,
Eugenio Moggi:
Higher-Order Modules and the Phase Distinction.
POPL 1990: 341-354 |
| 1989 |
|---|
| 7 | | Robert Harper,
Donald Sannella,
Andrzej Tarlecki:
Logic Representation in LF.
Category Theory and Computer Science 1989: 250-272 |
| 6 | | Robert Harper,
Donald Sannella,
Andrzej Tarlecki:
Structure and Representation in LF
LICS 1989: 226-237 |
| 5 | | Robert Harper,
Robert Pollack:
Type Checking, Universe Polymorphism, and Typical Ambiguity in the Calculus of Constructions (Draft).
TAPSOFT, Vol.2 1989: 241-256 |
| 1988 |
|---|
| 4 | | John C. Mitchell,
Robert Harper:
The Essence of ML.
POPL 1988: 28-46 |
| 1987 |
|---|
| 3 | | Robert Harper,
Furio Honsell,
Gordon D. Plotkin:
A Framework for Defining Logics
LICS 1987: 194-204 |
| 2 | | Robert Harper,
Robin Milner,
Mads Tofte:
A Type Discipline for Program Modules.
TAPSOFT, Vol.2 1987: 308-319 |
| 1985 |
|---|
| 1 | | Robert Harper:
Modules and Persistence in Standard ML.
Data Types and Persistence (Appin) 1985: 21-30 |
