The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lars Birkedal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nina Bohr, Lars Birkedal
    Relational Reasoning for Recursive Types and References. [Citation Graph (0, 0)][DBLP]
    APLAS, 2006, pp:79-96 [Conf]
  2. Lars Birkedal, Søren Debois, Thomas Hildebrandt
    Sortings for Reactive Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:248-262 [Conf]
  3. Andrej Bauer, Lars Birkedal
    Continuous Functionals of Dependent Types and Equilogical Spaces. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:202-216 [Conf]
  4. Bodil Biering, Lars Birkedal, Noah Torp-Smith
    BI Hyperdoctrines and Higher-Order Separation Logic. [Citation Graph (0, 0)][DBLP]
    ESOP, 2005, pp:233-247 [Conf]
  5. Lars Birkedal, Søren Debois, Ebbe Elsborg, Thomas Hildebrandt, Henning Niss
    Bigraphical Models of Context-Aware Systems. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2006, pp:187-201 [Conf]
  6. Aleksandar Nanevski, Greg Morrisett, Lars Birkedal
    Polymorphism and separation in hoare type theory. [Citation Graph (0, 0)][DBLP]
    ICFP, 2006, pp:62-73 [Conf]
  7. Lars Birkedal
    A General Notion of Realizability. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:7-17 [Conf]
  8. Lars Birkedal, Aurelio Carboni, Giuseppe Rosolini, Dana S. Scott
    Type Theory via Exact Categories. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:188-198 [Conf]
  9. Lars Birkedal, Noah Torp-Smith, Hongseok Yang
    Semantics of Separation-Logic Typing and Higher-Order Frame Rules. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:260-269 [Conf]
  10. Lars Birkedal, Morten Welinder
    Binding-Time Analysis for Standard ML. [Citation Graph (0, 0)][DBLP]
    PEPM, 1994, pp:61-71 [Conf]
  11. Lars Birkedal, Morten Welinder
    Hand-Writing Program Generator Generators. [Citation Graph (0, 0)][DBLP]
    PLILP, 1994, pp:198-214 [Conf]
  12. Lars Birkedal, Noah Torp-Smith, John C. Reynolds
    Local reasoning about a copying garbage collector. [Citation Graph (0, 0)][DBLP]
    POPL, 2004, pp:220-231 [Conf]
  13. Lars Birkedal, Mads Tofte, Magnus Vejlstrup
    From Region Inference to von Neumann Machines via Region Representation Inference. [Citation Graph (0, 0)][DBLP]
    POPL, 1996, pp:171-183 [Conf]
  14. Lars Birkedal, Robert Harper
    Relational Interpretations of Recursive Types in an operational Setting (Summary). [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:458-490 [Conf]
  15. Lars Birkedal, Jaap van Oosten
    Relative and modified relative realizability. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2002, v:118, n:1-2, pp:115-132 [Journal]
  16. Lars Birkedal
    A general notion of realizability. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2002, v:8, n:2, pp:266-282 [Journal]
  17. Steven Awodey, Lars Birkedal, Dana S. Scott
    Local Realizability Toposes and a Modal Logic for Computability. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:23, n:1, pp:- [Journal]
  18. Lars Birkedal
    On propositions-as-types in realizability models. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
  19. Lars Birkedal
    Developing Theories of Types and Computability via Realizability. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:34, n:, pp:- [Journal]
  20. Lars Birkedal
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:122, n:, pp:1-0 [Journal]
  21. Lars Birkedal
    Bibliography on Realizability. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:23, n:1, pp:- [Journal]
  22. Lars Birkedal, Rasmus Ejlers Møgelberg, Rasmus Lerchedahl Petersen
    Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:155, n:, pp:191-217 [Journal]
  23. Lars Birkedal, Jaap van Oosten, Giuseppe Rosolini, Dana S. Scott
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:23, n:1, pp:- [Journal]
  24. Rasmus Ejlers Møgelberg, Lars Birkedal, Giuseppe Rosolini
    Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:155, n:, pp:219-245 [Journal]
  25. Lars Birkedal, Robert Harper
    Relational Interpretations of Recursive Types in an Operational Setting. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:155, n:1-2, pp:3-63 [Journal]
  26. Lars Birkedal, Morten Welinder
    Binding-Time Analysis for Standard ML. [Citation Graph (0, 0)][DBLP]
    Lisp and Symbolic Computation, 1995, v:8, n:3, pp:191-208 [Journal]
  27. Mads Tofte, Lars Birkedal, Martin Elsman, Niels Hallenberg
    A Retrospective on Region-Based Memory Management. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2004, v:17, n:3, pp:245-265 [Journal]
  28. Steven Awodey, Lars Birkedal, Dana S. Scott
    Local Realizability Toposes and a Modal Logic for Computability. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2002, v:12, n:3, pp:319-334 [Journal]
  29. Lars Birkedal, Rasmus Ejlers Møgelberg
    Categorical models for Abadi and Plotkin's logic for parametricity. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2005, v:15, n:4, pp:709-772 [Journal]
  30. Andrej Bauer, Lars Birkedal, Dana S. Scott
    Equilogical spaces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:315, n:1, pp:35-59 [Journal]
  31. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:316, n:1, pp:1-2 [Journal]
  32. Lars Birkedal, Mads Tofte
    A constraint-based region inference algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:299-392 [Journal]
  33. Mads Tofte, Lars Birkedal
    A Region Inference Algorithm. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1998, v:20, n:4, pp:724-767 [Journal]
  34. Aleksandar Nanevski, Amal Ahmed, Greg Morrisett, Lars Birkedal
    Abstract Predicates and Mutable ADTs in Hoare Type Theory. [Citation Graph (0, 0)][DBLP]
    ESOP, 2007, pp:189-204 [Conf]
  35. Lars Birkedal, Hongseok Yang
    Relational Parametricity and Separation Logic. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2007, pp:93-107 [Conf]
  36. Lars Birkedal, Rasmus Ejlers Møgelberg, Rasmus Lerchedahl Petersen
    Linear Abadi and Plotkin Logic [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  37. Lars Birkedal, Noah Torp-Smith, Hongseok Yang
    Semantics of Separation-Logic Typing and Higher-order Frame Rules for<br> Algol-like Languages [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  38. Lars Birkedal, Troels Christoffer Damgaard, Arne J. Glenstrup, Robin Milner
    Matching of Bigraphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:175, n:4, pp:3-19 [Journal]
  39. Bodil Biering, Lars Birkedal, Noah Torp-Smith
    BI-hyperdoctrines, higher-order separation logic, and abstraction. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2007, v:29, n:5, pp:- [Journal]

  40. Unification and polymorphism in region inference. [Citation Graph (, )][DBLP]


  41. On the Construction of Sorted Reactive Systems. [Citation Graph (, )][DBLP]


  42. Nested Hoare Triples and Frame Rules for Higher-Order Store. [Citation Graph (, )][DBLP]


  43. Verifying Generics and Delegates. [Citation Graph (, )][DBLP]


  44. A Realizability Model for Impredicative Hoare Type Theory. [Citation Graph (, )][DBLP]


  45. Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types. [Citation Graph (, )][DBLP]


  46. A Semantic Foundation for Hidden State. [Citation Graph (, )][DBLP]


  47. A Simple Model of Separation Logic for Higher-Order Store. [Citation Graph (, )][DBLP]


  48. Ynot: dependent types for imperative programs. [Citation Graph (, )][DBLP]


  49. Logical Step-Indexed Logical Relations. [Citation Graph (, )][DBLP]


  50. A relational modal logic for higher-order stateful ADTs. [Citation Graph (, )][DBLP]


  51. Design patterns in separation logic. [Citation Graph (, )][DBLP]


  52. Relational parametricity for references and recursive types. [Citation Graph (, )][DBLP]


  53. Verifying event-driven programs using ramified frame properties. [Citation Graph (, )][DBLP]


  54. Synthetic domain theory and models of linear Abadi & Plotkin logic. [Citation Graph (, )][DBLP]


  55. Relational Parametricity and Separation Logic [Citation Graph (, )][DBLP]


  56. Higher-Order Separation Logic in Isabelle/HOLCF. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002