Publications

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

Danvy, O., Johannsen, J. & Zerny, I. (2011). A Walk in the Semantic Park. In S-C. Khoo & J. Siek (Eds.), Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation (pp. 1-12). Association for Computing Machinery. https://doi.org/10.1145/1929501.1929503

Danvy, O., Henglein, F., Mairson, H. & Pettorossi, A. (Eds.) (2008). Automatic Program Development: A Tribute to Robert Paige. Springer.

Danvy, O., Glück, R. & Thiemann, P. (1998). 1998 Symposium on Partial Evaluation. A C M Computing Surveys, 30(3). https://doi.org/10.1145/292469.293684

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. (2000). Functional unparsing. Journal of Functional Programming, 621-625.

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., 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. & 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., 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., 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. (Ed.) (1999). Proceedings of the 1999 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation. Association for Computing Machinery.

Danvy, O. & Hatcliff, J. (2000). Partial Evaluation. In A. Ralston, E. Reilly & D. Hemmendinger (Eds.), Encyclopedia of Computer Science (pp. 1370-1371). Macmillan Reference.

Danvy, O., Glück, R. & Thiemann, P. (Eds.) (1996). Partial Evaluation: International Seminar Dagstuhl Castle, Germany, February 12–16, 1996 Selected Papers. Springer. Lecture Notes in Computer Science Vol. 1110 https://doi.org/10.1007/3-540-61580-6

Danvy, O. & Dybjer, P. (Eds.) (1998). Proceedings of the 1998 APPSEM Workshop on Normalization by Evaluation. Department of Computer Science, Aarhus University. BRICS No. NS-98-1

Danvy, O. (Ed.) (1996). Proceedings of the Second ACM SIGPLAN Workshop on Continuations. CW '97. Department of Computer Science, Aarhus University. BRICS No. NS-96-13

Danvy, O. & Filinski, A. (Eds.) (2001). Programs as Data Objects: Second Symposium, PADO2001 Aarhus, Denmark, May 21–23, 2001 Proceedings. Springer. Lecture Notes in Computer Science Vol. 2053 https://doi.org/10.1007/3-540-44978-7

Danvy, O. (1999). Type-Directed Partial Evaluation. In J. Hatcliff, T. Æ. Mogensen & P. Thiemann (Eds.), Partial Evaluation: Practice and Theory DIKU 1998 International Summer School Copenhagen, Denmark, June 29 – July 10, 1998 (pp. 367-411). Springer. https://doi.org/10.1007/3-540-47018-2_16

Danvy, O. (1998). A simple solution to type specialization. In K. G. Larsen, S. Skyum & G. Winskel (Eds.), Automata, Languages and Programming: 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13–17, 1998 Proceedings (pp. 908-917). Springer. https://doi.org/10.1007/BFb0055112

Danvy, O., Rhiger, M. & Grobauer, B. (2001). A Unifying Approach to Goal-Directed Evaluation. In W. Taha (Ed.), Semantics, Applications, and Implementation of Program Generation: Second International Workshop, SAIG 2001 Florence, Italy, September 6, 2001 Proceedings (pp. 108-125). Springer. https://doi.org/10.1007/3-540-44806-3_7

Danvy, O. (1999). An Extensional Characterization of Lambda-Lifting and Lambda-Dropping. In A. Middeldorp & T. Sato (Eds.), Functional and Logic Programming: 4th Fuji International Symposium, FLOPS’99 Tsukuba, Japan, November 11-13, 1999 Proceedings (pp. 241-250). Springer. https://doi.org/10.1007/10705424_16

Danvy, O. & Yang, Z. (1999). An Operational Investigation of the CPS Hierarchy. In S. D. Swierstra (Ed.), Programming Languages and Systems: 8th European Symposium on Programming, ESOP’99 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS’99 Amsterdam, The Netherlands, March 22–28, 1999 Proceedings (pp. 640). Springer. https://doi.org/10.1007/3-540-49099-X_15

Displaying results 151 to 200 out of 444

Revised 17.04.2023

Sofia Hedegaard Rasmussen

Department of Computer Science

Publications

Magnus Madsen

Andreas Pavlogiannis

Publications

Faculty

Magnus Madsen

Andreas Pavlogiannis