Torben Ægidius Mogensen

Nedenstående liste omfatter alle forfatterens publikationer udkommet efter 1991, der er registreret i Københavns Universitets Forsknings og Publikationsdatabase.
Listen er opdateret 25 06 2017.

Det skal bemærkes, at databasen ikke omfatter publikationer fra 1990 eller tidligere. Oversigt over disse må søges i universitetets årbøger.

• Mogensen, T.Æ.:
  Report on an Implementation of a Semi-Inverter.
  DIKU Technical Report 05/07, i: Proceedings of the 1st DIKU-IST Joint Workshop on Foundations of Software. s. 54-62. Robert Glück, Zhenjiang Hu (ed.). Datalogisk Institut, København 2005.
• Mogensen, T.Æ.:
  Semi-Inversion of Guarded Equations.
  Lecture Notes in Computer Science 3676, i: Generative Programming and Component-Engineering 2005 s. 189-204. Robert Glück, Michael Lowry (red.). Springer Verlag, Berlin 2005.
• Mogensen, T.Æ.:
  Linear Types for Cashflow Reengineering.
  Computer Science 2890, i: PSI\ ' 03. Lecture Notes s. 13-21. Manfred Broy, Alexandre Zamulin. Springer, Berlin 2003.
• Mogensen, T.Æ.:
  Roll: A Language for Specifying Die-Rolls.
  Lecture Notes in Computer Science LNCS 2562 i: Pracical Aspects of Declarative Languages s. 15. Veronica Dahl & Philip Wadler. Springer Verlag, 2002.
• Mogensen, T.Æ., Schmidt D., Sydborough H.(red.):
  The Essence of Computation: Complexity, Analysis, Transformation, Essays Dedicated to Niel D. Jones.
  471 s. Springer Verlag, 2002.
• Mogensen, T.Æ.:
  An investigation of compact and efficient number representation in the pure lambda calculus, Lecture Notes in Computer Science, Vol. 2244.
  i: Perspectives of System Informatics s. 205-213. D. Bjørner, M. Broy, A.V. Zamulin (eds.). Springer Verlag, 2001.
• Mogensen, T.Æ.:
  Basics of Compiler Design, Kursusbog for Datalogi 1E, Vol.5, 2. edition.
  217 s. Datalogisk Institut, Københavns Universitet 2000.
• Mogensen, T.Æ.:
  Lienar-Time Self-Interpretation of the Pure Lambda Calculus.
  Higher-Order and Symbolic Computation Vol.13 (3), s. 217-237. 2000.
• Mogensen, T.Æ.:
  Glossary for Partial Evaluation and Related Topics.
  Higher-Order and Symbolic Computation Vol.13 (4), s. 355-368. 2000.
• Mogensen, T.Æ.:
  Linear-time self-interpretation of the pure lambda calculus, Lecture Notes in Computer Science, Vol.1755.
  i: Proceedings of Perspectives of System Informatics s. 128-142. D. Bjørner, M. Broy, A. Zamulin (eds.). Springer-Verlag, 2000.
• Hatcliff J., Mogensen, T.Æ., Thiemann P.:
  Partial Evaluation, Practice and Theory, Lecture Notes in Computer Science, Vol. 1706.
  i: Proceedings of the DIKU 1998 International Summerschool s. 108-154. John Hatcliff, T.Æ. Mogensen, P. Thiemann (eds.). Springer-Verlag, 1999.
• Mogensen, T.Æ.:
  Basics of Compiler Design, Kususbog 6 til Dat1E.
  110 s. Datalogisk Institut, Københavns Universitet 1999.
• Mogensen, T.Æ.:
  Gödelisation in the untyped lambda calculus, BRICS Notes Series, NS-99-1.
  i: Proceedings of the 1999 Workshop on Partial Evaluation and Semantics-Based program Manipulation (PEPM'99) s. 19-24. 1999.
• Mogensen, T.Æ.:
  Basics of Compiler Design, Kursusbog 5 Dat1E.
  100 s. Datalogisk Institut, Københavns Universitet 1999.
• Rehof N.J., Mogensen, T.Æ.:
  Tractable Constraints in Finite Semilattices.
  Science of Computer Programming Vol.35, no.2-3, November, s. 191-221. 1999.
• Mogensen, T.Æ.:
  Partial evaluation Concepts and Applications.
  i: Lecture Notes for the 1998 DIKU International Summer School on Partial Evaluation: Practice and Theory Volume 1: Practice and Experience using Partial Evaluators s. 1-19. DIKU International Summer School 1998. Datalogisk Institut, Københavns Universitet 1998.
• Mogensen, T.Æ.:
  Inherited Limits.
  i: Lecture notes for the 1998 DIKU International Summer School on Practical Evaluation: Practice and Theory, vol.2: Theory, systems and applications s. 1-12. Datalogisk Institut, Københavns Universitet 1998.
• Mogensen, T.Æ.:
  Normalization for a Subset of Scheme using Type Predicates (Summary).
  i: Preliminary Proceedings of the 1998 APPSEM Workshop on Normalization by Evaluation s. 35-36. Olivier Danvy, Peter Dybkjær (eds.). BRICS Notes Series NS-98-1, Aarhus 1998.
• Mogensen, T.Æ.:
  Types for 0, 1 or many uses, Lecture Notes in Computer Science, Vol.1467.
  i: Proceedings of the 1997 workshop on Implementation of Functional Languages (IFL'98) s. 112-122. Chris Clack, Kevin Hammond, Tony Davie (eds.). Springer-Verlag, Berlin, Tyskland 1998.
• Mogensen, T.Æ., Sestoft P.:
  Partial Evaluation.
  i: Encyclopedia of Computer Science and Technology s. 247-279. Allen Kent, James G. Williams (eds.). Marcel Dekker, New York, USA 1997.
• Mogensen, T.Æ.:
  Evolution of Partial Evaluators: Removing Inherited Limits.
  Lecture Notes in Computer Science Vol. nr. 1110, s. 303-321. 1996.
• Mogensen, T.Æ.:
  A Semantics-Based Deteminacy Analysis for Prolog with Cut.
  Lecture Notes in Computer Science Vol. nr. 1181, s. 374-385. 1996.
• Mogensen, T.Æ.:
  Self-Applicable Online Partial Evaluation of the Pure Lambda Calculus.
  i: Proceedings of PEPM '95 s. 39-44. William L. Scherlis (ed). ACM Press, 1995.
• Mogensen, T.Æ.:
  Worm-2dpdas: An extension to 2dpdas that can be simulated in linear time.
  Information Processing Letters , s. . 1994.
• Mogensen, T.Æ.:
  Self-applicable Partial Evaluation for Pure Lambda Calculus.
  i: ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation s. 116-121. 1992.
• Mogensen, T.Æ.:
  Efficient Self-Interpretation in Lambda Calculus.
  Journal of Functional Programming 2(3), s. 345-364. 1992.
• Mogensen, T.Æ., Bondorf A.:
  Logimix: a self-applicable partial evaluator for Prolog.
  i: Proceedings of LOPSTR 92. Workshop in Computing s. 214-227. 1992.