Rasmus Ejlers Møgelberg

647 total citations
33 papers, 285 citations indexed

About

Rasmus Ejlers Møgelberg is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Rasmus Ejlers Møgelberg has authored 33 papers receiving a total of 285 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Artificial Intelligence, 19 papers in Computational Theory and Mathematics and 7 papers in Computer Networks and Communications. Recurrent topics in Rasmus Ejlers Møgelberg's work include Logic, programming, and type systems (31 papers), Logic, Reasoning, and Knowledge (27 papers) and Formal Methods in Verification (13 papers). Rasmus Ejlers Møgelberg is often cited by papers focused on Logic, programming, and type systems (31 papers), Logic, Reasoning, and Knowledge (27 papers) and Formal Methods in Verification (13 papers). Rasmus Ejlers Møgelberg collaborates with scholars based in Denmark, United Kingdom and Canada. Rasmus Ejlers Møgelberg's co-authors include Lars Birkedal, Kristian Støvring, Jan Schwinghammer, Rasmus Lerchedahl Petersen, Alex Simpson, Sam Staton, Andrew Simpson, Aleš Bizjak, Jan Egger and Bas Spitters and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Annals of Pure and Applied Logic.

In The Last Decade

Rasmus Ejlers Møgelberg

31 papers receiving 269 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Rasmus Ejlers Møgelberg Denmark 10 275 148 62 20 13 33 285
Venanzio Capretta United Kingdom 6 195 0.7× 133 0.9× 47 0.8× 11 0.6× 38 2.9× 13 222
Jan Schwinghammer Germany 9 219 0.8× 123 0.8× 80 1.3× 7 0.3× 42 3.2× 19 238
Kristian Støvring Denmark 10 273 1.0× 157 1.1× 76 1.2× 8 0.4× 36 2.8× 23 288
Clemens Ballarin Germany 8 133 0.5× 99 0.7× 32 0.5× 9 0.5× 9 0.7× 15 162
Steffen van Bakel United Kingdom 9 305 1.1× 251 1.7× 20 0.3× 9 0.5× 9 0.7× 38 313
Bartek Klin Poland 9 241 0.9× 247 1.7× 21 0.3× 16 0.8× 4 0.3× 37 292
Gianluigi Bellin Italy 9 287 1.0× 201 1.4× 29 0.5× 9 0.5× 3 0.2× 19 302
Gian Luca Cattani United Kingdom 10 148 0.5× 143 1.0× 36 0.6× 34 1.7× 4 0.3× 18 193
Corina Ĉırstea United Kingdom 9 200 0.7× 168 1.1× 11 0.2× 14 0.7× 10 0.8× 40 224
John Longley United Kingdom 7 145 0.5× 125 0.8× 12 0.2× 18 0.9× 17 1.3× 16 159

Countries citing papers authored by Rasmus Ejlers Møgelberg

Since Specialization
Citations

This map shows the geographic impact of Rasmus Ejlers Møgelberg's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Rasmus Ejlers Møgelberg with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rasmus Ejlers Møgelberg more than expected).

Fields of papers citing papers by Rasmus Ejlers Møgelberg

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Rasmus Ejlers Møgelberg. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Rasmus Ejlers Møgelberg. The network helps show where Rasmus Ejlers Møgelberg may publish in the future.

Co-authorship network of co-authors of Rasmus Ejlers Møgelberg

This figure shows the co-authorship network connecting the top 25 collaborators of Rasmus Ejlers Møgelberg. A scholar is included among the top collaborators of Rasmus Ejlers Møgelberg based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Rasmus Ejlers Møgelberg. Rasmus Ejlers Møgelberg is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Møgelberg, Rasmus Ejlers, et al.. (2025). Modelling Recursion and Probabilistic Choice in Guarded Type Theory. Proceedings of the ACM on Programming Languages. 9(POPL). 1417–1445. 1 indexed citations
2.
Møgelberg, Rasmus Ejlers, et al.. (2023). Asynchronous Modal FRP. Proceedings of the ACM on Programming Languages. 7(ICFP). 476–510. 1 indexed citations
3.
Møgelberg, Rasmus Ejlers, et al.. (2022). Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks. 1–13. 5 indexed citations
4.
Møgelberg, Rasmus Ejlers, et al.. (2021). Two Guarded Recursive Powerdomains for Applicative Simulation. Electronic Proceedings in Theoretical Computer Science. 351. 200–217. 3 indexed citations
5.
Møgelberg, Rasmus Ejlers, et al.. (2020). Ticking clocks as dependent right adjoints: Denotational semantics for clocked type theory. SHILAP Revista de lepidopterología. 4 indexed citations
6.
7.
Møgelberg, Rasmus Ejlers, et al.. (2017). The clocks are ticking: No more delays!. IT University Of Copenhagen (IT University of Copenhagen). 1–12. 18 indexed citations
8.
Møgelberg, Rasmus Ejlers, et al.. (2016). Denotational semantics of recursive types in synthetic guarded domain theory. IT University Of Copenhagen (IT University of Copenhagen). 317–326. 9 indexed citations
9.
Møgelberg, Rasmus Ejlers & Sam Staton. (2014). Linear usage of state. Logical Methods in Computer Science. Volume 10, Issue 1. 10 indexed citations
10.
Birkedal, Lars & Rasmus Ejlers Møgelberg. (2013). Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes. 213–222. 17 indexed citations
11.
Møgelberg, Rasmus Ejlers, et al.. (2012). Linear-use CPS translations in the Enriched Effect Calculus. Logical Methods in Computer Science. Volume 8, Issue 4. 4 indexed citations
12.
Birkedal, Lars, Rasmus Ejlers Møgelberg, Jan Schwinghammer, & Kristian Støvring. (2012). First steps in synthetic guarded domain theory: step-indexing in the topos of trees. Logical Methods in Computer Science. Volume 8, Issue 4. 34 indexed citations
13.
Birkedal, Lars, Rasmus Ejlers Møgelberg, Jan Schwinghammer, & Kristian Støvring. (2011). First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees. IT University Of Copenhagen (IT University of Copenhagen). 55–64. 37 indexed citations
14.
Møgelberg, Rasmus Ejlers, Lars Birkedal, & Giuseppe Rosolini. (2008). Synthetic domain theory and models of linear Abadi & Plotkin logic. Annals of Pure and Applied Logic. 155(2). 115–133. 1 indexed citations
15.
Møgelberg, Rasmus Ejlers & Alex Simpson. (2007). Relational Parametricity for Control Considered as a Computational Effect. Electronic Notes in Theoretical Computer Science. 173. 295–312. 3 indexed citations
16.
Birkedal, Lars, Rasmus Ejlers Møgelberg, & Rasmus Lerchedahl Petersen. (2007). Domain-theoretical models of parametric polymorphism. Theoretical Computer Science. 388(1-3). 152–172. 6 indexed citations
17.
Birkedal, Lars, Rasmus Ejlers Møgelberg, & Rasmus Lerchedahl Petersen. (2006). Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus. Electronic Notes in Theoretical Computer Science. 155. 191–217. 6 indexed citations
18.
Møgelberg, Rasmus Ejlers, Lars Birkedal, & Giuseppe Rosolini. (2006). Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic. Electronic Notes in Theoretical Computer Science. 155. 219–245.
19.
Birkedal, Lars & Rasmus Ejlers Møgelberg. (2005). Categorical models for Abadi and Plotkin's logic for parametricity. Mathematical Structures in Computer Science. 15(4). 709–772. 18 indexed citations
20.
Møgelberg, Rasmus Ejlers, Lars Birkedal, & Rasmus Lerchedahl Petersen. (2005). Categorical Models of PILL. 7 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026