
Rasmus Ejlers Møgelberg
Associate Professor
- Programming Logic and Semantics
Research Group
- Computer Science
Department
IT University of Copenhagen
Rued Langgaards Vej 7
DK-2300 Copenhagen S
Denmark
Building: 4C12
Information Desk: 72185000
- 2015
- 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-349Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
- 2016
- 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
- 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
- 2017
- 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
- 2018
- 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
- 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
- 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
- 2019
- 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. 4Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
- 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. 109Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
- 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
ID: 263471