Publications

Danvy, O. & Nielsen, L. R. (2001). A Higher-Order Colon Translation. In H. Kuchen & K. Ueda (Eds.), Functional and Logic Programming: 5th International Symposium, FLOPS 2001 Tokyo, Japan, March 7–9, 2001 Proceedings (pp. 78-91). Springer. https://doi.org/10.1007/3-540-44716-4_5

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. R. (2002). On One-Pass CPS Transformations. B R I C S Report Series, (RS-02-3).

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

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. & Rhiger, M. (2001). A Simple Take on Typed Abstract Syntax in Haskell-like Languages. In H. Kuchen & K. Ueda (Eds.), Functional and Logic Programming: 5th International Symposium, FLOPS 2001 Tokyo, Japan, March 7–9, 2001 Proceedings (pp. 343-358). Springer. https://doi.org/10.1007/3-540-44716-4_22

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. & Sabry, A. (2002). Special issue of Higher-Order and Symbolic Computation: Special Issue on the third ACM SIGPLAN Workshop on Continuations (CW 2001). Springer.

Danvy, O. & Schultz, U. P. (2002). Lambda-Lifting in Quadratic Time. In Z. Hu & M. Rodríguez-Artalejo (Eds.), Functional and Logic Programming: 6th International Symposium, FLOPS 2002 Aizu, Japan, September 15–17, 2002 Proceedings (pp. 134-151). Springer. https://doi.org/10.1007/3-540-45788-7_8

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

Danvy, O. (2006). Interview in popular science program at the Estonian National Radio.

Danvy, O., Henglein, F., Mairson, H. & Pettorossi, A. (Eds.) (2005). Editorial. Higher-Order and Symbolic Computation, 18(1-2), 5-6.

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

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. & Rohde, H. K. (2006). On Obtaining the Boyer-Moore String-Matching Algorithm by Partial Evaluation. Information Processing Letters, 99(4), 158-162.

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

Danvy, O., O'Hearn, P. & Wadler, P. (2007). Preface. Theoretical Computer Science, 375(1-3), 1-2. https://doi.org/10.1016/j.tcs.2006.12.024

Danvy, O. (2006). An Analytical Approach to Program as Data Objects. BRICS Research Series. http://www.daimi.au.dk/~danvy/DSc.html

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., Filinski, A., Giavitto, J-L., Moreau, P-E. & Talcott, C. (2006). Editorial. Higher-Order and Symbolic Computation, 19(1), 343-344.

Danvy, O., de Moor, O., Padget, J. & Thiemann, P. (2006). Editorial. Higher-Order and Symbolic Computation, 19(1), 5-5.

Danvy, O., O'Hearn, P. & Wadler, P. (2007). Festschrift for John C. Reynolds at the Occasion of his 70th Birthday. Pergamon Press.

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. & Spivey, M. (2007). On Barron and Strachey's Cartesian Product Function: Possibly the world's first functional pearl. In R. Hinze & N. Ramsey (Eds.), Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, ICFP 2007 (pp. 41-46). Association for Computing Machinery. https://doi.org/10.1145/1291151.1291161

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

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. (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 One-Pass CPS Transformations. Journal of Functional Programming, 17(6), 793-812.

Danvy, O. (Ed.), O’Hearn, P. & Wadler, P. (2006). Preface, Festschrift for John C. Reynolds's 70th birthday. In Theoretical Computer Science, Volume 375, Issues 1–3, (pp. 1-2). Elsevier.

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

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. & 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. (2008). Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines. In W. Clinger (Ed.), Proceedings of the 2008 ACM SIGPLAN Workshop on Scheme and Functional Programming (pp. 21-36). Association for Computing Machinery.

Danvy, O. (2008). Defunctionalized Interpreters for Programming Languages. A C M / S I G P L A N Notices, (9), 131-142.

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. & Johannsen, J. (2008). Inter-deriving Semantic Artifacts for Object-Oriented Programming. Lecture Notes in Computer Science, 1-16.

Danvy, O., Dybvig, R. K., Lawall, J. & Thiemann, P. (2008). Higher-Order and Symbolic Computation. LISP and Symbolic Computationditorial. Editorial. Higher-Order and Symbolic Computation, 21(3), 237-238.

Danvy, O. & Mason, I. (2008). Higher-Order and Symbolic Computation: Editorial. Higher-Order and Symbolic Computation, 21(4), 359.

Danvy, O., Shan, C. & Zerny, I. S. (2009). J Is for JavaScript: A Direct-Style Correspondence between Algol-Like Languages and JavaScript Using First-Class Continuations. Lecture Notes in Computer Science, 1-19. https://doi.org/10.1007/978-3-642-03034-5_1

Danvy, O., Millikin, K., Munk, J. & Zerny, I. (2010). Defunctionalized Interpreters for Call-by-Need Evaluation. Lecture Notes in Computer Science, 6009, 240-256. https://doi.org/10.1007/978-3-642-12251-4_18

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. & Padget, J. (2009). Editorial. Higher-Order and Symbolic Computation, 22(1), 1-1. https://doi.org/10.1007/s10990-009-9041-0

Danvy, O. & Talcott, C. (2009). Editorial. Higher-Order and Symbolic Computation, 22(2), 113-113. https://doi.org/10.1007/s10990-009-9045-9

Danvy, O. & Talcott, C. (2010). Editorial. Higher-Order and Symbolic Computation, 22(3), 197. https://doi.org/10.1007/s10990-010-9051-y

Danvy, O. & Talcott, C. (2010). Editorial. Higher-Order and Symbolic Computation, 22(4), 293. https://doi.org/10.1007/s10990-010-9052-x

Danvy, O. (2009). Peter J. Landin (1930-2009). In J. Clements (Ed.), Proceedings of the Scheme and Functional Programming Workshop (pp. 126-129). California Polytechnic State University - San Luis Obispo. http://digitalcommons.calpoly.edu/csse_fac/83

Danvy, O. (2009). From Reduction-Based to Reduction-Free Normalization: Lecture notes including 70+ exercises. Lecture Notes in Computer Science, 66-164. https://doi.org/10.1007/978-3-642-04652-0_3

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. & Zerny, I. (2011). Three Syntactic Theories for Combinatory Graph Reduction. Lecture Notes in Computer Science, 6564, 1-20. https://doi.org/10.1007/978-3-642-20551-4_1

Displaying results 201 to 250 out of 439