| 2009 |
|---|
| 57 | EE | Lars Birkedal,
Kristian Støvring,
Jacob Thamsborg:
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types.
FOSSACS 2009: 456-470 |
| 56 | EE | Neelakantan R. Krishnaswami,
Jonathan Aldrich,
Lars Birkedal,
Kasper Svendsen,
Alexandre Buisse:
Design patterns in separation logic.
TLDI 2009: 105-116 |
| 55 | EE | Lars Birkedal,
Kristian Støvring,
Jacob Thamsborg:
Relational parametricity for references and recursive types.
TLDI 2009: 91-104 |
| 2008 |
|---|
| 54 | EE | Lars Birkedal,
Søren Debois,
Thomas T. Hildebrandt:
On the Construction of Sorted Reactive Systems.
CONCUR 2008: 218-232 |
| 53 | EE | Rasmus Lerchedahl Petersen,
Lars Birkedal,
Aleksandar Nanevski,
Greg Morrisett:
A Realizability Model for Impredicative Hoare Type Theory.
ESOP 2008: 337-352 |
| 52 | EE | Lars Birkedal,
Bernhard Reus,
Jan Schwinghammer,
Hongseok Yang:
A Simple Model of Separation Logic for Higher-Order Store.
ICALP (2) 2008: 348-360 |
| 51 | EE | Aleksandar Nanevski,
Greg Morrisett,
Avraham Shinnar,
Paul Govereau,
Lars Birkedal:
Ynot: dependent types for imperative programs.
ICFP 2008: 229-240 |
| 50 | EE | Noah Torp-Smith,
Lars Birkedal,
John C. Reynolds:
Local reasoning about a copying garbage collector.
ACM Trans. Program. Lang. Syst. 30(4): (2008) |
| 49 | EE | Rasmus Ejlers Møgelberg,
Lars Birkedal,
Giuseppe Rosolini:
Synthetic domain theory and models of linear Abadi & Plotkin logic.
Ann. Pure Appl. Logic 155(2): 115-133 (2008) |
| 48 | EE | Lars Birkedal,
Hongseok Yang:
Relational Parametricity and Separation Logic
CoRR abs/0805.0783: (2008) |
| 47 | EE | Carsten Varming,
Lars Birkedal:
Higher-Order Separation Logic in Isabelle/HOLCF.
Electr. Notes Theor. Comput. Sci. 218: 371-389 (2008) |
| 46 | EE | Aleksandar Nanevski,
J. Gregory Morrisett,
Lars Birkedal:
Hoare type theory, polymorphism and separation.
J. Funct. Program. 18(5-6): 865-911 (2008) |
| 2007 |
|---|
| 45 | EE | Aleksandar Nanevski,
Amal Ahmed,
Greg Morrisett,
Lars Birkedal:
Abstract Predicates and Mutable ADTs in Hoare Type Theory.
ESOP 2007: 189-204 |
| 44 | EE | Lars Birkedal,
Hongseok Yang:
Relational Parametricity and Separation Logic.
FoSSaCS 2007: 93-107 |
| 43 | EE | Bodil Biering,
Lars Birkedal,
Noah Torp-Smith:
BI-hyperdoctrines, higher-order separation logic, and abstraction.
ACM Trans. Program. Lang. Syst. 29(5): (2007) |
| 42 | EE | Lars Birkedal,
Troels Christoffer Damgaard,
Arne J. Glenstrup,
Robin Milner:
Matching of Bigraphs.
Electr. Notes Theor. Comput. Sci. 175(4): 3-19 (2007) |
| 41 | EE | Lars Birkedal:
Book Reviews.
Studia Logica 86(1): 133-135 (2007) |
| 40 | EE | Lars Birkedal,
Rasmus Ejlers Møgelberg,
Rasmus Lerchedahl Petersen:
Domain-theoretical models of parametric polymorphism.
Theor. Comput. Sci. 388(1-3): 152-172 (2007) |
| 2006 |
|---|
| 39 | EE | Nina Bohr,
Lars Birkedal:
Relational Reasoning for Recursive Types and References.
APLAS 2006: 79-96 |
| 38 | EE | Lars Birkedal,
Søren Debois,
Thomas T. Hildebrandt:
Sortings for Reactive Systems.
CONCUR 2006: 248-262 |
| 37 | EE | Lars Birkedal,
Søren Debois,
Ebbe Elsborg,
Thomas T. Hildebrandt,
Henning Niss:
Bigraphical Models of Context-Aware Systems.
FoSSaCS 2006: 187-201 |
| 36 | EE | Aleksandar Nanevski,
Greg Morrisett,
Lars Birkedal:
Polymorphism and separation in hoare type theory.
ICFP 2006: 62-73 |
| 35 | EE | Lars Birkedal,
Noah Torp-Smith,
Hongseok Yang:
Semantics of Separation-Logic Typing and Higher-order Frame Rules for<br> Algol-like Languages
CoRR abs/cs/0610081: (2006) |
| 34 | EE | Lars Birkedal,
Rasmus Ejlers Møgelberg,
Rasmus Lerchedahl Petersen:
Linear Abadi and Plotkin Logic
CoRR abs/cs/0611004: (2006) |
| 33 | EE | Lars Birkedal,
Rasmus Ejlers Møgelberg,
Rasmus Lerchedahl Petersen:
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus.
Electr. Notes Theor. Comput. Sci. 155: 191-217 (2006) |
| 32 | EE | Rasmus Ejlers Møgelberg,
Lars Birkedal,
Giuseppe Rosolini:
Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic.
Electr. Notes Theor. Comput. Sci. 155: 219-245 (2006) |
| 31 | EE | Lars Birkedal,
Rasmus Ejlers Møgelberg,
Rasmus Lerchedahl Petersen:
Linear Abadi and Plotkin Logic.
Logical Methods in Computer Science 2(5): (2006) |
| 30 | EE | Lars Birkedal,
Noah Torp-Smith,
Hongseok Yang:
Semantics of Separation-Logic Typing and Higher-order Frame Rules for Algol-like Languages.
Logical Methods in Computer Science 2(5): (2006) |
| 29 | | Troels Christoffer Damgaard,
Lars Birkedal:
Axiomatizing Binding Bigraphs.
Nord. J. Comput. 13(1-2): 58-77 (2006) |
| 2005 |
|---|
| 28 | EE | Bodil Biering,
Lars Birkedal,
Noah Torp-Smith:
BI Hyperdoctrines and Higher-Order Separation Logic.
ESOP 2005: 233-247 |
| 27 | EE | Lars Birkedal,
Noah Torp-Smith,
Hongseok Yang:
Semantics of Separation-Logic Typing and Higher-Order Frame Rules.
LICS 2005: 260-269 |
| 26 | EE | Lars Birkedal:
Preface.
Electr. Notes Theor. Comput. Sci. 122: 1- (2005) |
| 25 | EE | Lars Birkedal,
Rasmus Ejlers Møgelberg:
Categorical models for Abadi and Plotkin's logic for parametricity.
Mathematical Structures in Computer Science 15(4): 709-772 (2005) |
| 2004 |
|---|
| 24 | EE | Lars Birkedal,
Noah Torp-Smith,
John C. Reynolds:
Local reasoning about a copying garbage collector.
POPL 2004: 220-231 |
| 23 | EE | Mads Tofte,
Lars Birkedal,
Martin Elsman,
Niels Hallenberg:
A Retrospective on Region-Based Memory Management.
Higher-Order and Symbolic Computation 17(3): 245-265 (2004) |
| 22 | EE | Andrej Bauer,
Lars Birkedal,
Dana S. Scott:
Equilogical spaces.
Theor. Comput. Sci. 315(1): 35-59 (2004) |
| 21 | EE | Lars Birkedal,
Martín Hötzel Escardó,
Achim Jung,
Giuseppe Rosolini:
Preface: Recent Developments in Domain Theory: A collection of papers in honour of Dana S. Scott.
Theor. Comput. Sci. 316(1): 1-2 (2004) |
| 2002 |
|---|
| 20 | | Lars Birkedal,
Jaap van Oosten:
Relative and modified relative realizability.
Ann. Pure Appl. Logic 118(1-2): 115-132 (2002) |
| 19 | EE | Lars Birkedal:
A general notion of realizability.
Bulletin of Symbolic Logic 8(2): 266-282 (2002) |
| 18 | | Steven Awodey,
Lars Birkedal,
Dana S. Scott:
Local Realizability Toposes and a Modal Logic for Computability.
Mathematical Structures in Computer Science 12(3): 319-334 (2002) |
| 2001 |
|---|
| 17 | EE | Lars Birkedal,
Mads Tofte:
A constraint-based region inference algorithm.
Theor. Comput. Sci. 258(1-2): 299-392 (2001) |
| 2000 |
|---|
| 16 | EE | Andrej Bauer,
Lars Birkedal:
Continuous Functionals of Dependent Types and Equilogical Spaces.
CSL 2000: 202-216 |
| 15 | EE | Lars Birkedal:
A General Notion of Realizability.
LICS 2000: 7-17 |
| 14 | | Mads Tofte,
Lars Birkedal:
Unification and polymorphism in region inference.
Proof, Language, and Interaction 2000: 389-424 |
| 13 | EE | Lars Birkedal:
Developing Theories of Types and Computability via Realizability.
Electr. Notes Theor. Comput. Sci. 34: (2000) |
| 12 | EE | Lars Birkedal:
On propositions-as-types in realizability models.
Electr. Notes Theor. Comput. Sci. 35: (2000) |
| 1999 |
|---|
| 11 | EE | Lars Birkedal:
Bibliography on Realizability.
Electr. Notes Theor. Comput. Sci. 23(1): (1999) |
| 10 | EE | Steven Awodey,
Lars Birkedal,
Dana S. Scott:
Local Realizability Toposes and a Modal Logic for Computability.
Electr. Notes Theor. Comput. Sci. 23(1): (1999) |
| 9 | EE | Lars Birkedal,
Jaap van Oosten,
Giuseppe Rosolini,
Dana S. Scott:
Preface.
Electr. Notes Theor. Comput. Sci. 23(1): (1999) |
| 8 | | Lars Birkedal,
Robert Harper:
Relational Interpretations of Recursive Types in an Operational Setting.
Inf. Comput. 155(1-2): 3-63 (1999) |
| 1998 |
|---|
| 7 | | Lars Birkedal,
Aurelio Carboni,
Giuseppe Rosolini,
Dana S. Scott:
Type Theory via Exact Categories.
LICS 1998: 188-198 |
| 6 | EE | Mads Tofte,
Lars Birkedal:
A Region Inference Algorithm.
ACM Trans. Program. Lang. Syst. 20(4): 724-767 (1998) |
| 1997 |
|---|
| 5 | | Lars Birkedal,
Robert Harper:
Relational Interpretations of Recursive Types in an operational Setting (Summary).
TACS 1997: 458-490 |
| 1996 |
|---|
| 4 | EE | Lars Birkedal,
Mads Tofte,
Magnus Vejlstrup:
From Region Inference to von Neumann Machines via Region Representation Inference.
POPL 1996: 171-183 |
| 1995 |
|---|
| 3 | | Lars Birkedal,
Morten Welinder:
Binding-Time Analysis for Standard ML.
Lisp and Symbolic Computation 8(3): 191-208 (1995) |
| 1994 |
|---|
| 2 | | Lars Birkedal,
Morten Welinder:
Binding-Time Analysis for Standard ML.
PEPM 1994: 61-71 |
| 1 | | Lars Birkedal,
Morten Welinder:
Hand-Writing Program Generator Generators.
PLILP 1994: 198-214 |
