Find

For students
For PhDs
For employees

Department of Computer Science

Publications

Contribution to journal

Danvy, O. & Nielsen, L. R. (2001). A First-Order One-Pass CPS Transformation. B R I C S Report Series, RS-01-49.

Danvy, O. & Nielsen, L. R. (2000). A Higher-Order Colon Translation. B R I C S Report Series, (RS-00-33).

Danvy, O. (2002). A Lambda-Revelation of the SECD Machine. B R I C S Report Series, (RS-02-53).

Danvy, O. (2002). A New One-Pass Transformation into Monadic Normal Form. B R I C S Report Series, (RS-02-52).

Danvy, O. (1998). An Extensional Characterization of Lambda-Lifting and Lambda-Dropping. B R I C S Report Series, (RS-98-2).

Danvy, O. (1999). An Extensional Characterization of Lambda-Lifting and Lambda-Dropping. B R I C S Report Series, (RS-99-21).

Danvy, O. & Yang, Z. (1998). An Operational Investigation of the CPS Hierarchy. B R I C S Report Series, (RS-98-35).

Danvy, O. & Millikin, K. (2006). A Rational Deconstruction of Landin's J Operator. B R I C S Report Series, (RS-06-17). http://www.brics.dk/RS/06/17/BRICS-RS-06-17.pdf

Danvy, O. & Millikin, K. (2007). A Rational Deconstruction of Landin's J Operator. Lecture Notes in Computer Science, 4015, 55-73.

Danvy, O. (2003). A Rational Deconstruction of Landin's SECD Machine. B R I C S Report Series, (RS-03-33).

Danvy, O. & Millikin, K. (2008). A Rational Deconstruction of Landin's SECD Machine with the J Operator. Logical Methods in Computer Science, 4(4:12), 1.

Danvy, O. & Millikin, K. (2007). A Simple Application of Lightweight Fusion to Proving the Equivalence of Abstract Machines. B R I C S Report Series, (RS-07-8).

Danvy, O. (1998). A Simple Solution to Type Specialization. B R I C S Report Series, (RS-98-1).

Danvy, O. & Rhiger, M. (2000). A Simple Take on Typed Abstract Syntax in Haskell-Like Languages. B R I C S Report Series, (RS-00-34).

Danvy, O., Grobauer, B. & Rhiger, M. (2001). A Unifying Approach to Goal-Directed Evaluation. New Generation Computing, 20(1), 53-74. https://doi.org/10.1007/BF03037259

Danvy, O., Grobauer, B. & Rhiger, M. (2001). A Unifying Approach to Goal-Directed Evaluation. B R I C S Report Series, (RS-01-29).

Danvy, O. & Lawall, J. (1996). Back to Direct Style II: First-Class Continuations. B R I C S Report Series, (RS-96-20).

Danvy, O. & Rhiger, M. (1998). Compiling Actions by Partial Evaluation, Revisited. B R I C S Report Series, (RS-98-13).

Danvy, O. & Nielsen, L. R. (2004). CPS Transformation of Beta-Redexes. B R I C S Report Series, (RS-04-39).

Danvy, O. & Nielsen, L. (2005). CPS Transformation of Beta-Redexes. Information Processing Letters, 94(5), 217-224. https://doi.org/10.1016/j.ipl.2005.02.002

Danvy, O. & Nielsen, L. R. (2000). CPS Transformation of Beta-Redexes. B R I C S Report Series, (RS-00-35).

Danvy, O. & Nielsen, L. R. (2001). Defunctionalization at Work. B R I C S Report Series, (RS-01-23).

Danvy, O., Malmkjær, K. & Palsberg, J. (1996). Eta-expansion does The Trick. ACM Transactions on Programming Langauges and Systems (TOPLAS), 18(6), 730-751. https://doi.org/10.1145/236114.236119

Danvy, O., Malmkjær, K. & Palsberg, J. (1995). Eta-Expansion Does The Trick. B R I C S Report Series, (RS-95-41).

Danvy, O., Malmkjær, K. & Palsberg, J. (1996). Eta-Expansion Does The Trick. B R I C S Report Series, (RS-96-17).

Danvy, O. (1999). Formalizing Implementation Strategies for First-Class Continuations. B R I C S Report Series, (RS-99-51).

Danvy, O. (1998). Formatting Strings in ML. B R I C S Report Series, (RS-98-5).

Danvy, O. (2005). From Reduction-based to Reduction-free Normalization. Electronic Notes in Theoretical Computer Science, 124(2), 79-100.

Danvy, O. (2004). From Reduction-Based to Reduction-Free Normalization. B R I C S Report Series, (RS-04-30).

Danvy, O. (2000). Functional unparsing. Journal of Functional Programming, 621-625.

Danvy, O. (1998). Functional Unparsing. B R I C S Report Series, (RS-98-12).

Danvy, O. & Rose, K. H. (1997). Higher-Order Rewriting and Partial Evaluation. B R I C S Report Series, (RS-97-46).

Danvy, O. & Johannsen, J. (2010). Inter-deriving Semantic Artifacts for Object-Oriented Programming. Journal of Computer and System Sciences, 76(5), 302-323. https://doi.org/10.1016/j.jcss.2009.10.004

Danvy, O. & Schultz, U. P. (2000). Lambda-dropping: transforming recursive equations into programs with block structure . Theoretical Computer Science, 248(1-2), 243-287. https://doi.org/10.1016/S0304-3975(00)00054-2

Danvy, O. & Schultz, U. P. (1997). Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure. B R I C S Report Series, (RS-97-6).

Danvy, O. & Schultz, U. P. (1998). Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure. B R I C S Report Series, (RS-98-54).

Danvy, O. & Schultz, U. P. (1999). Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure. B R I C S Report Series, (RS-99-27).

Danvy, O. & Schultz, U. P. (2004). Lambda-lifting in Quadratic Time. Journal of Functional and Logic Programming (JFLP), 2004(1).

Danvy, O. & Schultz, U. P. (2002). Lambda-Lifting in Quadratic Time. B R I C S Report Series, (RS-02-30).

Danvy, O. & Schultz, U. P. (2003). Lambda-Lifting in Quadratic Time. B R I C S Report Series, (RS-03-26).

Danvy, O. & Schultz, U. P. (2004). Lambda-Lifting in Quadratic Time. B R I C S Report Series, (RS-04-12).

Danvy, O., Rhiger, M. & Rose, K. H. (2001). Normalization by evaluation with typed abstract syntax. Journal of Functional Programming, 673-680. https://doi.org/10.1017/S0956796801004166

Danvy, O., Rhiger, M. & Rose, K. H. (2001). Normalization by Evaluation with Typed Abstract Syntax. B R I C S Report Series, (RS-01-16).

Danvy, O., Millikin, K., Munk, J. & Zerny, I. (2012). On Inter-deriving Small-step and Big-step Semantics: A Case Study for Storeless Call-by-need Evaluation. Theoretical Computer Science, 435, 21–42. https://doi.org/10.1016/j.tcs.2012.02.023

Danvy, O. (1997). Online Type-Directed Partial Evaluation. B R I C S Report Series, (RS-97-53).

Danvy, O. & Rohde, H. K. (2006). On Obtaining the Boyer-Moore String-Matching Algorithm by Partial Evaluation. Information Processing Letters, 99(4), 158-162.

Danvy, O. & Nielsen, L. R. (2002). On One-Pass CPS Transformations. B R I C S Report Series, (RS-02-3).

Danvy, O. & Millikin, K. (2007). On One-Pass CPS Transformations. Journal of Functional Programming, 17(6), 793-812.

Danvy, O., Dzafic, B. & Pfenning, F. (1999). On proving syntactic properties of CPS programs. B R I C S Report Series, (RS-99-23).

Danvy, O. & Millikin, K. (2008). On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion. Information Processing Letters, 106(3), 100-109.

Displaying results 301 to 350 out of 439

7

Revised 17.04.2023

-

Sofia Hedegaard Rasmussen