Gavin M. Bierman

Gavin M. Bierman, Andrew D. Gordon, Catalin Hritcu, David E. Langworthy: Semantic subtyping with an SMT solver. J. Funct. Program. 22(1): 31-105 (2012)

Melita Hajdinjak, Gavin M. Bierman: Extending relational algebra with similarities. Mathematical Structures in Computer Science 22(4): 686-718 (2012)

Gavin M. Bierman, Claudio V. Russo, Geoffrey Mainland, Erik Meijer, Mads Torgersen: Pause 'n' Play: Formalizing Asynchronous C#. ECOOP 2012: 233-257

Erik Meijer, Gavin M. Bierman: A co-relational model of data for large shared data banks. Commun. ACM 54(4): 49-58 (2011)

Gavin M. Bierman, Erik Meijer, Mads Torgersen: Adding Dynamic Types to C^#. ECOOP 2010: 76-100

Gavin M. Bierman, Andrew D. Gordon, Catalin Hritcu, David E. Langworthy: Semantic subtyping with an SMT solver. ICFP 2010: 105-116

Nikhil Swamy, Michael W. Hicks, Gavin M. Bierman: A theory of typed coercions and its applications. ICFP 2009: 329-340

Gavin M. Bierman, Christoph Koch: Information systems preface. Inf. Syst. 33(4-5): 333-334 (2008)

Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin M. Bierman, Keith Wansbrough: Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction. J. Funct. Program. 18(4): 437-502 (2008)

Gavin M. Bierman, Matthew J. Parkinson, James Noble: UpgradeJ: Incremental Typechecking for Class Upgrades. ECOOP 2008: 235-259

Ewan D. Tempero, Gavin M. Bierman, James Noble, Matthew J. Parkinson: From Java To UpgradeJ: An Empirical Study. HotSWUp 2008

Stephen Nelson, Stephanie Balzer, Gavin M. Bierman, Erik Meijer, James Noble, David J. Pearce, Jiri Soukup, Frank Tip: Relationships and associations in object-oriented languages. OOPSLA Companion 2008: 855-856

Matthew J. Parkinson, Gavin M. Bierman: Separation logic, abstraction and inheritance. POPL 2008: 75-86

Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman, Peter Sewell, Iulian Neamtiu: Mutatis Mutandis: Safe and predictable dynamic software updating. ACM Trans. Program. Lang. Syst. 29(4) (2007)

Gavin M. Bierman, Erik Meijer, Mads Torgersen: Lost in translation: formalizing proposed extensions to c#. OOPSLA 2007: 479-498

Gavin M. Bierman, Christoph Koch: Report on the 10th International Symposium on Database Programming Languages: (DBPL 2005). SIGMOD Record 35(1): 45-47 (2006)

Erik Meijer, Brian Beckman, Gavin M. Bierman: LINQ: reconciling object, relations and XML in the .NET framework. SIGMOD Conference 2006: 706

Gavin M. Bierman, Alisdair Wren: First-Class Relationships in an Object-Oriented Language. ECOOP 2005: 262-286

Gavin M. Bierman, Erik Meijer, Wolfram Schulte: The Essence of Data Access in Comega. ECOOP 2005: 287-311

Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman, Peter Sewell, Iulian Neamtiu: Mutatis mutandis: safe and predictable dynamic software updating. POPL 2005: 183-194

Matthew J. Parkinson, Gavin M. Bierman: Separation logic and abstraction. POPL 2005: 247-258

Gavin M. Bierman, Christoph Koch (Eds.): Database Programming Languages, 10th International Symposium, DBPL 2005, Trondheim, Norway, August 28-29, 2005, Revised Selected Papers. Lecture Notes in Computer Science 3774, Springer 2005, isbn 3-540-30951-9

Gavin M. Bierman, Matthew J. Parkinson: Effects and effect inference for a core Java calculus. Electr. Notes Theor. Comput. Sci. 82(7): 82-107 (2003)

Gavin M. Bierman, Michael Hicks, Peter Sewell, Gareth Stoyle, Keith Wansbrough: Dynamic rebinding for marshalling and update, with destruct-time ? SIGPLAN Notices 38(9): 99-110 (2003)

Gavin M. Bierman, Michael W. Hicks, Peter Sewell, Gareth Stoyle, Keith Wansbrough: Dynamic rebinding for marshalling and update, with destruct-time? ICFP 2003: 99-110

Gavin M. Bierman: Formal semantics and analysis of object queries. SIGMOD Conference 2003: 407-418

Christian Urban, Gavin M. Bierman: Strong Normalisation of Cut-Elimination in Classical Logic. Fundam. Inform. 45(1-2): 123-155 (2001)

Agathoniki Trigoni, Gavin M. Bierman: Inferring the Principal Type and the Schema Requirements of an OQL Query. BNCOD 2001: 185-201

Gavin M. Bierman, Andrew M. Pitts, Claudio V. Russo: Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion. Electr. Notes Theor. Comput. Sci. 41(3): 70-88 (2000)

Gavin M. Bierman: Program equivalence in a linear functional language. J. Funct. Program. 10(2): 167-190 (2000)

Gavin M. Bierman, Valeria de Paiva: On an Intuitionistic Modal Logic. Studia Logica 65(3): 383-416 (2000)

Gavin M. Bierman: A Classical Linear lambda-Calculus. Theor. Comput. Sci. 227(1-2): 43-78 (1999)

Christian Urban, Gavin M. Bierman: Strong Normalisation of Cut-Elimination in Classical Logic. TLCA 1999: 365-380

P. N. Benton, Gavin M. Bierman, Valeria de Paiva: Computational Types from a Logical Perspective. J. Funct. Program. 8(2): 177-193 (1998)

Gavin M. Bierman: A Computational Interpretation of the lambda-µ-Calculus. MFCS 1998: 336-345

Mohamad Afshar, J. Bates, Gavin M. Bierman, K. Moody: A New General Purpose Parallel Database System. ISPAN 1997: 2-8

Gavin M. Bierman: A Note on Full Intuitionistic Linear Logic. Ann. Pure Appl. Logic 79(3): 281-287 (1996)

Gavin M. Bierman: Towards a Classical Linear lambda-calculus. Electr. Notes Theor. Comput. Sci. 3: 15-27 (1996)

Gavin M. Bierman: What is a Categorical Model of Intuitionistic Linear Logic? TLCA 1995: 78-93

P. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland: A Term Calculus for Intuitionistic Linear Logic. TLCA 1993: 75-90

P. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland: Linear Lambda-Calculus and Categorial Models Revisited. CSL 1992: 61-84