- Nordic Journal of Computing Axiomatizing Binding Bigraphs
- HandWriting Program Generator Generators Lars Birkedal & Morten Welinder
- Correctness of a Garbage Collector via Local Reasoning
- Operational Semantics and Models of Linear Abadi-Plotkin Logic
- A Step-indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined
- Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
- Categorical Models of PILL Rasmus Ejlers Mgelberg
- Under consideration for publication in Math. Struct. in Comp. Science Categorical Models for Abadi-Plotkin's Logic
- Elementary Axioms for Local Maps of Toposes Steven Awodey Lars Birkedal y
- ' ( ) 0 1 2 3 4 5 6 7 8 6 9 @ @ A B 8 C D 7 8 A E 9 B F G H @ 9 B I A E G P Q R Q S P T U V P W X Y 7 T ` W a Q P b c c d
- A ConstraintBased Region Inference Lars Birkedal 1
- A Simple Model of Separation Logic for Higher-order Store
- An Implementation of Bigraph Matching Arne John Glenstrup , Troels Christoffer Damgaard, Lars Birkedal, Espen Hjsgaard
- Bibliography 117 [9] David MacQueen. Modules for Standard ML. Technical report, AT & T Bell Labo
- Logical Methods in Computer Science Volume 00, Number 0, Pages 000000
- Logical Methods in Computer Science Vol. 7 (2:16) 2011, pp. 137
- Lisp and Symbolic Computation, , 1?? () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- Modular Verification of Linked Lists with Views via Separation Logic
- Design Patterns in Separation Logic Neelakantan R. Krishnaswami Jonathan
- Axiomatixing Binding Bigraphs Troels Christoffer Damgaard
- Electronic Notes in Theoretical Computer Science 34 (2000) http://www.elsevier.nl/locate/entcs/volume34.html 280 pages
- Relational Parametricity for References and Recursive Types Lars Birkedal Kristian Stvring Jacob Thamsborg
- Semantics of Separation-logic Typing and Higher-order Frame Rules Lars Birkedal Noah Torp-Smith
- A Region Inference Algorithm University of Copenhagen
- A Retrospective on RegionBased Memory Management M. Tofte (tofte@itu.dk), L. Birkedal (birkedal@itu.dk) # ,
- Relational Interpretations of Recursive Types in an Operational Setting
- Under consideration for publication in Math. Struct. in Comp. Science Local Realizability Toposes and a Modal
- Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic
- Parametric Domain-theoretic models of Linear Abadi & Plotkin Logic
- Equilogical Spaces Andrej Bauer, 1 Lars Birkedal, 2 Dana S. Scott 3
- MFPS XX1 Preliminary Version Synthetic domain theory and models of Linear
- http://journals.cambridge.org Downloaded: 14 Jul 2010 IP address: 130.226.133.62 Math. Struct. in Comp. Science (2010), vol. 20, pp. 655703. c Cambridge University Press 2010
- A Normalization Code in Standard ML The following Standard ML code can be used for solving
- On the Definition of Parametricity L. Birkedal
- mixequation, 10 mk op operator, 55, 64, 65, 124
- Bigraphical Programming Languages A LaCoMoCo research project
- Parametric Domaintheoretic models of Linear Abadi & Plotkin Logic
- Relative and Modi ed Relative Realizability Lars Birkedal
- Local Reasoning about a Copying Garbage Collector Lars Birkedal
- A Realizability Model for Impredicative Hoare Type Theory
- Verifying Generics and Delegates Kasper Svendsen1
- From Region Inference to von Neumann Machines via Region Representation Lars Birkedal, Carnegie Mellon University \Lambda Mads Tofte, University of Copenhagen y
- Unification and Polymorphism in Region Inference Mads Tofte, Department of Computer Science, University of Copenhagen
- Under consideration for publication in Math. Struct. in Comp. Science Categorical Models for Abadi-Plotkin's Logic
- Dialectica Interpretations A Categorical Analysis
- Bigraphical Models of Context-aware Systems Lars Birkedal
- APPENDIX B. THE STATE OF THE SYSTEM 112 probably be done for exception and data constructors printed at toplevel. Similarly,
- HigherOrder Separation Logic and Abstraction Lars Birkedal # and Noah TorpSmith #
- BI-Hyperdoctrines, Higher-order Separation Logic, and Abstraction
- Under consideration for publication in Formal Aspects of Computing An Inductive Characterization of Matching
- Step-Indexed Relational Reasoning for Countable Nondeterminism
- Verifying object-oriented programs with higher-order separation logic in Coq
- First steps in synthetic guarded domain theory: step-indexing in the topos of trees
- Step-Indexed Kripke Models over Recursive Worlds Lars Birkedal
- A Step-indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces
- A Metric Model of Lambda Calculus with Guarded Recursion Lars Birkedal
- A Relational Realizability Model for Higher-Order Stateful ADTs
- The Category-Theoretic Solution of Recursive Metric-Space Equations
- Verifying design patterns in Hoare Type Theory Kasper Svendsen, Alexandre Buisse and Lars Birkedal
- Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic
- Domain-theoretic models of parametric polymorphism L. Birkedal
- Under consideration for publication in J. Functional Programming 1 Hoare Type Theory, Polymorphism and
- A Realizability Model for Impredicative Hoare Type Rasmus Lerchedahl Petersen& Lars Birkedal
- Relational Parametricity and Separation Logic Lars Birkedal1
- Matching of Bigraphs Lars Birkedal
- Axiomatizing Binding Bigraphs (revised) Troels Christoffer Damgaard
- BI Hyperdoctrines, Higher-Order Separation Logic, and Abstraction
- Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic
- BI Hyperdoctrines and Higher-Order Separation Logic
- Bigraphical Programming Languages for Pervasive Computing
- A Step-Indexed Kripke Model of Separation Logic for Storable Locks
- Relational Interpretations of Recursive Types in an Operational Setting ?
- Axiomatixing Binding Bigraphs Troels Christoffer Damgaard
- Verifying Event-Driven Programs using Ramified Frame Neelakantan R. Krishnaswami
- The Category-Theoretic Solution of Recursive Metric-Space Equations
- Higher-order Contexts via Games and the Int-construction
- MFPS XX1 Preliminary Version Parametric Domain-theoretic Models of
- Categorical Models of PILL Rasmus Ejlers Mgelberg
- Preliminary Call for Participation The 2002 Federated Logic Conference
- A General Notion of Realizability L. Birkedal
- Abstract Predicates and Mutable ADTs in Hoare Type Theory Aleksandar Nanevski Amal Ahmed Greg Morrisett Lars Birkedal
- A Relational Modal Logic for Higher-Order Stateful ADTs Derek Dreyer
- Polymorphism and Separation in Hoare Type Theory Aleksandar Nanevski Greg Morrisett
- Relational Interpretations of Recursive Types in an Operational Setting \Lambda
- Partiality, State and Dependent Types Kasper Svendsen1
- Bigraphical Models of Context-aware Systems L. Birkedal, S. Debois, E. Elsborg, T. Hildebrandt, and H. Niss
- Realizability Semantics of Parametric Polymorphism, General References,
- Realizability Semantics of Parametric Polymor-phism, General References, and Recursive Types
- Sortings for Reactive Systems Lars Birkedal, Sren Debois, and Thomas Hildebrandt
- Ynot : Dependent Types for Imperative Programs Aleksandar Nanevski
- Relational Reasoning for Recursive Types and References
- Nested Hoare Triples and Frame Rules for Higher-order Store$
- Technical Report DIKUTR98/25 Department of Computer Science
- Continuous Functionals of Dependent Types and Equilogical Spaces
- Solutions of Generalized Recursive Metric-Space Equations
- Electronic Notes in Theoretical Computer Science 34 (2000) http://www.elsevier.nl/locate/entcs/volume34.html 280 pages
- A Semantic Foundation for Hidden State Jan Schwinghammer1
- AN INFRASTRUCTURE FOR CONTEXT DEPENDENT MOBILE MULTIMEDIA COMMUNICATION
- A Kripke Logical Relation for Effect-Based Program Transformations
- Sortings for Reactive Systems Lars Birkedal
- Local Reasoning about a Copying Garbage Collector NOAH TORP-SMITH and LARS BIRKEDAL
- Programming with Regions in the ML Kit (for Version 4)
- Preliminary Call for Participation The 2002 Federated Logic Conference
- Two for the Price of One: Lifting Separation Logic Assertions Jacob Thamsborg and Lars Birkedal
- Matching of Bigraphs Lars Birkedal1
- Polymorphism and Separation in Hoare Type Theory Aleksandar Nanevski Greg Morrisett Lars Birkedal
- Technical Report DIKUTR97/12 Department of Computer Science
- Modular Verification of the Subject-Observer Pattern via Higher-Order Separation Logic
- On the Construction of Sorted Reactive Lars Birkedal, Sren Debois, and Thomas Hildebrandt
- Under consideration for publication in Math. Struct. in Comp. Science Formalizing Domains, Ultrametric Spaces and
- Modelling, Simulation, and Type Systems
- The Impact of Higher-Order State and Control Effects on Local Relational Reasoning
- Nested Hoare Triples and Frame Rules for Higher-order Store
- ZU064-05-FPR main 27 July 2011 20:27 Under consideration for publication in J. Functional Programming 1
- Formalized Verification of Snapshotable Trees: Separation and Sharing
- FIRST STEPS IN SYNTHETIC GUARDED DOMAIN THEORY: STEP-INDEXING IN THE TOPOS OF TREES
- A Concurrent Logical Relation Lars Birkedal
- A framework for higher-order separation logic in Coq Jesper Bengtson, Jonas Braband Jensen, and Lars Birkedal
- Under consideration for publication in Math. Struct. in Comp. Science A Step-Indexed Kripke Model of Hidden
- Fictional Separation Logic Jonas Braband Jensen and Lars Birkedal
- STEP-INDEXED RELATIONAL REASONING FOR COUNTABLE NONDETERMINISM
