Gavin M. Bierman

According to our database1, Gavin M. Bierman authored at least 46 papers between 1992 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
What is a Secure Programming Language?
Proceedings of the 3rd Summit on Advances in Programming Languages, 2019

2017
Self-managed collections: Off-heap memory management for scalable query-dominated collections.
Proceedings of the 20th International Conference on Extending Database Technology, 2017

2015
Safe & Efficient Gradual Typing for TypeScript.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

2014
Code Generation for Efficient Query Processing in Managed Runtimes.
Proc. VLDB Endow., 2014

Processing Declarative Queries Through Generating Imperative Code in Managed Runtimes.
IEEE Data Eng. Bull., 2014

Polymonadic Programming.
Proceedings of the Proceedings 5th Workshop on Mathematically Structured Functional Programming, 2014

Gradual typing embedded securely in JavaScript.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Understanding TypeScript.
Proceedings of the ECOOP 2014 - Object-Oriented Programming - 28th European Conference, Uppsala, Sweden, July 28, 2014

2013
Separation Logic for Object-Oriented Programming.
Proceedings of the Aliasing in Object-Oriented Programming. Types, 2013

2012
Extending relational algebra with similarities.
Math. Struct. Comput. Sci., 2012

Semantic subtyping with an SMT solver.
J. Funct. Program., 2012

Pause 'n' Play: Formalizing Asynchronous C#.
Proceedings of the ECOOP 2012 - Object-Oriented Programming, 2012

2011
A co-relational model of data for large shared data banks.
Commun. ACM, 2011

2010
Adding Dynamic Types to C<sup>#</sup>.
Proceedings of the ECOOP 2010, 2010

2009
A theory of typed coercions and its applications.
Proceedings of the Proceeding of the 14th ACM SIGPLAN international conference on Functional programming, 2009

2008
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction.
J. Funct. Program., 2008

Information systems preface.
Inf. Syst., 2008

Separation logic, abstraction and inheritance.
Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

Relationships and associations in object-oriented languages.
Proceedings of the Companion to the 23rd Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2008

From Java To UpgradeJ: An Empirical Study.
Proceedings of the 1st ACM Workshop on Hot Topics in Software Upgrades, 2008

UpgradeJ: Incremental Typechecking for Class Upgrades.
Proceedings of the ECOOP 2008, 2008

2007
<i>Mutatis Mutandis</i>: Safe and predictable dynamic software updating.
ACM Trans. Program. Lang. Syst., 2007

Lost in translation: formalizing proposed extensions to c#.
Proceedings of the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2007

2006
Report on the 10th International Symposium on Database Programming Languages: (DBPL 2005).
SIGMOD Rec., 2006

LINQ: reconciling object, relations and XML in the .NET framework.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2006

2005
Mutatis mutandis: safe and predictable dynamic software updating.
Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2005

Separation logic and abstraction.
Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2005

First-Class Relationships in an Object-Oriented Language.
Proceedings of the ECOOP 2005, 2005

The Essence of Data Access in C<i>omega</i>.
Proceedings of the ECOOP 2005, 2005

2003
Effects and effect inference for a core Java calculus.
Proceedings of the Workshop on Object Oriented Developments, 2003

Formal semantics and analysis of object queries.
Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003

Dynamic rebinding for marshalling and update, with destruct-time?
Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003

2001
Strong Normalisation of Cut-Elimination in Classical Logic.
Fundam. Informaticae, 2001

Inferring the Principal Type and the Schema Requirements of an OQL Query.
Proceedings of the Advances in Databases, 18th British National Conference on Databases, 2001

2000
On an Intuitionistic Modal Logic.
Stud Logica, 2000

Program equivalence in a linear functional language.
J. Funct. Program., 2000

Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion.
Proceedings of the 4th International Workshop on Higher Order Operational Techniques in Semantics, 2000

1999
A Classical Linear lambda-Calculus.
Theor. Comput. Sci., 1999

1998
Computational Types from a Logical Perspective.
J. Funct. Program., 1998

A Computational Interpretation of the lambda-µ-Calculus.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
A New General Purpose Parallel Database System.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

1996
Towards a Classical Linear lambda-calculus.
Proceedings of the Linear Logic Tokyo Meeting 1996, Keio University, Mita Campus, Tokyo, Japan, March 29, 1996

A Note on Full Intuitionistic Linear Logic.
Ann. Pure Appl. Log., 1996

1995
What is a Categorical Model of Intuitionistic Linear Logic?
Proceedings of the Typed Lambda Calculi and Applications, 1995

1993
A Term Calculus for Intuitionistic Linear Logic.
Proceedings of the Typed Lambda Calculi and Applications, 1993

1992
Linear Lambda-Calculus and Categorial Models Revisited.
Proceedings of the Computer Science Logic, 6th Workshop, 1992


  Loading...