Rasmus Ejlers Møgelberg

Publikation

Publikationer pr. år 2004 2005 2008 2009 2010 2014 2018 2019 2020 2025

• 19 Tidsskriftartikel
• 11 Konferencebidrag i proceedings
• 8 Konferenceartikel
• 5 Rapport
• 3 Mere
  • 2 Paper
  • 1 Bidrag til bog/antologi

Publikationer pr. år

Publikationer pr. år

Søgeresultater

• 2025

  Modelling Recursion and Probabilistic Choice in Guarded Type Theory

  Stassen, P., Møgelberg, R. E., Zwart, M. A., Aguirre, A. & Birkedal, L., 2025, I: Proceedings of the ACM on Programming Languages. 9, POPL

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Konferenceartikel › Forskning › peer review

  Åben adgang

  Fil

  • Type Theory 100%
  • Recursion 100%
  • Probabilistic Choice 100%
  • Programming Language 66%
  • Programming Languages 50%
• 2024

  What Monads Can and Cannot Do with a Bit of Extra Time

  Møgelberg, R. E. & Zwart, M. A., 2024, 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024) . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Bind 288. s. 39:1--39:18 18 s. 39

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Monads 100%
  • Delay Monad 100%
  • Type Theory 100%
  • Recursive 100%
  • Distributive Law 100%
• 2023

  Asynchronous Modal FRP

  Bahr, P. & Møgelberg, R. E., 31 aug. 2023, I: Proceedings of the ACM on Programming Languages. 7, ICFP, s. 476-510 205.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Konferenceartikel › Forskning › peer review

  Åben adgang
• 2022

  Greatest HITs: Higher Inductive Types in Coinductive Definitions via Induction under Clocks

  Kristensen, M. B., Møgelberg, R. E. & Vezzosi, A., 2022, Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery, 13 s. 42

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil
• 2021

  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 udg. Association for Computing Machinery, Bind 5. 28 s. (Proceedings of the ACM on Programming Languages).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Guarded Recursion 100%
  • Linear Temporal Logic 100%
  • Liveness 100%
  • Diamond 100%
  • Reactive Programming 100%

• Two Guarded Recursive Powerdomains for Applicative Simulation

  Møgelberg, R. E. & Vezzosi, A., dec. 2021, Proceedings 37th Conference on Mathematical Foundations of Programming Semantics. Electronic Proceedings in Theoretical Computer Science, Bind 351. s. 200-217

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang
• 2020

  Denotational semantics for guarded dependent type theory

  Bizjak, A. & Møgelberg, R. E., apr. 2020, I: Mathematical Structures in Computer Science. 30, 4, s. 342-378

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  Fil

  • Dependent Type Theory 100%
  • Denotational Semantics 100%
  • Presheaves 100%
  • Type Theory 100%
  • Dependent Type 100%

• 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, s. 105-131 (Lecture Notes in Computer Science, Bind 12065).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Bidrag til bog/antologi › Forskning › peer review

  Åben adgang

  Fil

  • Galois Connection 100%
  • Recursive Types 100%
  • Abstract Domains 100%
  • Data Type 100%
  • Static Program Analysis 100%

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

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  Fil

  • Type Theory 100%
  • Denotational Semantics 100%
  • Right Adjoint 100%
  • Adjoints 100%
  • Syntactics 50%
• 2019

  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, Bind 3. 29 s. 4

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Bisimulation 100%
  • Biosimilarity 100%
  • Recursive Types 100%
  • Formal Verification 100%
  • Transition System 100%

• 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, I: Mathematical Structures in Computer Science. 21 s.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  Fil

  • Type Theory 100%
  • Dependent Type 100%
  • Adjoints 100%
  • Right Adjoint 100%
  • Modal Necessity 25%

• 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 udg. Association for Computing Machinery, Bind 3. 109

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Calculus 100%
  • Modal 100%
  • Reactive Programming 100%
  • Functional Reactive Programming 100%
  • Type Systems 100%
• 2018

  Denotational semantics of recursive types in synthetic guarded domain theory

  Møgelberg, R. E. & Paviotti, M., 15 maj 2018, I: Mathematical Structures in Computer Science. 46 s.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Fil

• 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 fuer Informatik GmbH, Bind 108. 17 s. 23. (Leibniz International Proceedings in Informatics (LIPIcs), Bind 108).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Syntactics 100%
  • Strong Normalization 100%
  • Type Checking 100%
  • Denotational Semantics 100%
  • Programming Language Feature 100%

• What makes guarded types tick?

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

  Publikation: Konferencebidrag - EJ publiceret i proceeding eller tidsskrift › Paper › Forskning › peer review

  Åben adgang

  Fil

  • Syntactics 100%
  • Strong Normalization 100%
  • Type Checking 100%
  • Denotational Semantics 100%
  • Type Theory 100%
• 2017

  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, I: Annual Symposium on Logic in Computer Science. 12 s.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Konferenceartikel › Forskning › peer review

  Åben adgang

  Fil

  • Type Theory 100%
  • Guarded Recursion 100%
  • Reduction Semantics 100%
  • Type Systems 100%
  • Strong Normalization 100%
• 2016

  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, s. 317-326 10 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Fil

  • Guarded Recursion 100%
  • Denotational Semantics 100%
  • Recursive Types 100%
  • Domain Theory 100%
  • Type Theory 66%

• 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, s. 20-35 16 s. (Lecture Notes in Computer Science, Bind 9634).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Dependent Type Theory 100%
  • Coinductive Types 100%
  • Soundness 100%
  • Recursive Definition 100%
  • Recursive 100%
• 2015

  A model of guarded recursion with clock synchronisation

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  Fil

  • Calculus 100%
  • Guarded Recursion 100%
  • Clock Synchronization 100%
  • Typing Rule 33%
  • Denotational Semantics 33%

• A Model of PCF in Guarded Type Theory

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  Fil

  • Type Theory 100%
  • Guarded Recursion 100%
  • Operational Semantics 100%
  • Denotational Semantics 100%
  • Model Building 50%
• 2014

  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 s. 71. (Annual Symposium on Logic in Computer Science).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

• Linear usage of state

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  • Call-by-value 100%
  • Call by Value 100%
  • Calculus 60%
  • Monads 20%
  • Linear Type Theory 20%

• The Enriched Effect Calculus: Syntax and Semantics

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  • And-States 100%
  • Syntactics 100%
  • Soundness 100%
  • Imperative Feature 100%
  • Calculus 100%
• 2013

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

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  • Recursive Types 100%
  • Intensional Type Theory 100%
  • Type Theory 100%
  • Fixed Points 100%
  • Recursive Functions 80%
• 2012

  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 okt. 2012, I: Logical Methods in Computer Science. 8, 4

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  • Step-indexing 100%
  • Domain Theory 100%
  • Topos 100%
  • Programming Languages 66%
  • Recursive Types 66%

• Linear-use CPS translations in the enriched effect calculus

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  • Calculus 100%
  • Continuation-passing Style 100%
  • Translation Style 100%
  • Call by Value 100%
  • Main Theorem 100%
• 2011

  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, I: Annual Symposium on Logic in Computer Science. s. 55-64

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Konferenceartikel › Forskning › peer review

• 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, s. 298-313 15 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
• 2010

  A nominal relational model for local store

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  • Relational Model 100%
  • Relational Reasoning 100%
  • Relational Database 100%
  • Presheaf Models 33%
  • Relational Parametricity 16%

• Domain theoretic models of parametric polymorphism

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  • Parametric Polymorphism 100%
  • Parametricity 100%
  • Domain Theory 100%
  • Theoretical Modeling 100%
  • lambda-calculus 100%

• Linearly-used Continuations in the Enriched Effect Calculus

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Konferenceartikel › Forskning › peer review
• 2009

  Enriching an effect calculus with linear types

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Konferenceartikel › Forskning › peer review

  • Calculus 100%
  • Linear Types 100%
  • Syntactics 100%
  • Call by Value 100%
  • Type Theory 40%

• From parametric polymorphism to models of polymorphic FPC

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  • Parametric Polymorphism 100%
  • Domain Theory 100%
  • Impredicative Polymorphism 100%
  • Parametric 100%
  • Parametric Model 50%

• Relational Parametricity for Computational Effects

  Møgelberg, R. E. & Simpson, A., 2009, I: Logical Methods in Computer Science. 5, 3, 31 s.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  • Relational Parametricity 100%
  • Computational Effects 100%
  • Apply It 100%
  • Parametric 100%
  • Mathematical Formulation 100%
• 2008

  A logic for parametric polymorphism with effects

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Konferenceartikel › Forskning › peer review

• Category-theoretic models of linear Abadi & Plotkin Logic.

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  • Recursion 100%
  • Parametricity 100%
  • Theoretical Modeling 100%
  • Theoretic Model 100%
  • Parametric 100%

• Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  • Parametricity 100%
  • Domain Model 100%
  • Lily 100%
  • Parametric 100%
  • Domain Theory 100%
• 2007

  Relational parametricity for Computational Effects

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

  Publikation: Konferencebidrag - EJ publiceret i proceeding eller tidsskrift › Paper › Forskning › peer review

• Relational parametricity for control considered as a computational effect

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review
• 2006

  Interpreting polymorphic FPC into domain theoretic models of parametric polymorphism

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

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Konferenceartikel › Forskning › peer review
• 2005

  Categorical Models of Abadi-Plotkin's logic for parametricity

  Møgelberg, R. E. & Birkedal, L., 2005, I: Mathematical Structures in Computer Science. 15, 4, s. 709-772 64 s.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Fil

  • Categorical Model 100%
  • Parametricity 100%
  • Parametric Model 100%
  • Relational Parametricity 66%
  • Lambda Calculus 33%

• Categorical Models of PILL

  Møgelberg, R. E., Birkedal, L. & Lerchedahl Petersen, R., feb. 2005, TR-2005-58 udg. Copenhagen: IT-Universitetet i København. 17 s. (IT University Technical Report Series; Nr. TR-2005-58).

  Publikation: Bog / Antologi / Rapport › Rapport › Forskning

  Åben adgang

  Fil

  • Comonad 100%
  • Linear Categories 100%

• Parametric Completion for Models of Polymorphic Linear / Intuitionistic Lambda Calculus

  Møgelberg, R. E., feb. 2005, TR-2005-60 udg. Copenhagen: IT-Universitetet i København. 29 s. (IT University Technical Report Series; Nr. TR-2005-60).

  Publikation: Bog / Antologi / Rapport › Rapport › Forskning

  Åben adgang

  Fil

  • Lambda Calculus 100%
  • Intuitionistic 100%
  • Topos 100%
  • Calculus 100%
  • Parametric 100%

• Parametric Domain-theoretic models of Linear Abadi & Plotkin Logic

  Birkedal, L., Møgelberg, R. E. & Lerchedahl Petersen, R., feb. 2005, TR-2005-57 udg. Copenhagen: IT-Universitetet i København. 76 s. (IT University Technical Report Series; Nr. TR-2005-57).

  Publikation: Bog / Antologi / Rapport › Rapport › Forskning

  Åben adgang

  Fil

  • Complete Class 100%
  • Universal Model 100%
  • Parametric Domain 100%
  • Partial Equivalence 100%
  • Parametric 100%

• Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic

  Møgelberg, R. E., Birkedal, L. & Rosolini, G., feb. 2005, TR-2005-59 udg. Copenhagen: IT-Universitetet i København. 52 s. (IT University Technical Report Series; Nr. TR-2005-59).

  Publikation: Bog / Antologi / Rapport › Rapport › Forskning

  Åben adgang

  Fil

  • Parametricity 100%
  • Domain Model 100%
  • Lily 100%
  • Parametric 100%
  • Domain Theory 100%
• 2004

  On the Definition of Parametricity

  Birkedal, L. & Møgelberg, R. E., feb. 2004, TR-2004-44 udg. Copenhagen : IT-Universitetet i København. 77 s. (IT University Technical Report Series; Nr. TR-2004-44).

  Publikation: Bog / Antologi / Rapport › Rapport › Forskning

  Åben adgang

  Fil

  • Parametricity 100%
  • Parametric Model 100%
  • Relational Parametricity 66%
  • Lambda Calculus 33%
  • Theoretic Formulation 33%