ITU
Rasmus Ejlers Møgelberg

Rasmus Ejlers Møgelberg

Associate Professor

IT University of Copenhagen
Rued Langgaards Vej 7
DK-2300 Copenhagen S
Denmark

Building: 4C12

Phone: +45 7218 5297

Information Desk: 72185000

Research Group Coordinator

Programming Logic and Semantics

View graph of relations

1 - 34 out of 34Page size: 100
  1. Published

    Interpreting polymorphic FPC into domain theoretic models of parametric polymorphism

    Møgelberg, R. E., 2006, In: Lecture Notes in Computer Science. 4052

    Research output: Journal Article or Conference Article in Journal › Conference article › Research › peer-review

  2. Published

    Relational parametricity for Computational Effects

    Møgelberg, R. E. & Simpson, A., 2007.

    Research output: Contribution to conference - NOT published in proceeding or journal › Paper › Research › peer-review

  3. Published

    Relational parametricity for control considered as a computational effect

    Møgelberg, R. E. & Simpson, A., 2007, In: Electronical Notes in Theoretical Computer Science. 173

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  4. Published

    A logic for parametric polymorphism with effects

    Møgelberg, R. E. & Simpson, A., 2008, In: Lecture Notes in Computer Science. 4941, p. 142-156

    Research output: Journal Article or Conference Article in Journal › Conference article › Research › peer-review

  5. Published

    Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic

    Møgelberg, R. E., Birkedal, L. & Rosolini, G., 2 Sep 2008, In: Annals of Pure and Applied Logic. 155, 2, p. 115-133 19 p.

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  6. Published

    Category-theoretic models of linear Abadi & Plotkin Logic.

    Birkedal, L., Møgelberg, R. E. & Lerchedahl Petersen, R., 2008, In: Theory and Applications of Categories. 20, 7, p. 116-151 35 p.

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  7. Published

    From parametric polymorphism to models of polymorphic FPC

    Møgelberg, R. E., 2009, In: Mathematical Structures in Computer Science. 19, 4, p. 639-686

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  8. Published

    Enriching an effect calculus with linear types

    Egger, J., Møgelberg, R. E. & Simpson, A., 2009, In: Lecture Notes in Computer Science. 5771, p. 240 254 p.

    Research output: Journal Article or Conference Article in Journal › Conference article › Research › peer-review

  9. Published

    Linearly-used Continuations in the Enriched Effect Calculus

    Egger, J., Møgelberg, R. E. & Simpson, A., 20 Mar 2010, In: Lecture Notes in Computer Science. 6014, p. 18-32

    Research output: Journal Article or Conference Article in Journal › Conference article › Research › peer-review

  10. Published

    Domain theoretic models of parametric polymorphism

    Møgelberg, R. E., Birkedal, L. & Petersen, R. L., 2010, In: Theoretical Computer Science. 388, 1-3, p. 152-172

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  11. Published

    A nominal relational model for local store

    Møgelberg, R. E., 2010, In: Electronic Notes in Theoretical Computer Science. 265, p. 403-421 19 p.

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  12. Published

    Linearly-used state in models of call-by-value

    Møgelberg, R. E. & Staton, S., 2011, CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science. Springer, p. 298-313 15 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

  13. Published

    First steps in synthetic guarded domain theory: step-indexing in the topos of trees

    Birkedal, L., Møgelberg, R. E., Støvring, K. & schwinghammer, J., 2011, In: Annual Symposium on Logic in Computer Science. p. 55-64

    Research output: Journal Article or Conference Article in Journal › Conference article › Research › peer-review

  14. Published

    First steps in synthetic guarded domain theory: step-indexing in the topos of trees

    Birkedal, L., Møgelberg, R. E., Schwinghammer, J. & Støvring, K., 3 Oct 2012, In: Logical Methods in Computer Science. 8, 4

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  15. Published

    Linear-use CPS translations in the enriched effect calculus

    Møgelberg, R. E., Simpson, A. & Egger, J., 2012, In: Logical Methods in Computer Science. 8, 4

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  16. Published

    Intensional type theory with guarded recursive types qua fixed points on universes

    Møgelberg, R. E. & Birkedal, L., 2013, In: Annual Symposium on Logic in Computer Science. p. 213-222 10 p.

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  17. Published

    A type theory for productive coprogramming via guarded recursion

    Møgelberg, R. E., 2014, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS): CSL-LICS '14. Association for Computing Machinery, 10 p. 71. (Annual Symposium on Logic in Computer Science).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

  18. Published

    Linear usage of state

    Møgelberg, R. E. & Staton, S., 25 Mar 2014, In: Logical Methods in Computer Science. 10, 1

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  19. Published

    The Enriched Effect Calculus: Syntax and Semantics

    Møgelberg, R. E., Simpson, A. & Egger, J., 2014, In: Journal of Logic and Computation. 24, 3, p. 615-654

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  20. Published

    A model of guarded recursion with clock synchronisation

    Bizjak, A. & Møgelberg, R. E., 2015, In: Electronic Notes in Theoretical Computer Science. 319, p. 83-101

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  21. Published

    A Model of PCF in Guarded Type Theory

    Paviotti, M., Møgelberg, R. E. & Birkedal, L., 2015, In: Electronic Notes in Theoretical Computer Science. 319, p. 333-349

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  22. Published

    Denotational semantics of recursive types in synthetic guarded domain theory

    Møgelberg, R. E. & Paviotti, M., 2016, LICS '16 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery, p. 317-326 10 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

  23. Published

    Guarded Dependent Type Theory with Coinductive Types

    Bizjak, A., Grathwohl, H. B., Clouston, R., Møgelberg, R. E. & Birkedal, L., 2016, Foundations of Software Science and Computation Structure: 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings. Springer, p. 20-35 16 p. (Lecture Notes in Computer Science, Vol. 9634).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

  24. Published

    The Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion

    Bahr, P., Grathwohl, H. B. & Møgelberg, R. E., 18 Aug 2017, In: Annual Symposium on Logic in Computer Science. 12 p.

    Research output: Journal Article or Conference Article in Journal › Conference article › Research › peer-review

  25. Published

    Denotational semantics of recursive types in synthetic guarded domain theory

    Møgelberg, R. E. & Paviotti, M., 15 May 2018, In: Mathematical Structures in Computer Science. 46 p.

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  26. Published

    The Clocks They Are Adjunctions: Denotational Semantics for Clocked Type Theory

    Mannaa, B. & Møgelberg, R. E., 2018, 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018). Schloss Dagstuhl--Leibniz-Zentrum für Informatik, Vol. 108. 17 p. 23. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 108).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

  27. Published

    What makes guarded types tick?

    Bahr, P., Mannaa, B. & Møgelberg, R. E., 2018.

    Research output: Contribution to conference - NOT published in proceeding or journal › Paper › Research › peer-review

  28. Published

    Modal dependent type theory and dependent right adjoints

    Birkedal, L., Clouston, R., Mannaa, B., Møgelberg, R. E., M. Pitts, A. & Spitters, B., Dec 2019, In: Mathematical Structures in Computer Science. 21 p.

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  29. Published

    Simply RaTT: A Fitch-style Modal Calculus for Reactive Programming

    Bahr, P., Graulund, C. U. & Møgelberg, R. E., 2019, Proceedings of the ACM on Programming Languages. IFCP ed. Association for Computing Machinery, Vol. 3. 109

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

  30. Published

    Bisimulation as path type for guarded recursive types

    Veltri, N. & Møgelberg, R. E., 2019, Proceedings of the ACM on Programming Languages. Association for Computing Machinery, Vol. 3. 29 p. 4

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

  31. Published

    Ticking clocks as dependent right adjoints: Denotational semantics for clocked type theory

    Mannaa, B., Møgelberg, R. E. & Veltri, N., 15 Dec 2020, In: Logical Methods in Computer Science. 16, 4, p. 17:1–17:31 31 p., 6278.

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  32. Published

    Galois Connections for Recursive Types

    Al-Sibahi, A. S., Jensen, T. P., Møgelberg, R. E. & Wasowski, A., 2020, From Lambda Calculus to Cybersecurity Through Program Analysis. Springer, p. 105-131 (Lecture Notes in Computer Science, Vol. 12065).

    Research output: Conference Article in Proceeding or Book/Report chapter › Book chapter › Research › peer-review

  33. Published

    Denotational semantics for guarded dependent type theory

    Bizjak, A. & Møgelberg, R. E., Apr 2020, In: Mathematical Structures in Computer Science. 30, 4, p. 342-378

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  34. Published

    Diamonds are not forever: Liveness in reactive programming with guarded recursion

    Bahr, P., Graulund, C. U. & Møgelberg, R. E., Jan 2021, ACM SIGPLAN Symposium on Principles of Programming Languages. POPL ed. Association for Computing Machinery, Vol. 5. 28 p. (Proceedings of the ACM on Programming Languages).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

ID: 263471