![]() | 2010 | |
---|---|---|
105 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Greenberg, Benjamin C. Pierce, Stephanie Weirich: Contracts made manifest. POPL 2010: 353-364 |
2009 | ||
104 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhong Shao, Benjamin C. Pierce: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009 ACM 2009 |
103 | ![]() ![]() ![]() ![]() ![]() ![]() | Aaron Bohannon, Benjamin C. Pierce, Vilhelm Sjöberg, Stephanie Weirich, Steve Zdancewic: Reactive noninterference. ACM Conference on Computer and Communications Security 2009: 79-90 |
102 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Nathan Foster, Benjamin C. Pierce, Steve Zdancewic: Updatable Security Views. CSF 2009: 60-74 |
101 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce: Lambda, the ultimate TA: using a proof assistant to teach programming language foundations. ICFP 2009: 121-122 |
100 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce: Foundations for Bidirectional Programming. ICMT 2009: 1-3 |
99 | ![]() ![]() ![]() ![]() ![]() ![]() | Véronique Benzaken, Giuseppe Castagna, Haruo Hosoya, Benjamin C. Pierce, Stijn Vansummeren: XML Typechecking. Encyclopedia of Database Systems 2009: 3646-3650 |
2008 | ||
98 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Nathan Foster, Alexandre Pilkiewicz, Benjamin C. Pierce: Quotient lenses. ICFP 2008: 383-396 |
97 | ![]() ![]() ![]() ![]() ![]() ![]() | Brian E. Aydemir, Arthur Charguéraud, Benjamin C. Pierce, Randy Pollack, Stephanie Weirich: Engineering formal metatheory. POPL 2008: 3-15 |
96 | ![]() ![]() ![]() ![]() ![]() ![]() | Aaron Bohannon, J. Nathan Foster, Benjamin C. Pierce, Alexandre Pilkiewicz, Alan Schmitt: Boomerang: resourceful lenses for string data. POPL 2008: 407-419 |
2007 | ||
95 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce: Adventures in Bidirectional Programming. FSTTCS 2007: 21-22 |
94 | ![]() ![]() ![]() ![]() ![]() ![]() | Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce: A Formal Investigation of. FSTTCS 2007: 485-496 |
93 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Nathan Foster, Benjamin C. Pierce, Alan Schmitt: A Logic Your Typechecker Can Count On: Unordered Tree Types in Practice. PLAN-X 2007: 80-90 |
92 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Nathan Foster, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, Alan Schmitt: Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem. ACM Trans. Program. Lang. Syst. 29(3): (2007) |
91 | ![]() ![]() ![]() ![]() ![]() ![]() | Eijiro Sumii, Benjamin C. Pierce: A bisimulation for type abstraction and recursion. J. ACM 54(5): (2007) |
90 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Nathan Foster, Michael B. Greenwald, Christian Kirkegaard, Benjamin C. Pierce, Alan Schmitt: Exploiting schemas in data synchronization. J. Comput. Syst. Sci. 73(4): 669-689 (2007) |
89 | ![]() ![]() ![]() ![]() ![]() ![]() | Matthew Flatt, Benjamin C. Pierce: Preface. J. Funct. Program. 17(4-5): 431 (2007) |
88 | ![]() ![]() ![]() ![]() ![]() ![]() | Eijiro Sumii, Benjamin C. Pierce: A bisimulation for dynamic sealing. Theor. Comput. Sci. 375(1-3): 169-192 (2007) |
2006 | ||
87 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael B. Greenwald, Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce, Alan Schmitt: Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data. DISC 2006: 269-283 |
86 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce: The Weird World of Bi-directional Programming. ESOP 2006: 342-342 |
85 | ![]() ![]() ![]() ![]() ![]() ![]() | Vladimir Gapeyev, François Garillot, Benjamin C. Pierce: Statically Typed Document Transformation: An Xtatic Experience. PLAN-X 2006: 2-13 |
84 | ![]() ![]() ![]() ![]() ![]() ![]() | Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pierce, Alan Schmitt: XTATIC. PLAN-X 2006: 88 |
83 | ![]() ![]() ![]() ![]() ![]() ![]() | Aaron Bohannon, Benjamin C. Pierce, Jeffrey A. Vaughan: Relational lenses: a language for updatable views. PODS 2006: 338-347 |
2005 | ||
82 | ![]() ![]() ![]() ![]() ![]() ![]() | Olivier Danvy, Benjamin C. Pierce: Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, ICFP 2005, Tallinn, Estonia, September 26-28, 2005 ACM 2005 |
81 | ![]() ![]() ![]() ![]() ![]() ![]() | Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pierce, Alan Schmitt: XML Goes Native: Run-Time Representations for Xtatic. CC 2005: 43-58 |
80 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Y. Levin, Benjamin C. Pierce: Type-Based Optimization for Regular Patterns. DBPL 2005: 184-198 |
79 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Nathan Foster, Michael B. Greenwald, Christian Kirkegaard, Benjamin C. Pierce, Alan Schmitt: Exploiting Schemas in Data Synchronization. DBPL 2005: 42-57 |
78 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Nathan Foster, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, Alan Schmitt: Combinators for bi-directional tree transformations: a linguistic approach to the view update problem. POPL 2005: 233-246 |
77 | ![]() ![]() ![]() ![]() ![]() ![]() | Eijiro Sumii, Benjamin C. Pierce: A bisimulation for type abstraction and recursion. POPL 2005: 63-74 |
76 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce: Harmony: The Art of Reconciliation. TGC 2005: 1 |
75 | ![]() ![]() ![]() ![]() ![]() ![]() | Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich, Steve Zdancewic: Mechanized Metatheory for the Masses: The PoplMark Challenge. TPHOLs 2005: 50-65 |
74 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce, Peter Sewell, Stephanie Weirich, Steve Zdancewic: It Is Time to Mechanize Programming Language Metatheory. VSTTE 2005: 26-30 |
73 | ![]() ![]() ![]() ![]() ![]() ![]() | Haruo Hosoya, Jerome Vouillon, Benjamin C. Pierce: Regular expression types for XML. ACM Trans. Program. Lang. Syst. 27(1): 46-90 (2005) |
2004 | ||
72 | ![]() ![]() ![]() ![]() ![]() ![]() | Eijiro Sumii, Benjamin C. Pierce: A bisimulation for dynamic sealing. POPL 2004: 161-172 |
71 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Odersky, Benjamin C. Pierce: Guest editorial. ACM Trans. Program. Lang. Syst. 26(5): 767-768 (2004) |
2003 | ||
70 | ![]() ![]() ![]() ![]() ![]() ![]() | Mitsuhiro Okada, Benjamin C. Pierce, Andre Scedrov, Hideyuki Tokuda, Akinori Yonezawa: Software Security -- Theories and Systems, Mext-NSF-JSPS International Symposium, ISSS 2002, Tokyo, Japan, November 8-10, 2002, Revised Papers Springer 2003 |
69 | ![]() ![]() ![]() ![]() ![]() ![]() | Vladimir Gapeyev, Benjamin C. Pierce: Regular Object Types. ECOOP 2003: 151-175 |
68 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce: Types and Programming Languages: The Next Generation. LICS 2003: 32- |
67 | ![]() ![]() ![]() ![]() ![]() ![]() | Haruo Hosoya, Benjamin C. Pierce: XDuce: A statically typed XML processing language. ACM Trans. Internet Techn. 3(2): 117-148 (2003) |
66 | ![]() ![]() ![]() ![]() ![]() ![]() | Naoki Kobayashi, Benjamin C. Pierce: Information and Computation special issue from TACS 2001. Inf. Comput. 186(2): 163-164 (2003) |
65 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Y. Levin, Benjamin C. Pierce: TinkerType: a language for playing with formal systems. J. Funct. Program. 13(2): 295-316 (2003) |
64 | ![]() ![]() ![]() ![]() ![]() ![]() | Haruo Hosoya, Benjamin C. Pierce: Regular expression pattern matching for XML. J. Funct. Program. 13(6): 961-1004 (2003) |
63 | ![]() ![]() ![]() ![]() ![]() ![]() | Eijiro Sumii, Benjamin C. Pierce: Logical Relations for Encryption. Journal of Computer Security 11(4): 521-554 (2003) |
2002 | ||
62 | ![]() ![]() ![]() ![]() ![]() ![]() | Kathleen Fisher, Benjamin C. Pierce: Guest editorial. ACM Trans. Program. Lang. Syst. 24(2): 111 (2002) |
61 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Hofmann, Benjamin C. Pierce: Type Destructors. Inf. Comput. 172(1): 29-62 (2002) |
60 | ![]() ![]() ![]() ![]() ![]() ![]() | Atsushi Igarashi, Benjamin C. Pierce: Foundations for Virtual Types. Inf. Comput. 175(1): 34-49 (2002) |
59 | ![]() ![]() ![]() ![]() ![]() ![]() | Atsushi Igarashi, Benjamin C. Pierce: On Inner Classes. Inf. Comput. 177(1): 56-89 (2002) |
58 | ![]() ![]() ![]() ![]() ![]() ![]() | Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pierce: Recursive subtyping revealed. J. Funct. Program. 12(6): 511-548 (2002) |
2001 | ||
57 | ![]() ![]() ![]() ![]() ![]() ![]() | Naoki Kobayashi, Benjamin C. Pierce: Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001, Proceedings Springer 2001 |
56 | ![]() ![]() ![]() ![]() ![]() ![]() | Haruo Hosoya, Benjamin C. Pierce: Regular expression pattern matching for XML. POPL 2001: 67-80 |
55 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce, Jerome Vouillon: Unison: A File Synchronizer and Its Specification. TACS 2001: 560 |
54 | ![]() ![]() ![]() ![]() ![]() ![]() | Atsushi Igarashi, Benjamin C. Pierce, Philip Wadler: Featherweight Java: a minimal core calculus for Java and GJ. ACM Trans. Program. Lang. Syst. 23(3): 396-450 (2001) |
2000 | ||
53 | ![]() ![]() ![]() ![]() ![]() ![]() | Atsushi Igarashi, Benjamin C. Pierce: On Inner Classes. ECOOP 2000: 129-153 |
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Haruo Hosoya, Jerome Vouillon, Benjamin C. Pierce: Regular expression types for XML. ICFP 2000: 11-22 |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Robert Harper, Benjamin C. Pierce: Advanced module systems: a guide for the perplexed (abstract of invited talk). ICFP 2000: 130 |
50 | ![]() ![]() ![]() ![]() ![]() ![]() | Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pierce: Recursive subtyping revealed: functional pearl. ICFP 2000: 221-231 |
49 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce, David N. Turner: Pict: a programming language based on the Pi-Calculus. Proof, Language, and Interaction 2000: 455-494 |
48 | ![]() ![]() ![]() ![]() ![]() ![]() | Haruo Hosoya, Benjamin C. Pierce: XDuce: A Typed XML Processing Language (Preliminary Report). WebDB (Informal Proceedings) 2000: 111-116 |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Haruo Hosoya, Benjamin C. Pierce: XDuce: A Typed XML Processing Language (Preliminary Report). WebDB (Selected Papers) 2000: 226-244 |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce, David N. Turner: Local type inference. ACM Trans. Program. Lang. Syst. 22(1): 1-44 (2000) |
45 | ![]() ![]() ![]() ![]() ![]() ![]() | Uwe Nestmann, Benjamin C. Pierce: Decoding Choice Encodings. Inf. Comput. 163(1): 1-59 (2000) |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce, Davide Sangiorgi: Behavioral equivalence in the polymorphic pi-calculus. J. ACM 47(3): 531-584 (2000) |
1999 | ||
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Buneman, Benjamin C. Pierce: Union Types for Semistructured Data. DBPL 1999: 184-207 |
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Atsushi Igarashi, Benjamin C. Pierce: Foundations for Virtual Types. ECOOP 1999: 161-185 |
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Atsushi Igarashi, Benjamin C. Pierce, Philip Wadler: Featherwieght Java: A Minimal Core Calculus for Java and GJ. OOPSLA 1999: 132-146 |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Naoki Kobayashi, Benjamin C. Pierce, David N. Turner: Linearity and the pi-calculus. ACM Trans. Program. Lang. Syst. 21(5): 914-947 (1999) |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim B. Bruce, Luca Cardelli, Benjamin C. Pierce: Comparing Object Encodings. Inf. Comput. 155(1-2): 108-133 (1999) |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce: Foundations of Object-Oriented Languages - Introduction. TAPOS 5(1): 1 (1999) |
1998 | ||
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce: Type Systems for Concurrent Calculi (Abstract). CONCUR 1998: 364-365 |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Sewell, Pawel T. Wojciechowski, Benjamin C. Pierce: Location-Independent Communication for Mobile Agents: A Two-Level Architecture. ICCL Workshop: Internet Programming Languages 1998: 1-31 |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Sundar Balasubramaniam, Benjamin C. Pierce: What is a File Synchronizer? MOBICOM 1998: 98-108 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce, David N. Turner: Local Type Inference. POPL 1998: 252-265 |
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Uwe Nestmann, Benjamin C. Pierce: Preface. Electr. Notes Theor. Comput. Sci. 16(3): (1998) |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim B. Bruce, Benjamin C. Pierce: Editorial - Third Workshop on Foundations of Object-Oriented Languages. TAPOS 4(1): 1 (1998) |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Giorgio Ghelli, Benjamin C. Pierce: Bounded Existentials and Minimal Typing. Theor. Comput. Sci. 193(1-2): 75-96 (1998) |
1997 | ||
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce, Davide Sangiorgi: Behavioral Equivalence in the Polymorphic Pi-calculus. POPL 1997: 242-255 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim B. Bruce, Luca Cardelli, Benjamin C. Pierce: Comparing Object Encodings. TACS 1997: 415-438 |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce: Foundational Calculi for Programming Languages. The Computer Science and Engineering Handbook 1997: 2190-2207 |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce: Intersection Types and Bounded Polymorphism. Mathematical Structures in Computer Science 7(2): 129-193 (1997) |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce, Martin Steffen: Higher-Order Subtyping. Theor. Comput. Sci. 176(1-2): 235-282 (1997) |
1996 | ||
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Uwe Nestmann, Benjamin C. Pierce: Decoding Choice Encodings. CONCUR 1996: 179-194 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Naoki Kobayashi, Benjamin C. Pierce, David N. Turner: Linearity and the Pi-Calculus. POPL 1996: 358-371 |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Hofmann, Benjamin C. Pierce: Positive Subtyping. Inf. Comput. 126(1): 11-33 (1996) |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce, Davide Sangiorgi: Typing and Subtyping for Mobile Processes. Mathematical Structures in Computer Science 6(5): 409-453 (1996) |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Adriana B. Compagnoni, Benjamin C. Pierce: Higher-Order Intersection Types and Multiple Inheritance. Mathematical Structures in Computer Science 6(5): 469-501 (1996) |
1995 | ||
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Hofmann, Benjamin C. Pierce: Positive Subtyping. POPL 1995: 186-197 |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Giuseppe Castagna, Benjamin C. Pierce: Corrigendum: Decidable Bounded Quantification. POPL 1995: 408 |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Martín Abadi, Luca Cardelli, Benjamin C. Pierce, Didier Rémy: Dynamic Typing in Polymorphic Languages. J. Funct. Program. 5(1): 111-130 (1995) |
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Hofmann, Benjamin C. Pierce: A Unifying Type-Theoretic Framework for Objects. J. Funct. Program. 5(4): 593-635 (1995) |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim B. Bruce, Luca Cardelli, Giuseppe Castagna, Jonathan Eifrig, Scott F. Smith, Valery Trifonov, Gary T. Leavens, Benjamin C. Pierce: On Binary Methods. TAPOS 1(3): 221-242 (1995) |
1994 | ||
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Giuseppe Castagna, Benjamin C. Pierce: Decidable Bounded Quantification. POPL 1994: 151-162 |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Steffen, Benjamin C. Pierce: Higher-Order Subtyping. PROCOMET 1994: 511-530 |
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Hofmann, Benjamin C. Pierce: A Unifying Type-Theoretic Framework for Objects. STACS 1994: 251-262 |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce: Concurrent Objects in a Process Calculus. Theory and Practice of Parallel Programming 1994: 187-215 |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce: Bounded Quantification is Undecidable Inf. Comput. 112(1): 131-165 (1994) |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce, David N. Turner: Simple Type-Theoretic Foundations for Object-Oriented Programming. J. Funct. Program. 4(2): 207-247 (1994) |
1993 | ||
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce, Davide Sangiorgi: Typing and Subtyping for Mobile Processes LICS 1993: 376-385 |
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce, David N. Turner: Object-Oriented Programming without Recursive Types. POPL 1993: 299-312 |
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce: Intersection Types and Bounded Polymorphism. TLCA 1993: 346-360 |
1992 | ||
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Benjamin C. Pierce: Bounded Quantification is Undecidable. POPL 1992: 305-315 |
1991 | ||
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Robert Harper, Benjamin C. Pierce: A Record Calculus Based on Symmetric Concatenation. POPL 1991: 131-142 |
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Martín Abadi, Luca Cardelli, Benjamin C. Pierce, Gordon D. Plotkin: Dynamic Typing in a Statically Typed Language. ACM Trans. Program. Lang. Syst. 13(2): 237-268 (1991) |
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Martín Abadi, Benjamin C. Pierce, Gordon D. Plotkin: Faithful Ideal Models for Recursive Polymorphic Types. Int. J. Found. Comput. Sci. 2(1): 1-21 (1991) |
1989 | ||
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Martín Abadi, Benjamin C. Pierce, Gordon D. Plotkin: Faithful Ideal Models for Recursive Polymorphic Types LICS 1989: 216-225 |
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Martín Abadi, Luca Cardelli, Benjamin C. Pierce, Gordon D. Plotkin: Dynamic Typing in a Statically-Typed Language. POPL 1989: 213-227 |