Publications

Sort by: Date | Author | Title

Birkedal, L. & Welinder, M. (1994). Hand-writing program generator generators. In M. Hermenegildo & J. Penjam (Eds.), Programming Language Implementation and Logic Programming: 6th International Symposium, PLILP '94 Madrid, Spain, September 14–16, 1994 Proceedings (pp. 198-214). Springer VS. Lecture Notes in Computer Science, Vol.. 844 https://doi.org/10.1007/3-540-58402-1_15

Birkedal, L. & Welinder, M. (1995). Binding-time analysis for Standard ML. Higher-Order and Symbolic Computation, 8(3), 191-208. https://doi.org/10.1007/BF01019003

Birkedal, L. & Welinder, M. (1995). Binding-time analysis for Standard ML. In PEPM'94 - ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, Walt Disney World Vilage, Orlando, Florida, USA, 25 June 1994, Proceedings: Technical Report 94/9. (pp. 61-71). University of Melbourne. Department of Computer Science.

Birkedal, L., Tofte, M. & Vejlstrup, M. (1996). From region inference to von Neumann machines via region representation inference. In Proceedings of the 1996 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: St.Petersburg, FL, USA; ; 21 January 1996 through 24 January 1996 (pp. 171-183). Association for Computing Machinery. A C M. S I G P L A N - S I G A C T Symposium on Principles of Programming Languages. Annual Conference Record

Birkedal, L. & Harper, R. (1997). Relational interpretations of recursive types in an operational setting: (Summary). In M. Abadi & T. Ito (Eds.), Theoretical Aspects of Computer Software: Third International Symposium, TACS'97 Sendai, Japan, September 23–26, 1997 Proceedings (pp. 458-490). Springer. Lecture Notes in Engineering and Computer Science, Vol.. 1281 https://doi.org/10.1007/BFb0014563

Tofte, M. & Birkedal, L. (1998). A Region Inference Algorithm. A C M Transactions on Programming Languages and Systems, 20(4), 724-767.

Birkedal, L., Carboni, A., Rosolini, G. & Scott, D. S. (1998). Type theory via exact categories. In K. Kelly (Ed.), Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science: 21-24 Jun 1998, Indianapolis, IN (pp. 188 - 198 ). IEEE. https://doi.org/10.1109/LICS.1998.705655

Awodey, S., Birkedal, L. & Scott, D. S. (1999). Local realizability toposes and a modal logic for computability - (Extended Abstract). Electronic Notes in Theoretical Computer Science, 23(1), 13-26. https://doi.org/10.1016/S1571-0661(04)00101-X

Birkedal, L., van Oosten, J., Rosolini, G. & Scott, D. S. (Eds.) (1999). Proceedings of the Tutorial Workshop on Realizability Semantics and Applications: held June 30 and July 1, 1999 in Trento, Italy, as one of the satellite workshops associated to the Federated Logic Conference. Elsevier. Electronic Notes in Theoretical Computer Science, No. 1, Vol.. 23

Birkedal, L. & Harper, R. (1999). Relational Interpretations of Recursive Types in an Operational Setting. Information and Computation, 155(1-2), 3-63.

Birkedal, L. (2000). A general notion of realizability. In 15th Annual IEEE Symposium on Logic in Computer Science, 2000. Proceedings. (pp. 7 - 17). IEEE Signal Processing Society. https://doi.org/10.1109/LICS.2000.855751

Bauer, A. & Birkedal, L. (2000). Continuous Functionals of Dependent Types and Equilogical Spaces. In P. G. Clote & H. Schwichtenberg (Eds.), Computer Science Logic: 14th InternationalWorkshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21 – 26, 2000 Proceedings (pp. 202-216). Springer. Lecture Notes in Computer Science, Vol.. 1862 https://doi.org/10.1007/3-540-44622-2_13

Birkedal, L. (2000). Developing theories of types and computability via realizability. Elsevier. Electronic Notes in Theoretical Computer Science, Vol.. 34 https://doi.org/10.1016/S1571-0661(05)80642-5

Tofte, M. & Birkedal, L. (2000). Unification and polymorphism in region inference: essays in honour of Robin Milner. In G. Plotkin , C. Stirling & M. Tofte (Eds.), Proof, language, and interaction (pp. 389-423 ). MIT Press. Foundations of Computing

Birkedal, L. & Tofte, M. (2001). A constraint-based region inference algorithm. Theoretical Computer Science, 258(1-2), 299-392. https://doi.org/10.1016/S0304-3975(00)00025-6

Birkedal, L. (2002). A general notion of realizability. Bulletin of Symbolic Logic, 8(2), 266-282.

Awodey, S., Birkedal, L. & Scott, D. S. (2002). Local realizability toposes and a modal logic for computability. Mathematical Structures in Computer Science, 12(3), 319-334. https://doi.org/10.1017/S0960129502003675

Birkedal, L., Rosolini, G., Scott, D. S. & van Oosten, J. (Eds.) (2002). Proceedings of the Tutorial Workshop on Realizability Semantics and Applications: held June 30 and July 1, 1999 in Trento, Italy, as one of the satellite workshops associated to the Federated Logic Conference. Elsevier. Mathematical Structures in Computer Science, No. 3, special issue, Vol.. 12

Birkedal, L. & van Oosten, J. (2002). Relative and modified relative realizability. Annals of Pure and Applied Logic, 118(1-2), 115-132. https://doi.org/10.1016/S0168-0072(01)00122-1

Awodey, S. & Birkedal, L. (2003). Elementary axioms for local maps of toposes. Journal of Pure and Applied Algebra, 177(3), 215-230. https://doi.org/10.1016/S0022-4049(02)00283-9

Tofte, M., Birkedal, L., Elsman, M. & Hallenberg, N. (2004). A retrospective on Region-based Memory Management. Higher-Order and Symbolic Computation, 17(3), 245-265. https://doi.org/10.1023/B:LISP.0000029446.78563.a4

Sørensen, J. A., Kristoffersen, K. J., Cervera, A., Schiøtz, M., Lynge, T., Safar, Z. & Birkedal, L. (2004). An infrastructure for context dependent mobile multimedia communication. In 2004 IEEE 6th Workshop on Multimedia Signal Processing (pp. 462-464). IEEE Press. https://doi.org/10.1109/MMSP.2004.1436595

Birkedal, L. & Hildebrandt, T. (2004). Bigraphical Programming Languages: A LaCoMoCo research project .

Niss, H. & Birkedal, L. (Eds.) (2004). Context-aware computing: proceedings of conference on Context-aware Computing, Copenhagen, November 30, 2004. IT University of Copenhagen.

Bauer, A., Birkedal, L. & Scott, D. S. (2004). Equilogical spaces. Theoretical Computer Science, 315(1), 35-59. https://doi.org/10.1016/j.tcs.2003.11.012

Birkedal, L., Torp-Smith, N. & Reynolds, J. C. (2004). Local reasoning about a copying garbage collector. SIGPLAN Notices, 39(1), 220-231.

Birkedal, L. (Ed.) (2004). Proceedings of the 10th Conference on Category Theory in Computer Science (CTCS 2004). Elsevier. Electronic Notes in Theoretical Computer Science, Vol.. 122 https://doi.org/10.1016/j.entcs.2004.11.009

Birkedal, L., Escardo, M., Jung, A. & Rosolini, G. (Eds.) (2004). Recent Developments in Domain Theory: A collection of papers in honour of Dana S. Scott. Elsevier. Theoretical Computer Science, No. 1-3, Vol.. 316

Biering, B., Birkedal, L. & Torp-Smith, N. (2005). BI hyperdoctrines and higher-order separation logic. In M. Sagiv (Ed.), Programming Languages and Systems: 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005. Proceedings (pp. 233-247). Springer. Lecture Notes in Computer Science, Vol.. 3444 https://doi.org/10.1007/978-3-540-31987-0_17

Møgelberg, R. E. & Birkedal, L. (2005). Categorical Models of Abadi-Plotkin's logic for parametricity. Mathematical Structures in Computer Science, 15(4), 709-772.

Birkedal, L. & Møgelberg, R. E. (2005). Categorical models for Abadi and Plotkin's logic for parametricity. Mathematical Structures in Computer Science, 15(4), 709-772. https://doi.org/10.1017/S0960129505004834

Birkedal, L., Torp-Smith, N. & Yang, H. (2005). Semantics of Separation-logic Typing and Higher-order Frame Rules. In 20th Annual IEEE Symposium on Logic in Computer Science, 2005. LICS 2005. Proceedings (pp. 260-269). IEEE. https://doi.org/10.1109/LICS.2005.47

Damgaard, T. C. & Birkedal, L. (2006). Axiomatizing binding bigraphs. Nordic Journal of Computing, 33(1), 58 - 77 .

Birkedal, L., Bundgaard, M., Debois, S., Elsborg, E., Glenstrup, A. J., Hildebrandt, T. ... Niss, H. (2006). Bigraphical Programming Languages for Pervasive Computing. In T. Strang, V. Cahill & A. Quigley (Eds.), Proceedings of Pervasive 2006 International Workshop on Combining Theory and Systems Building in Pervasive Computing (CTSB'06 (pp. 653-658)

Birkedal, L., Debois, S., Elsborg, E., Hildebrandt, T. & Niss, H. (2006). Bigraphical models of context-aware systems. In L. Aceto & A. Ingólfsdóttir (Eds.), Foundations of Software Science and Computation Structures: 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006. Proceedings (Vol. 3921 , pp. 187-201). Springer VS. Lecture Notes in Computer Science, Vol.. 3921 https://doi.org/10.1007/11690634_13

Birkedal, L., Petersen, R. L., Møgelberg, R. E. & Warming, C. (2006). LILY Operational Semantics and Models of Linear Abadi-Plotkin Logic. IT University of Copenhagen. I T University. Technical Report Series, No. TR-2006-83

Møgelberg, R. E., Birkedal, L. & Petersen, R. L. (2006). Linear Abadi & Plotkin Logic. Logical Methods in Computer Science, 2/5. https://doi.org/10.2168/LMCS-2(5:2)2006

Birkedal, L., Møgelberg, R. E. & Lerc Petersen, R. (2006). Linear Abadi and Plotkin Logic. Logical Methods in Computer Science, 2(5), [2]. https://doi.org/10.2168/LMCS-2(5:2)2006

Birkedal, L., Møgelberg, R. E. & Petersen, R. L. (2006). Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus. Electronic Notes in Theoretical Computer Science, 155(1 SPEC. ISS.), 191-217. https://doi.org/10.1016/j.entcs.2005.11.057

Nanevski, A., Morrisett, G. & Birkedal, L. (2006). Polymorphism and separation in Hoare type theory. SIGPLAN Notices, 41(9), 62-73. https://doi.org/10.1145/1160074.1159812

Bohr, N. & Birkedal, L. (2006). Relational reasoning for recursive types and references. In N. Kobayashi (Ed.), Programming Languages and Systems (Vol. 4279 LNCS, pp. 79-96). 4th Asian Symposium, APLAS 2006, Sydney, Australia, November 8-10, 2006. Proceedings. Lecture Notes in Computer Science, Vol.. 4279 https://doi.org/10.1007/11924661_5

Birkedal, L., Torp-Smith, N. & Yang, H. (2006). Semantics of Separation-logic Typing and Higher-order Frame Rules for Algol-like Languages. Logical Methods in Computer Science, 2(5:1), 1-33. https://doi.org/10.2168/LMCS-2(5:1)2006

Birkedal, L., Debois, S. & Hildebrandt, T. (2006). Sortings for reactive systems. In C. Baier & H. Hermanns (Eds.), CONCUR 2006 – Concurrency Theory: 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006. Proceedings (pp. 248-262). Springer. Lecture Notes in Engineering and Computer Science, Vol.. 4137 https://doi.org/10.1007/11817949_17

Møgelberg, R. E., Birkedal, L. & Rosolini, G. (2006). Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic. Electronic Notes in Theoretical Computer Science, 155(1 SPEC. ISS.), 219-245. https://doi.org/10.1016/j.entcs.2005.11.058

Nanevski, A., Ahmed, A., Morrisett, G. & Birkedal, L. (2007). Abstract predicates and mutable ADTs in hoare type theory. In R. D. Nicola (Ed.), Programming Languages and Systems: 16th European Symposium on Programming, ESOP 2007, Held as Part of the Joint European Conferences on Theory and Practics of Software, ETAPS 2007, Braga, Portugal, March 24 - April 1, 2007. Proceedings (pp. 189-204). Springer VS. Lecture Notes in Computer Science, Vol.. 4421 https://doi.org/10.1007/978-3-540-71316-6_14

Biering, B., Birkedal, L. & Torp-Smith, N. (2007). BI-hyperdoctrines, higher-order separation logic, and abstraction. A C M Transactions on Programming Languages and Systems, 29(5), [1275499]. https://doi.org/10.1145/1275497.1275499

Birkedal, L. (2007). Book reviews of S. Awodey: Category Theory. Clarendon Press. Studia Logica: An International Journal for Symbolic Logic, 86(1). https://doi.org/10.1007/s11225-007-9053-x

Møgelberg, R. E., Birkedal, L. & Petersen, R. L. (2007). Domain theoretic models of parametric polymorphism. Theoretical Computer Science, 388(1-3), 152-172. https://doi.org/10.1016/j.tcs.2007.06.016

Birkedal, L., Damgaard, T. C., Glenstrup, A. J. & Milner, R. (2007). Matching of Bigraphs. Electronic Notes in Theoretical Computer Science, 175(4 SPEC. ISS.), 3-19. https://doi.org/10.1016/j.entcs.2007.04.013

Krishnaswam, N. R. K., Aldrich, J. & Birkedal, L. (2007). Modular Verification of the Subject-Observer Pattern via Higher-order Separation Logic. In Proceedings of 9th Workshop on Formal Techniques for Java-like Programs, FTfJP Fakultät für Informatik, Universität Magdeburg.

Displaying results 1 to 50 out of 162

Comments on content:

Sofia Rasmussen

Revised 13.09.2019