Find

For students
For PhDs
For employees

Department of Computer Science

Publications

Contribution to journal

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.

Danvy, O. & Millikin, K. (2007). On the Equivalence between Small-Step and Big-Step Abstract Machines: A Simple Application of Lightweight Fusion. B R I C S Report Series, (RS-07-16), i-11.

Danvy, O. & Malmkjær, K. (1996). On the Idempotence of the CPS Transformation. B R I C S Report Series, (RS-96-14).

Danvy, O. & Goldberg, M. (1997). Partial Evaluation of the Euclidian Algorithm. Higher-Order and Symbolic Computation, 10(2), 101-111. https://doi.org/10.1023/A:1007736916360

Danvy, O. & Goldberg, M. (1997). Partial Evaluation of the Euclidian Algorithm. B R I C S Report Series, (RS-97-1).

Danvy, O. (1996). Pragmatic Aspects of Type-Directed Partial Evaluation. B R I C S Report Series, (RS-96-15).

Danvy, O. & Nielsen, L. R. (2004). Refocusing in Reduction Semantics. B R I C S Report Series, (RS-04-26).

Danvy, O. & Millikin, K. (2009). Refunctionalization at Work. Science of Computer Programming, 74(8), 534-549. https://doi.org/10.1016/j.scico.2009.02.001

Danvy, O. & Millikin, K. (2007). Refunctionalization at Work. B R I C S Report Series, (RS-07-7).

Danvy, O., Hentze, N. & Malmkjær, K. (1996). Resource-bounded partial evaluation. A C M Computing Surveys, 28(2), 329-332. https://doi.org/10.1145/234528.234741

Danvy, O. & Vestergaard, R. (1996). Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation. B R I C S Report Series, (RS-96-13).

Danvy, O. (2004). Sur un Exemple de Patrick Greussay. B R I C S Report Series, (RS-04-41).

Danvy, O. & Nielsen, L. R. (2001). Syntactic Theories in Practice. B R I C S Report Series, (RS-01-31).

Danvy, O. & Nielsen, L. R. (2002). Syntactic Theories in Practice. B R I C S Report Series, (RS-02-4).

Danvy, O. & Lopez, P. E. M. (2003). Tagging, Encoding, and Jones Optimality. B R I C S Report Series, (RS-03-2).

Danvy, O., Malmkjær, K. & Palsberg, J. (1995). The essence of eta-expansion in partial evaluation. Higher-Order and Symbolic Computation, 8(3), 209-227. https://doi.org/10.1007/BF01019004

Danvy, O. & Goldberg, M. (2001). There and Back Again. B R I C S Report Series, (RS-01-39).

Danvy, O. & Goldberg, M. (2005). There and Back Again. Fundamenta Informaticae, 66(4), 397-413.

Danvy, O. & Goldberg, M. (2002). There and Back Again. B R I C S Report Series, (RS-02-12).

Danvy, O. & Zerny, I. (2013). Three Syntactic Theories for Combinatory Graph Reduction. A C M Transactions on Computational Logic, 14(4), Article 29. https://doi.org/10.1145/2528932

Danvy, O. (2009). Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines. Lecture Notes in Computer Science, 5700, 162-185. https://doi.org/10.1007/978-3-642-04164-8_9

Danvy, O. (1998). Type-Directed Partial Evaluation. BRICS Lecture Series, (LS-98-3).

Ernst, E., Møller, A., Schwarz, M. & Strocco, F. (2017). Message safety in Dart. Science of Computer Programming, 133/1(1), 51-73. https://doi.org/10.1016/j.scico.2016.06.006

Gansonre, C., Højlund, A., Leminen, A., Bailey, C. & Shtyrov, Y. (2018). Task-free auditory EEG paradigm for probing multiple levels of speech processing in the brain. Psychophysiology, 55(11), Article e13216. https://doi.org/10.1111/psyp.13216

Hansen, N. C., Højlund, A., Møller, C., Pearce, M. & Vuust, P. (2022). Musicians show more integrated neural processing of contextually relevant acoustic features. Frontiers in Neuroscience, 16, Article 907540. https://doi.org/10.3389/fnins.2022.907540

Hansen, J. C., Kjelstrøm, A. H. & Pavlogiannis, A. (2021). Tight bounds for reachability problems on one-counter and pushdown systems. Information Processing Letters, 171, Article 106135. https://doi.org/10.1016/j.ipl.2021.106135

Hatcliff, J. & Danvy, O. (1997). A computational formalization for partial evaluation. Mathematical Structures in Computer Science, 7(5), 507-541. https://doi.org/10.1017/S0960129597002405

Hatcliff, J. & Danvy, O. (1996). A computational formalization for partial evaluation. B R I C S Report Series, RS-96-34.

Hatcliff, J. & Danvy, O. (1997). Thunks and the λ-calculus. Journal of Functional Programming, 7(3), 303-319.

Hatcliff, J. & Danvy, O. (1996). Thunks and the λ-calculus. B R I C S Report Series, (RS-96-19).

Hatcliff, J. & Danvy, O. (1997). Thunks and the λ-calculus. B R I C S Report Series, (RS-97-7).

Displaying results 101 to 150 out of 444

3

Revised 17.04.2023

-

Sofia Hedegaard Rasmussen