Travelled to:
1 × Austria
1 × Portugal
1 × Spain
1 × Switzerland
1 × The Netherlands
1 × Turkey
2 × France
2 × Germany
20 × USA
3 × Canada
3 × Italy
3 × United Kingdom
Collaborated with:
∅ A.Igarashi M.Hofmann D.N.Turner V.Gapeyev D.Wägner E.Sumii R.Harper G.Castagna L.Lampropoulos H.Hosoya M.Greenberg J.N.Foster A.Schmitt M.Y.Levin M.Abadi G.D.Plotkin S.Weirich A.Pilkiewicz A.Bohannon C.Hritcu J.Reed D.Sangiorgi S.Zdancewic J.A.Vaughan J.Vouillon P.Wadler N.Kobayashi M.H.0001 Z.Paraskevopoulou R.Pollack J.Hughes L.Xia A.A.d.Amorim J.F.Belo L.Cardelli A.DeHon M.Gaboardi A.Haeberlen J.Hsu A.Narayan D.M.J.Barbosa J.Cretin N.Foster B.E.Aydemir A.Charguéraud M.B.Greenwald J.T.Moore Anders Miltner K.Fisher D.Walker Diane Gallois-Wong A.Spector-Zabusky D.Vytiniotis Yannick Zakowski Paul He C.Hur G.Malecha U.Dhawan R.Rubin N.Vasilakis S.Chiricescu J.M.Smith T.F.K.Jr. N.Collins D.Demange D.Pichardie A.Tolmach
Talks about:
type (13) lens (7) program (6) languag (6) calculus (5) recurs (5) polymorph (4) generat (4) foundat (4) bound (4)
♂ Person: Benjamin C. Pierce
DBLP: Pierce:Benjamin_C=
Facilitated 4 volumes:
Contributed to:
Wrote 50 papers:
- ASPLOS-2015-DhawanHRVCSKPD #architecture #metadata
- Architectural Support for Software-Defined Metadata Processing (UD, CH, RR, NV, SC, JMS, TFKJ, BCP, AD), pp. 487–502.
- POPL-2014-AmorimCDDHPPPT #architecture #data flow
- A verified information-flow architecture (AAdA, NC, AD, DD, CH, DP, BCP, RP, AT), pp. 165–178.
- BX-2013-HofmannPW
- Edit languages for information trees (MH, BCP, DW), pp. 76–89.
- ICFP-2013-HritcuHPSVAL #testing
- Testing noninterference, quickly (CH, JH, BCP, ASZ, DV, AAdA, LL), pp. 455–468.
- POPL-2013-GaboardiHHNP #dependent type #difference #linear #privacy
- Linear dependent types for differential privacy (MG, AH, JH, AN, BCP), pp. 357–370.
- PODS-2012-Pierce #bidirectional #tutorial
- Linguistic foundations for bidirectional transformations: invited tutorial (BCP), pp. 61–64.
- POPL-2012-HofmannPW #lens
- Edit lenses (MH, BCP, DW), pp. 495–508.
- ESOP-2011-BeloGIP #contract #polymorphism
- Polymorphic Contracts (JFB, MG, AI, BCP), pp. 18–37.
- POPL-2011-HofmannPW #lens #symmetry
- Symmetric lenses (MH, BCP, DW), pp. 371–384.
- ICFP-2010-BarbosaCFGP #lens
- Matching lenses: alignment and view update (DMJB, JC, NF, MG, BCP), pp. 193–204.
- ICFP-2010-ReedP #calculus #difference #distance #privacy
- Distance makes the types grow stronger: a calculus for differential privacy (JR, BCP), pp. 157–168.
- OOPSLA-2010-Pierce
- Art, science, and fear (BCP), p. 2.
- POPL-2010-GreenbergPW #contract
- Contracts made manifest (MG, BCP, SW), pp. 353–364.
- ICFP-2009-Pierce #education #programming language #proving #using
- λ, the ultimate TA: using a proof assistant to teach programming language foundations (BCP), pp. 121–122.
- ICMT-2009-Pierce #bidirectional #programming
- Foundations for Bidirectional Programming (BCP), pp. 1–3.
- ICFP-2008-FosterPP #lens
- Quotient lenses (JNF, AP, BCP), pp. 383–396.
- POPL-2008-AydemirCPPW
- Engineering formal metatheory (BEA, AC, BCP, RP, SW), pp. 3–15.
- POPL-2008-BohannonFPPS #lens #named #string
- Boomerang: resourceful lenses for string data (AB, JNF, BCP, AP, AS), pp. 407–419.
- ESOP-2006-Pierce #programming
- The Weird World of Bi-directional Programming (BCP), p. 342.
- PODS-2006-BohannonPV #lens #relational
- Relational lenses: a language for updatable views (AB, BCP, JAV), pp. 338–347.
- CC-2005-GapeyevLPS #runtime #xml
- XML Goes Native: Run-Time Representations for Xtatic (VG, MYL, BCP, AS), pp. 43–58.
- POPL-2005-FosterGMPS #approach #combinator #problem #program transformation
- Combinators for bi-directional tree transformations: a linguistic approach to the view update problem (JNF, MBG, JTM, BCP, AS), pp. 233–246.
- POPL-2005-SumiiP #abstraction #bisimulation #recursion
- A bisimulation for type abstraction and recursion (ES, BCP), pp. 63–74.
- POPL-2004-SumiiP #bisimulation
- A bisimulation for dynamic sealing (ES, BCP), pp. 161–172.
- ECOOP-2003-GapeyevP
- Regular Object Types (VG, BCP), pp. 151–175.
- LICS-2003-Pierce #generative #programming language
- Types and Programming Languages: The Next Generation (BCP), p. 32–?.
- POPL-2001-HosoyaP #pattern matching #regular expression #xml
- Regular expression pattern matching for XML (HH, BCP), pp. 67–80.
- ECOOP-2000-IgarashiP #on the
- On Inner Classes (AI, BCP), pp. 129–153.
- ICFP-2000-GapeyevLP #functional #recursion #type system
- Recursive subtyping revealed: functional pearl (VG, MYL, BCP), pp. 221–231.
- ICFP-2000-HarperP
- Advanced module systems: a guide for the perplexed (RH, BCP), p. 130.
- ICFP-2000-HosoyaVP #regular expression #xml
- Regular expression types for XML (HH, JV, BCP), pp. 11–22.
- ECOOP-1999-IgarashiP
- Foundations for Virtual Types (AI, BCP), pp. 161–185.
- OOPSLA-1999-IgarashiPW #calculus #java
- Featherweight Java: A Minimal Core Calculus for Java and GJ (AI, BCP, PW), pp. 132–146.
- POPL-1998-PierceT #type inference
- Local Type Inference (BCP, DNT), pp. 252–265.
- POPL-1997-PierceS #behaviour #equivalence #polymorphism #π-calculus
- Behavioral Equivalence in the Polymorphic π-calculus (BCP, DS), pp. 242–255.
- POPL-1996-KobayashiPT #π-calculus
- Linearity and the π-Calculus (NK, BCP, DNT), pp. 358–371.
- POPL-1995-CastagnaP #bound #decidability #named #quantifier
- Corrigendum: Decidable Bounded Quantification (GC, BCP), p. 408.
- POPL-1995-HofmannP #type system
- Positive Subtyping (MH, BCP), pp. 186–197.
- POPL-1994-CastagnaP #bound #decidability #quantifier
- Decidable Bounded Quantification (GC, BCP), pp. 151–162.
- POPL-1993-PierceT #object-oriented #programming #recursion
- Object-Oriented Programming without Recursive Types (BCP, DNT), pp. 299–312.
- TLCA-1993-Pierce #bound #morphism #polymorphism
- Intersection Types and Bounded Polymorphism (BCP), pp. 346–360.
- POPL-1992-Pierce #bound #decidability #quantifier
- Bounded Quantification is Undecidable (BCP), pp. 305–315.
- POPL-1991-HarperP #calculus #symmetry
- A Record Calculus Based on Symmetric Concatenation (RH, BCP), pp. 131–142.
- LICS-1989-AbadiPP #modelling #polymorphism #recursion
- Faithful Ideal Models for Recursive Polymorphic Types (MA, BCP, GDP), pp. 216–225.
- POPL-1989-AbadiCPP #dynamic typing #static typing #type system
- Dynamic Typing in a Statically-Typed Language (MA, LC, BCP, GDP), pp. 213–227.
- OOPSLA-2019-Lampropoulos0P #testing
- Coverage guided, property based testing (LL, MH0, BCP), p. 29.
- POPL-2017-LampropoulosGHH #generative
- Beginner's luck: a language for property-based generators (LL, DGW, CH, JH, BCP, LyX), pp. 114–129.
- POPL-2018-LampropoulosPP #generative #induction
- Generating good generators for inductive relations (LL, ZP, BCP), p. 30.
- POPL-2018-MiltnerFPWZ #lens
- Synthesizing bijective lenses (AM, KF, BCP, DW, SZ), p. 30.
- POPL-2020-XiaZHHMPZ #coq #interactive #recursion #representation #source code
- Interaction trees: representing recursive and impure programs in Coq (LyX, YZ, PH, CKH, GM, BCP, SZ), p. 32.