Self-managed collections: Off-heap memory management for scalable query-dominated collections
Fabian Nagel, Gavin Bierman, Aleksander Dragovic, Stratis Viglas, EDBT 2017, 61-71
Safe & Efficient Gradual Typing for TypeScript.
Aseem Rastogi, Nikhil Swamy, Cédric Fournet, Gavin M. Bierman, Panagiotis Vekris, POPL 2015:167-180
Code Generation for Efficient Query Processing in Managed Runtimes.
Fabian Nagel, Gavin M. Bierman, Stratis D. Viglas, PVLDB 7(12):1095-1106 (2014)
Gradual typing embedded securely in JavaScript.
Nikhil Swamy, Cédric Fournet, Aseem Rastogi, Karthikeyan Bhargavan, Juan Chen, Pierre-Yves Strub, Gavin M. Bierman, POPL 2014:425-438
Polymonadic Programming.
Michael Hicks, Gavin M. Bierman, Nataliya Guts, Daan Leijen, Nikhil Swamy, MSFP 2014:79-99
Processing Declarative Queries Through Generating Imperative Code in Managed Runtimes.
Stratis Viglas, Gavin M. Bierman, Fabian Nagel, IEEE Data Eng. Bull. (DEBU) 37(1):12-21 (2014)
Understanding TypeScript.
Gavin M. Bierman, Martín Abadi, Mads Torgersen, ECOOP 2014:257-281
Separation Logic for Object-Oriented Programming.
Matthew J. Parkinson, Gavin M. Bierman, Aliasing in Object-Oriented Programming 2013:366-406
Extending relational algebra with similarities.
Melita Hajdinjak, Gavin M. Bierman, Mathematical Structures in Computer Science (MSCS) 22(4):686-718 (2012)
Pause 'n' Play: Formalizing Asynchronous C#.
Gavin M. Bierman, Claudio V. Russo, Geoffrey Mainland, Erik Meijer, Mads Torgersen, ECOOP 2012:233-257
Semantic subtyping with an SMT solver.
Gavin M. Bierman, Andrew D. Gordon, Catalin Hritcu, David E. Langworthy, J. Funct. Program. (JFP) 22(1):31-105 (2012)
A co-relational model of data for large shared data banks.
Erik Meijer, Gavin M. Bierman, Commun. ACM (CACM) 54(4):49-58 (2011)
Adding Dynamic Types to C#.
Gavin M. Bierman, Erik Meijer, Mads Torgersen, ECOOP 2010:76-100
Semantic subtyping with an SMT solver.
Gavin M. Bierman, Andrew D. Gordon, Catalin Hritcu, David E. Langworthy, ICFP 2010:105-116
A theory of typed coercions and its applications.
Nikhil Swamy, Michael W. Hicks, Gavin M. Bierman, ICFP 2009:329-340
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction.
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin M. Bierman, Keith Wansbrough, J. Funct. Program. (JFP) 18(4):437-502 (2008)
From Java To UpgradeJ: An Empirical Study.
Ewan D. Tempero, Gavin M. Bierman, James Noble, Matthew J. Parkinson, HotSWUp 2008
Information systems preface.
Gavin M. Bierman, Christoph Koch, Inf. Syst. (IS) 33(4-5):333-334 (2008)
Relationships and associations in object-oriented languages.
Stephen Nelson, Stephanie Balzer, Gavin M. Bierman, Erik Meijer, James Noble, David J. Pearce, Jiri Soukup, Frank Tip, OOPSLA Companion 2008:855-856
Separation logic, abstraction and inheritance.
Matthew J. Parkinson, Gavin M. Bierman, POPL 2008:75-86
UpgradeJ: Incremental Typechecking for Class Upgrades.
Gavin M. Bierman, Matthew J. Parkinson, James Noble, ECOOP 2008:235-259
Mutatis Mutandis: Safe and predictable dynamic software updating.
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman, Peter Sewell, Iulian Neamtiu, ACM Trans. Program. Lang. Syst. (TOPLAS) 29(4) (2007)
Lost in translation: formalizing proposed extensions to C#.
Gavin M. Bierman, Erik Meijer, Mads Torgersen, OOPSLA 2007:479-498
LINQ: reconciling object, relations and XML in the .NET framework.
Erik Meijer, Brian Beckman, Gavin M. Bierman, SIGMOD 2006:706
Report on the 10th International Symposium on Database Programming Languages: (DBPL 2005).
Gavin M. Bierman, Christoph Koch, SIGMOD Record (SIGMOD) 35(1):45-47 (2006)
Database Programming Languages, 10th International Symposium, DBPL 2005, Trondheim, Norway, August 28-29, 2005, Revised Selected Papers
Gavin M. Bierman, Christoph Koch, DBPL 2005
First-Class Relationships in an Object-Oriented Language.
Gavin M. Bierman, Alisdair Wren, ECOOP 2005:262-286
Mutatis mutandis: safe and predictable dynamic software updating.
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman, Peter Sewell, Iulian Neamtiu, POPL 2005:183-194
Separation logic and abstraction.
Matthew J. Parkinson, Gavin M. Bierman, POPL 2005:247-258
The Essence of Data Access in Comega.
Gavin M. Bierman, Erik Meijer, Wolfram Schulte, ECOOP 2005:287-311
Dynamic rebinding for marshalling and update, with destruct-time ?
Gavin M. Bierman, Michael Hicks, Peter Sewell, Gareth Stoyle, Keith Wansbrough, SIGPLAN Notices (SIGPLAN) 38(9):99-110 (2003)
Dynamic rebinding for marshalling and update, with destruct-time?
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, Gareth Stoyle, Keith Wansbrough, ICFP 2003:99-110
Effects and effect inference for a core Java calculus.
Gavin M. Bierman, Matthew J. Parkinson, Electr. Notes Theor. Comput. Sci. (ENTCS) 82(7):82-107 (2003)
Formal semantics and analysis of object queries.
Gavin M. Bierman, SIGMOD 2003:407-418
Inferring the Principal Type and the Schema Requirements of an OQL Query.
Agathoniki Trigoni, Gavin M. Bierman, BNCOD 2001:185-201
Strong Normalisation of Cut-Elimination in Classical Logic.
Christian Urban, Gavin M. Bierman, Fundam. Inform. (FUIN) 45(1-2):123-155 (2001)
On an Intuitionistic Modal Logic.
Gavin M. Bierman, Valeria de Paiva, Studia Logica (SLOGICA) 65(3):383-416 (2000)
Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion.
Gavin M. Bierman, Andrew M. Pitts, Claudio V. Russo, Electr. Notes Theor. Comput. Sci. (ENTCS) 41(3):70-88 (2000)
Program equivalence in a linear functional language.
Gavin M. Bierman, J. Funct. Program. (JFP) 10(2):167-190 (2000)
A Classical Linear lambda-Calculus.
Gavin M. Bierman, Theor. Comput. Sci. (TCS) 227(1-2):43-78 (1999)
Strong Normalisation of Cut-Elimination in Classical Logic.
Christian Urban, Gavin M. Bierman, TLCA 1999:365-380
A Computational Interpretation of the lambda-µ-Calculus.
Gavin M. Bierman, MFCS 1998:336-345
Computational Types from a Logical Perspective.
P. N. Benton, Gavin M. Bierman, Valeria de Paiva, J. Funct. Program. (JFP) 8(2):177-193 (1998)
A New General Purpose Parallel Database System.
Mohamad Afshar, J. Bates, Gavin M. Bierman, K. Moody, ISPAN 1997:2-8
A Note on Full Intuitionistic Linear Logic.
Gavin M. Bierman, Ann. Pure Appl. Logic (APAL) 79(3):281-287 (1996)
Towards a Classical Linear lambda-calculus.
Gavin M. Bierman, Electr. Notes Theor. Comput. Sci. (ENTCS) 3:15-27 (1996)
What is a Categorical Model of Intuitionistic Linear Logic?
Gavin M. Bierman, TLCA 1995:78-93
A Term Calculus for Intuitionistic Linear Logic.
P. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland, TLCA 1993:75-90
Linear Lambda-Calculus and Categorial Models Revisited.
P. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland, CSL 1992:61-84