default search action
Gavin M. Bierman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c32]Cristina Cifuentes, Gavin M. Bierman:
What is a Secure Programming Language? SNAPL 2019: 3:1-3:15 - 2017
- [c31]Fabian Nagel, Gavin M. Bierman, Aleksandar Dragojevic, Stratis Viglas:
Self-managed collections: Off-heap memory management for scalable query-dominated collections. EDBT 2017: 61-71 - 2015
- [c30]Aseem Rastogi, Nikhil Swamy, Cédric Fournet, Gavin M. Bierman, Panagiotis Vekris:
Safe & Efficient Gradual Typing for TypeScript. POPL 2015: 167-180 - 2014
- [j15]Stratis Viglas, Gavin M. Bierman, Fabian Nagel:
Processing Declarative Queries Through Generating Imperative Code in Managed Runtimes. IEEE Data Eng. Bull. 37(1): 12-21 (2014) - [j14]Fabian Nagel, Gavin M. Bierman, Stratis D. Viglas:
Code Generation for Efficient Query Processing in Managed Runtimes. Proc. VLDB Endow. 7(12): 1095-1106 (2014) - [c29]Gavin M. Bierman, Martín Abadi, Mads Torgersen:
Understanding TypeScript. ECOOP 2014: 257-281 - [c28]Nikhil Swamy, Cédric Fournet, Aseem Rastogi, Karthikeyan Bhargavan, Juan Chen, Pierre-Yves Strub, Gavin M. Bierman:
Gradual typing embedded securely in JavaScript. POPL 2014: 425-438 - [c27]Michael Hicks, Gavin M. Bierman, Nataliya Guts, Daan Leijen, Nikhil Swamy:
Polymonadic Programming. MSFP 2014: 79-99 - 2013
- [p1]Matthew J. Parkinson, Gavin M. Bierman:
Separation Logic for Object-Oriented Programming. Aliasing in Object-Oriented Programming 2013: 366-406 - 2012
- [j13]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) - [j12]Melita Hajdinjak, Gavin M. Bierman:
Extending relational algebra with similarities. Math. Struct. Comput. Sci. 22(4): 686-718 (2012) - [c26]Gavin M. Bierman, Claudio V. Russo, Geoffrey Mainland
, Erik Meijer, Mads Torgersen:
Pause 'n' Play: Formalizing Asynchronous C#. ECOOP 2012: 233-257 - 2011
- [j11]Erik Meijer, Gavin M. Bierman:
A co-relational model of data for large shared data banks. Commun. ACM 54(4): 49-58 (2011) - 2010
- [c25]Gavin M. Bierman, Erik Meijer, Mads Torgersen:
Adding Dynamic Types to C#. ECOOP 2010: 76-100 - [c24]Gavin M. Bierman, Andrew D. Gordon, Catalin Hritcu, David E. Langworthy:
Semantic subtyping with an SMT solver. ICFP 2010: 105-116
2000 – 2009
- 2009
- [c23]Nikhil Swamy, Michael W. Hicks, Gavin M. Bierman:
A theory of typed coercions and its applications. ICFP 2009: 329-340 - 2008
- [j10]Gavin M. Bierman, Christoph Koch:
Information systems preface. Inf. Syst. 33(4-5): 333-334 (2008) - [j9]Peter Sewell
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction. J. Funct. Program. 18(4): 437-502 (2008) - [c22]Gavin M. Bierman, Matthew J. Parkinson, James Noble
UpgradeJ: Incremental Typechecking for Class Upgrades. ECOOP 2008: 235-259 - [c21]Ewan D. Tempero
From Java To UpgradeJ: An Empirical Study. HotSWUp 2008 - [c20]Stephen Nelson, Stephanie Balzer, Gavin M. Bierman, Erik Meijer, James Noble
Relationships and associations in object-oriented languages. OOPSLA Companion 2008: 855-856 - [c19]Matthew J. Parkinson, Gavin M. Bierman:
Separation logic, abstraction and inheritance. POPL 2008: 75-86 - 2007
- [j8]Gareth Paul Stoyle, Michael W. Hicks, Gavin M. Bierman, Peter Sewell
Mutatis Mutandis: Safe and predictable dynamic software updating. ACM Trans. Program. Lang. Syst. 29(4): 22 (2007) - [c18]Gavin M. Bierman, Erik Meijer, Mads Torgersen:
Lost in translation: formalizing proposed extensions to c#. OOPSLA 2007: 479-498 - 2006
- [j7]Gavin M. Bierman, Christoph Koch:
Report on the 10th International Symposium on Database Programming Languages: (DBPL 2005). SIGMOD Rec. 35(1): 45-47 (2006) - [c17]Erik Meijer, Brian Beckman, Gavin M. Bierman:
LINQ: reconciling object, relations and XML in the .NET framework. SIGMOD Conference 2006: 706 - 2005
- [c16]Gavin M. Bierman, Alisdair Stuart Wren:
First-Class Relationships in an Object-Oriented Language. ECOOP 2005: 262-286 - [c15]Gavin M. Bierman, Erik Meijer, Wolfram Schulte:
The Essence of Data Access in Comega. ECOOP 2005: 287-311 - [c14]Gareth Paul Stoyle, Michael W. Hicks
Mutatis mutandis: safe and predictable dynamic software updating. POPL 2005: 183-194 - [c13]Matthew J. Parkinson, Gavin M. Bierman:
Separation logic and abstraction. POPL 2005: 247-258 - [e1]Gavin M. Bierman, Christoph Koch:
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 [contents] - 2003
- [c12]Gavin M. Bierman, Michael W. Hicks
Dynamic rebinding for marshalling and update, with destruct-time? ICFP 2003: 99-110 - [c11]Gavin M. Bierman:
Formal semantics and analysis of object queries. SIGMOD Conference 2003: 407-418 - [c10]Gavin M. Bierman, Matthew J. Parkinson:
Effects and effect inference for a core Java calculus. WOOD 2003: 82-107 - 2001
- [j6]Christian Urban, Gavin M. Bierman:
Strong Normalisation of Cut-Elimination in Classical Logic. Fundam. Informaticae 45(1-2): 123-155 (2001) - [c9]Agathoniki Trigoni, Gavin M. Bierman:
Inferring the Principal Type and the Schema Requirements of an OQL Query. BNCOD 2001: 185-201 - 2000
- [j5]Gavin M. Bierman:
Program equivalence in a linear functional language. J. Funct. Program. 10(2): 167-190 (2000) - [j4]Gavin M. Bierman, Valeria de Paiva:
On an Intuitionistic Modal Logic. Stud Logica 65(3): 383-416 (2000) - [c8]Gavin M. Bierman, Andrew M. Pitts
Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion. HOOTS 2000: 70-88
1990 – 1999
- 1999
- [j3]Gavin M. Bierman:
A Classical Linear lambda-Calculus. Theor. Comput. Sci. 227(1-2): 43-78 (1999) - [c7]Christian Urban, Gavin M. Bierman:
Strong Normalisation of Cut-Elimination in Classical Logic. TLCA 1999: 365-380 - 1998
- [j2]P. N. Benton, Gavin M. Bierman, Valeria de Paiva:
Computational Types from a Logical Perspective. J. Funct. Program. 8(2): 177-193 (1998) - [c6]Gavin M. Bierman:
A Computational Interpretation of the lambda-µ-Calculus. MFCS 1998: 336-345 - 1997
- [c5]Mohamad Afshar, J. Bates, Gavin M. Bierman, K. Moody:
A New General Purpose Parallel Database System. ISPAN 1997: 2-8 - 1996
- [j1]Gavin M. Bierman:
A Note on Full Intuitionistic Linear Logic. Ann. Pure Appl. Log. 79(3): 281-287 (1996) - [c4]Gavin M. Bierman:
Towards a Classical Linear lambda-calculus. Linear Logic Tokyo Meeting 1996: 15-27 - 1995
- [c3]Gavin M. Bierman:
What is a Categorical Model of Intuitionistic Linear Logic? TLCA 1995: 78-93 - 1993
- [c2]P. N. Benton, Gavin M. Bierman, Valeria de Paiva
A Term Calculus for Intuitionistic Linear Logic. TLCA 1993: 75-90 - 1992
- [c1]P. N. Benton, Gavin M. Bierman, Valeria de Paiva
Linear Lambda-Calculus and Categorial Models Revisited. CSL 1992: 61-84
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: