Benjamin C. Pierce

From MaRDI portal
Person:879362

Available identifiers

zbMath Open pierce.benjamin-cDBLPp/BenjaminCPierceWikidataQ4888368 ScholiaQ4888368MaRDI QIDQ879362

List of research outcomes





PublicationDate of PublicationType
Decoding choice encodings2023-06-28Paper
https://portal.mardi4nfdi.de/entity/Q60996312023-06-20Paper
The meaning of memory safety2019-09-16Paper
Combinators for bi-directional tree transformations2017-07-14Paper
A bisimulation for type abstraction and recursion2017-07-14Paper
A bisimulation for dynamic sealing2015-11-11Paper
Foundational Property-Based Testing2015-09-14Paper
Edit lenses2015-09-11Paper
Regular expression types for XML2015-09-11Paper
Recursive subtyping revealed2015-09-11Paper
Contracts made manifest2015-06-11Paper
Regular expression pattern matching for XML2015-03-17Paper
Quotient lenses2015-03-16Paper
Distance makes the types grow stronger2015-03-05Paper
Matching lenses2015-03-05Paper
Linear dependent types for differential privacy2014-11-27Paper
Engineering formal metatheory2014-09-12Paper
Boomerang2014-09-12Paper
Symmetric lenses2014-04-10Paper
A verified information-flow architecture2014-04-10Paper
Contracts made manifest2014-02-27Paper
Polymorphic Contracts2011-05-19Paper
A bisimulation for type abstraction and recursion2008-12-21Paper
Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data2008-09-09Paper
A Formal Investigation of Diff32008-04-24Paper
Exploiting schemas in data synchronization2007-05-23Paper
A bisimulation for dynamic sealing2007-05-11Paper
Database Programming Languages2006-10-20Paper
Database Programming Languages2006-10-20Paper
Behavioral equivalence in the polymorphic pi-calculus2006-09-12Paper
Theorem Proving in Higher Order Logics2006-07-06Paper
https://portal.mardi4nfdi.de/entity/Q57144592006-01-02Paper
Regular expression pattern matching for XML2005-02-08Paper
https://portal.mardi4nfdi.de/entity/Q44731652004-08-04Paper
TinkerType: a language for playing with formal systems2004-03-17Paper
Recursive subtyping revealed2003-06-23Paper
Comparing object encodings.2003-01-14Paper
Foundations for virtual types2003-01-14Paper
Decoding choice encodings2003-01-14Paper
On inner classes2003-01-14Paper
Type destructors2003-01-14Paper
Types and programing languages2002-03-21Paper
https://portal.mardi4nfdi.de/entity/Q49371182000-02-03Paper
Bounded existentials and minimal typing1998-08-13Paper
Higher-order subtyping1998-07-23Paper
Intersection types and bounded polymorphism1997-10-09Paper
https://portal.mardi4nfdi.de/entity/Q38372621996-12-08Paper
https://portal.mardi4nfdi.de/entity/Q38372641996-12-08Paper
Positive subtyping1996-07-03Paper
https://portal.mardi4nfdi.de/entity/Q48553441996-04-16Paper
Dynamic typing in polymorphic languages1995-06-08Paper
Simple type-theoretic foundations for object-oriented programming1995-05-04Paper
Bounded quantification is undecidable1994-06-20Paper
https://portal.mardi4nfdi.de/entity/Q42814841994-03-10Paper
https://portal.mardi4nfdi.de/entity/Q40232441993-01-23Paper
FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q32040521989-01-01Paper

Research outcomes over time

This page was built for person: Benjamin C. Pierce