default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRasmus Ejlers Møgelberg
Person information
- affiliation: IT University of Copenhagen, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Rasmus Ejlers Møgelberg, Maaike Zwart:
What Monads Can and Cannot Do with a Bit of Extra Time. CSL 2024: 39:1-39:18- [i14]Philipp Stassen, Rasmus Ejlers Møgelberg, Maaike Zwart, Alejandro Aguirre, Lars Birkedal:
Modelling Probabilistic FPC in Guarded Type Theory. CoRR abs/2408.04455 (2024) - 2023
- [j18]Patrick Bahr
, Rasmus Ejlers Møgelberg:
Asynchronous Modal FRP. Proc. ACM Program. Lang. 7(ICFP): 476-510 (2023) - [i13]Patrick Bahr, Rasmus Ejlers Møgelberg:
Asynchronous Modal FRP. CoRR abs/2303.03170 (2023) - [i12]Rasmus Ejlers Møgelberg, Maaike Zwart:
What monads can and cannot do with a bit of extra time. CoRR abs/2311.15919 (2023) - 2022
- [c22]Magnus Baunsgaard Kristensen, Rasmus Ejlers Møgelberg, Andrea Vezzosi:
Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks. LICS 2022: 42:1-42:13 - 2021
- [j17]Patrick Bahr, Christian Uldal Graulund, Rasmus Ejlers Møgelberg:
Diamonds are not forever: liveness in reactive programming with guarded recursion. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - [c21]Rasmus Ejlers Møgelberg, Andrea Vezzosi:
Two Guarded Recursive Powerdomains for Applicative Simulation. MFPS 2021: 200-217 - [i11]Magnus Baunsgaard Kristensen, Rasmus Ejlers Møgelberg, Andrea Vezzosi:
A model of Clocked Cubical Type Theory. CoRR abs/2102.01969 (2021) - 2020
- [j16]Bassel Mannaa, Rasmus Ejlers Møgelberg, Niccolò Veltri:
Ticking clocks as dependent right adjoints: Denotational semantics for clocked type theory. Log. Methods Comput. Sci. 16(4) (2020) - [j15]Lars Birkedal, Ranald Clouston, Bassel Mannaa, Rasmus Ejlers Møgelberg, Andrew M. Pitts, Bas Spitters:
Modal dependent type theory and dependent right adjoints. Math. Struct. Comput. Sci. 30(2): 118-138 (2020) - [j14]Ales Bizjak, Rasmus Ejlers Møgelberg:
Denotational semantics for guarded dependent type theory. Math. Struct. Comput. Sci. 30(4): 342-378 (2020) - [c20]Ahmad Salim Al-Sibahi, Thomas P. Jensen, Rasmus Ejlers Møgelberg, Andrzej Wasowski:
Galois Connections for Recursive Types. From Lambda Calculus to Cybersecurity Through Program Analysis 2020: 105-131 - [i10]Patrick Bahr, Christian Uldal Graulund, Rasmus Ejlers Møgelberg:
Diamonds are not forever: Liveness in reactive programming with guarded recursion. CoRR abs/2003.03170 (2020) - [i9]Bassel Mannaa, Rasmus Ejlers Møgelberg, Niccolò Veltri:
Ticking clocks as dependent right adjoints: Denotational semantics for clocked type theory. CoRR abs/2004.01709 (2020)
2010 – 2019
- 2019
- [j13]Rasmus Ejlers Møgelberg, Marco Paviotti:
Denotational semantics of recursive types in synthetic guarded domain theory. Math. Struct. Comput. Sci. 29(3): 465-510 (2019) - [j12]Patrick Bahr, Christian Graulund, Rasmus Ejlers Møgelberg:
Simply RaTT: a fitch-style modal calculus for reactive programming without space leaks. Proc. ACM Program. Lang. 3(ICFP): 109:1-109:27 (2019) - [j11]Rasmus Ejlers Møgelberg, Niccolò Veltri:
Bisimulation as path type for guarded recursive types. Proc. ACM Program. Lang. 3(POPL): 4:1-4:29 (2019) - [i8]Patrick Bahr, Christian Graulund, Rasmus Ejlers Møgelberg:
Simply RaTT: A Fitch-style Modal Calculus for Reactive Programming. CoRR abs/1903.05879 (2019) - 2018
- [c19]Bassel Mannaa, Rasmus Ejlers Møgelberg:
The Clocks They Are Adjunctions Denotational Semantics for Clocked Type Theory. FSCD 2018: 23:1-23:17 - [i7]Ales Bizjak, Rasmus Ejlers Møgelberg:
Denotational semantics for guarded dependent type theory. CoRR abs/1802.03744 (2018) - [i6]Ranald Clouston, Bassel Mannaa, Rasmus Ejlers Møgelberg, Andrew M. Pitts, Bas Spitters:
Modal Dependent Type Theory and Dependent Right Adjoints. CoRR abs/1804.05236 (2018) - [i5]Bassel Mannaa, Rasmus Ejlers Møgelberg:
The clocks they are adjunctions: Denotational semantics for Clocked Type Theory. CoRR abs/1804.06687 (2018) - [i4]Rasmus Ejlers Møgelberg, Marco Paviotti:
Denotational semantics of recursive types in synthetic guarded domain theory. CoRR abs/1805.00289 (2018) - [i3]Rasmus Ejlers Møgelberg, Niccolò Veltri:
Bisimulation as path type for guarded recursive types. CoRR abs/1810.13261 (2018) - 2017
- [c18]Patrick Bahr, Hans Bugge Grathwohl, Rasmus Ejlers Møgelberg:
The clocks are ticking: No more delays! LICS 2017: 1-12 - 2016
- [c17]Ales Bizjak, Hans Bugge Grathwohl, Ranald Clouston, Rasmus Ejlers Møgelberg, Lars Birkedal:
Guarded Dependent Type Theory with Coinductive Types. FoSSaCS 2016: 20-35 - [c16]Rasmus Ejlers Møgelberg, Marco Paviotti:
Denotational semantics of recursive types in synthetic guarded domain theory. LICS 2016: 317-326 - [i2]Ales Bizjak, Hans Bugge Grathwohl, Ranald Clouston, Rasmus Ejlers Møgelberg, Lars Birkedal:
Guarded Dependent Type Theory with Coinductive Types. CoRR abs/1601.01586 (2016) - 2015
- [c15]Ales Bizjak, Rasmus Ejlers Møgelberg:
A Model of Guarded Recursion With Clock Synchronisation. MFPS 2015: 83-101 - [c14]Marco Paviotti, Rasmus Ejlers Møgelberg, Lars Birkedal:
A Model of PCF in Guarded Type Theory. MFPS 2015: 333-349 - 2014
- [j10]Rasmus Ejlers Møgelberg, Sam Staton:
Linear usage of state. Log. Methods Comput. Sci. 10(1) (2014) - [j9]Jeff Egger, Rasmus Ejlers Møgelberg, Alex Simpson:
The enriched effect calculus: syntax and semantics. J. Log. Comput. 24(3): 615-654 (2014) - [c13]Rasmus Ejlers Møgelberg:
A type theory for productive coprogramming via guarded recursion. CSL-LICS 2014: 71:1-71:10 - 2013
- [c12]Lars Birkedal, Rasmus Ejlers Møgelberg:
Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes. LICS 2013: 213-222 - 2012
- [j8]Lars Birkedal, Rasmus Ejlers Møgelberg, Jan Schwinghammer, Kristian Støvring:
First steps in synthetic guarded domain theory: step-indexing in the topos of trees. Log. Methods Comput. Sci. 8(4) (2012) - [j7]Jeff Egger, Rasmus Ejlers Møgelberg, Alex Simpson:
Linear-use CPS translations in the Enriched Effect Calculus. Log. Methods Comput. Sci. 8(4) (2012) - 2011
- [c11]Rasmus Ejlers Møgelberg, Sam Staton:
Linearly-Used State in Models of Call-by-Value. CALCO 2011: 298-313 - [c10]Lars Birkedal, Rasmus Ejlers Møgelberg, Jan Schwinghammer, Kristian Støvring:
First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees. LICS 2011: 55-64 - 2010
- [c9]Jeff Egger, Rasmus Ejlers Møgelberg, Alex Simpson:
Linearly-Used Continuations in the Enriched Effect Calculus. FoSSaCS 2010: 18-32 - [c8]Rasmus Ejlers Møgelberg:
A Nominal Relational Model for Local Store. MFPS 2010: 403-421
2000 – 2009
- 2009
- [j6]Rasmus Ejlers Møgelberg, Alex Simpson:
Relational Parametricity for Computational Effects. Log. Methods Comput. Sci. 5(3) (2009) - [j5]Rasmus Ejlers Møgelberg:
From parametric polymorphism to models of polymorphic FPC. Math. Struct. Comput. Sci. 19(4): 639-686 (2009) - [c7]Jeff Egger, Rasmus Ejlers Møgelberg, Alex Simpson:
Enriching an Effect Calculus with Linear Types. CSL 2009: 240-254 - 2008
- [j4]Rasmus Ejlers Møgelberg, Lars Birkedal, Giuseppe Rosolini:
Synthetic domain theory and models of linear Abadi & Plotkin logic. Ann. Pure Appl. Log. 155(2): 115-133 (2008) - 2007
- [j3]Lars Birkedal, Rasmus Ejlers Møgelberg, Rasmus Lerchedahl Petersen:
Domain-theoretical models of parametric polymorphism. Theor. Comput. Sci. 388(1-3): 152-172 (2007) - [c6]Rasmus Ejlers Møgelberg, Alex Simpson:
Relational Parametricity for Computational Effects. LICS 2007: 346-355 - [c5]Rasmus Ejlers Møgelberg, Alex Simpson:
A Logic for Parametric Polymorphism with Effects. TYPES 2007: 142-156 - [c4]Rasmus Ejlers Møgelberg, Alex Simpson:
Relational Parametricity for Control Considered as a Computational Effect. MFPS 2007: 295-312 - 2006
- [j2]Lars Birkedal, Rasmus Ejlers Møgelberg, Rasmus Lerchedahl Petersen:
Linear Abadi and Plotkin Logic. Log. Methods Comput. Sci. 2(5) (2006) - [c3]Rasmus Ejlers Møgelberg:
Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism. ICALP (2) 2006: 372-383 - [i1]Lars Birkedal, Rasmus Ejlers Møgelberg, Rasmus Lerchedahl Petersen:
Linear Abadi and Plotkin Logic. CoRR abs/cs/0611004 (2006) - 2005
- [j1]Lars Birkedal, Rasmus Ejlers Møgelberg:
Categorical models for Abadi and Plotkin's logic for parametricity. Math. Struct. Comput. Sci. 15(4): 709-772 (2005) - [c2]Lars Birkedal, Rasmus Ejlers Møgelberg, Rasmus Lerchedahl Petersen:
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus. MFPS 2005: 191-217 - [c1]Rasmus Ejlers Møgelberg, Lars Birkedal, Giuseppe Rosolini:
Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic. MFPS 2005: 219-245
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-14 23:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
