default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTorben Æ. Mogensen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b4]Torben Ægidius Mogensen:
Introduction to Compiler Design, Third Edition. Undergraduate Topics in Computer Science, Springer 2024, ISBN 978-3-031-46459-1, pp. 1-273- [e4]Torben Ægidius Mogensen
, Lukasz Mikulski:
Reversible Computation - 16th International Conference, RC 2024, Toruń, Poland, July 4-5, 2024, Proceedings. Lecture Notes in Computer Science 14680, Springer 2024, ISBN 978-3-031-62075-1 [contents] - 2022
- [b3]Torben Ægidius Mogensen:
Programming Language Design and Implementation. Texts in Computer Science, Springer 2022, ISBN 978-3-031-11805-0, pp. 1-319 - [j11]Torben Ægidius Mogensen:
Hermes: A reversible language for lightweight encryption. Sci. Comput. Program. 215: 102746 (2022) - [c40]Torben Ægidius Mogensen:
Fast Control for Reversible Processors. RC 2022: 51-64 - 2021
- [c39]Torben Ægidius Mogensen:
Reversible Functional Array Programming. RC 2021: 45-63 - [e3]Sam Lindley, Torben Æ. Mogensen:
Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM@POPL 2021, Virtual Event, Denmark, January 18-19, 2021. ACM 2021, ISBN 978-1-4503-8305-9 [contents] - 2020
- [c38]Torben Ægidius Mogensen:
Hermes: A Language for Light-Weight Encryption. RC 2020: 93-110 - [p1]Claudio Antares Mezzina, Rudolf Schlatte, Robert Glück, Tue Haulund, James Hoey, Martin Holm Cservenka, Ivan Lanese, Torben Æ. Mogensen, Harun Siljak, Ulrik Pagh Schultz, Irek Ulidowski:
Software and Reversible Systems: A Survey of Recent Activities. Selected Results of the COST Action IC1405 2020: 41-59
2010 – 2019
- 2019
- [c37]Torben Ægidius Mogensen:
Hermes: A Reversible Language for Writing Encryption Algorithms (Work in Progress). Ershov Informatics Conference 2019: 243-251 - [c36]Torben Ægidius Mogensen:
Reversible In-Place Carry-Lookahead Addition with Few Ancillae. RC 2019: 224-237 - 2018
- [j10]Torben Ægidius Mogensen:
Reversible Garbage Collection for Reversible Functional Languages. New Gener. Comput. 36(3): 203-232 (2018) - [c35]Torben Ægidius Mogensen:
Garbage-Free Reversible Multiplication and Division. RC 2018: 253-268 - [c34]Martin Holm Cservenka, Robert Glück, Tue Haulund, Torben Ægidius Mogensen:
Data Structures and Dynamic Memory Management in Reversible Languages. RC 2018: 269-285 - 2017
- [b2]Torben Ægidius Mogensen:
Introduction to Compiler Design, Second Edition. Undergraduate Topics in Computer Science, Springer 2017, ISBN 978-3-319-66965-6, pp. 1-245 - [c33]Tue Haulund, Torben Ægidius Mogensen, Robert Glück:
Implementing Reversible Object-Oriented Language Features on Reversible Machines. RC 2017: 66-73 - 2015
- [c32]Torben Ægidius Mogensen:
RSSA: A Reversible SSA Form. Ershov Memorial Conference 2015: 203-217 - [c31]Torben Ægidius Mogensen:
Garbage Collection for Reversible Functional Languages. RC 2015: 79-94 - 2014
- [j9]Alexis De Vos, Stéphane Burignat, Robert Glück, Torben Ægidius Mogensen, Holger Bock Axelsen, Michael Kirkedal Thomsen, Eva Rotenberg, Tetsuo Yokoyama:
Designing Garbage-Free Reversible Implementations of the Integer Cosine Transform. ACM J. Emerg. Technol. Comput. Syst. 11(2): 11:1-11:15 (2014) - [j8]Torben Ægidius Mogensen:
Garbage-Free Reversible Multipliers for Arbitrary Constants. ACM J. Emerg. Technol. Comput. Syst. 11(2): 12:1-12:18 (2014) - [c30]Torben Ægidius Mogensen:
Supercompilation for Datatypes. Ershov Memorial Conference 2014: 232-247 - [c29]Torben Ægidius Mogensen:
Reference Counting for Reversible Languages. RC 2014: 82-94 - 2013
- [c28]Torben Æ. Mogensen:
Garbage-Free Reversible Constant Multipliers for Arbitrary Integers. RC 2013: 70-83 - [c27]Torben Æ. Mogensen:
A Comparison of Well-Quasi Orders on Trees. Festschrift for Dave Schmidt 2013: 30-40 - 2011
- [b1]Torben Ægidius Mogensen:
Introduction to Compiler Design. Undergraduate Topics in Computer Science, Springer 2011, ISBN 978-0-85729-828-7, pp. I-XXI, 1-204 - [c26]Torben Æ. Mogensen:
Partial Evaluation of Janus Part 2: Assertions and Procedures. Ershov Memorial Conference 2011: 289-301 - [c25]Torben Æ. Mogensen:
Partial evaluation of the reversible language janus. PEPM 2011: 23-32
2000 – 2009
- 2009
- [c24]Torben Æ. Mogensen:
Planet Map Generation by Tetrahedral Subdivision. Ershov Memorial Conference 2009: 306-318 - [c23]Torben Æ. Mogensen:
Troll, a language for specifying dice-rolls. SAC 2009: 1910-1915 - 2008
- [c22]Torben Æ. Mogensen:
Semi-inversion of functional parameters. PEPM 2008: 21-29 - 2006
- [c21]Torben Æ. Mogensen:
Report on an Implementation of a Semi-inverter. Ershov Memorial Conference 2006: 322-334 - 2005
- [c20]Torben Æ. Mogensen:
Semi-inversion of Guarded Equations. GPCE 2005: 189-204 - 2003
- [c19]Torben Æ. Mogensen:
Linear Types for Cashflow Reengineering. Ershov Memorial Conference 2003: 13-21 - [c18]Torben Æ. Mogensen:
Roll : A Language for Specifying Die-Rolls. PADL 2003: 145-159 - 2002
- [e2]Torben Æ. Mogensen, David A. Schmidt, Ivan Hal Sudborough:
The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday]. Lecture Notes in Computer Science 2566, Springer 2002, ISBN 3-540-00326-6 [contents] - 2001
- [c17]Torben Æ. Mogensen:
An Investigation of Compact and Efficient Number Representations in the Pure Lambda Calculus. Ershov Memorial Conference 2001: 205-213 - 2000
- [j7]Torben Æ. Mogensen:
Linear-Time Self-Interpretation of the Pure Lambda Calculus. High. Order Symb. Comput. 13(3): 217-237 (2000) - [j6]Torben Æ. Mogensen:
Glossary for Partial Evaluation and Related Topics. High. Order Symb. Comput. 13(4): 355-368 (2000)
1990 – 1999
- 1999
- [j5]Jakob Rehof, Torben Æ. Mogensen:
Tractable Constraints in Finite Semilattices. Sci. Comput. Program. 35(2): 191-221 (1999) - [c16]Torben Æ. Mogensen:
Linear Time Self-Interpretation of the Pure Lambda Calculus. Ershov Memorial Conference 1999: 128-142 - [c15]Torben Æ. Mogensen:
Gödelization in the Untyped lambda-Calculus. PEPM 1999: 19-24 - [e1]John Hatcliff, Torben Æ. Mogensen, Peter Thiemann:
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School, Copenhagen, Denmark, June 29 - July 10, 1998. Lecture Notes in Computer Science 1706, Springer 1999, ISBN 3-540-66710-5 [contents] - 1998
- [j4]Torben Æ. Mogensen:
Inherited Limits. ACM Comput. Surv. 30(3es): 5 (1998) - [c14]Torben Æ. Mogensen:
Partial Evaluation: Concepts and Applications. Partial Evaluation 1998: 1-19 - [c13]Torben Æ. Mogensen:
Inherited Limits. Partial Evaluation 1998: 189-202 - 1997
- [c12]Torben Æ. Mogensen:
Types for 0, 1 or Many Uses. Implementation of Functional Languages 1997: 112-122 - 1996
- [c11]Torben Æ. Mogensen:
Evolution of Partial Evaluators: Removing Inherited Limits. Dagstuhl Seminar on Partial Evaluation 1996: 303-321 - [c10]Torben Æ. Mogensen:
A Semantics-Based Determinacy Analysis for Prolog with Cut. Ershov Memorial Conference 1996: 374-385 - [c9]Jakob Rehof, Torben Æ. Mogensen:
Tractable Constraints in Finite Semilattices. SAS 1996: 285-300 - 1995
- [c8]Torben Æ. Mogensen:
Self-applicable Online Partial Evaluation of Pure Lambda Calculus. PEPM 1995: 39-44 - 1994
- [j3]Torben Æ. Mogensen:
WORM-2DPDAs: An Extension to 2DPDAs that can be Simulated in Linear Time. Inf. Process. Lett. 52(1): 15-22 (1994) - 1993
- [c7]Torben Æ. Mogensen:
Constructor Spezialization. PEPM 1993: 22-32 - 1992
- [j2]Torben Æ. Mogensen:
Efficient Self-Interpretations in lambda Calculus. J. Funct. Program. 2(3): 345-363 (1992) - [c6]Torben Æ. Mogensen, Anders Bondorf:
Logimix: A Self-Applicable Partial Evaluator for Prolog. LOPSTR 1992: 214-227 - [c5]Torben Æ. Mogensen:
Self-applicable Partial Evaluation for Pure Lambda Calculus. PEPM 1992: 116-121 - 1990
- [c4]Thomas P. Jensen, Torben Æ. Mogensen:
A Backwards Analysis for Compile-time Garbage Collection. ESOP 1990: 227-239 - [c3]Neil D. Jones, Carsten K. Gomard, Anders Bondorf, Olivier Danvy, Torben Æ. Mogensen:
A Self-Applicable Partial Evaluator for the Lambda Calculus. ICCL 1990: 49-58
1980 – 1989
- 1989
- [c2]Torben Æ. Mogensen:
Separating Binding Times in Language Specifications. FPCA 1989: 14-25 - [c1]Torben Æ. Mogensen:
Binding Time Analysis for Polymorphically Typed Higher Order Languages. TAPSOFT, Vol.2 1989: 298-312 - 1988
- [j1]Torben Æ. Mogensen, Carsten Kehler Holst:
Terminology. New Gener. Comput. 6(2&3): 303-307 (1988)
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-06-05 21:33 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:
