Publikationer pr. år
Publikationer pr. år
- 10 resultater
Søgeresultater
-
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. 42Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil -
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 adgangFil -
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-217Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
Åben adgang -
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. 4Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil -
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. 109Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil -
2018
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, 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 adgangFil -
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 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 adgangFil -
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
-
2011
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