Publications

Biernacka, M. & Danvy, O. (2009). Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines. Lecture Notes in Computer Science, 5700, 186-206. https://doi.org/10.1007/978-3-642-04164-8_10

Jensen, S. H., Møller, A. & Thiemann, P. (2009). Type Analysis for JavaScript. Lecture Notes in Computer Science, 5673, 238–255. https://doi.org/10.1007/978-3-642-03237-0_17

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., Henglein, F., Mairson, H. & Pettorossi, A. (Eds.) (2008). Automatic Program Development: A Tribute to Robert Paige. Springer.

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

Brabrand, C., Møller, A. & Schwartzbach, M. I. (2008). Dual Syntax for XML Languages. Information Systems, 33(4), 385-406. https://doi.org/10.1016/j.is.2008.01.006

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

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

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.

Møller, A. (2008). Static Analysis for Event-Based XML Processing. In PLAN-X: Programming Language Technologies for XML: An ACM SIGPLAN Workshop colocated with POPL 2008 (pp. 18-27). Universität Trier.

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.

Biernacka, M. & Danvy, O. (2008). Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines. In W. Clinger (Ed.), Proceedings of the 2008 ACM SIGPLAN Workshop on Scheme and Functional Programming (pp. 37-48). Association for Computing Machinery.

Biernacka, M. & Danvy, O. (2007). A Concrete Framework for Environment Machines. A C M Transactions on Computational Logic, 9(1), 1-30.

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. (2007). A Simple Application of Lightweight Fusion to Proving the Equivalence of Abstract Machines. B R I C S Report Series, (RS-07-8).

Biernacka, M. & Danvy, O. (2007). A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines. Theoretical Computer Science, 76-108.

Biernacka, M. & Danvy, O. (2007). A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines. Theoretical Computer Science, 375(1-3), 76-108.

Brabrand, C., Giegerich, R. & Møller, A. (2007). Analyzing Ambiguity of Context-Free Grammars. In Proc. 12th International Conference on Implementation and Application of Automata

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

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

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., 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. & Millikin, K. (2007). Refunctionalization at Work. B R I C S Report Series, (RS-07-7).

Møller, A., Olesen, M. Ø. & Schwartzbach, M. I. (2007). Static Validation of XSL Transformations. A C M Transactions on Programming Languages and Systems, 29(4), Article 21. https://doi.org/10.1145/1255450.1255454

Møller, A. & Schwartzbach, M. I. (2007). XML Graphs in Program Analysis. In G. Ramalingam & E. Visser (Eds.), Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (pp. 1-10). Association for Computing Machinery. https://doi.org/10.1145/1244381.1244383

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

Biernacki, D. & Danvy, O. (2006). A Simple Proof of a Folklore Theorem about Delimited Control. Journal of Functional Programming, 16(3), 269-280.

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

Møller, A. & Schwartzbach, M. I. (2006). An Introduction to XML and Web Technologies. Addison-Wesley.

Brabrand, C., Giegerich, R. & Møller, A. (2006). Analyzing Ambiguity of Context-Free Grammars. B R I C S Report Series, (RS-06-09).

Böttger, H., Møller, A. & Schwartzbach, M. I. (2006). Contracts for Cooperation between Web Service Programmers and HTML Designers. Journal of Web Engineering, 5(1), 65-90.

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.

Ager, M. S., Danvy, O. & Rohde, H. K. (2006). Fast Partial Evaluation of Pattern Matching in Strings. A C M Transactions on Programming Languages and Systems, 28(4), 696-714. https://doi.org/10.1145/1146809.1146812

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

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

Biernacki, D. P., Danvy, O. & Shan, C. (2006). On the Static and Dynamic Extents of Delimited Continuations. Science of Computer Programming, 60(3), 274-297.

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.

Møller, A. (2006). Static Analysis for Event-Based XML Processing. B R I C S Report Series, (RS-06-16).

Kirkegaard, C. & Møller, A. (2006). Static Analysis for Java Servlets and JSP. In K. Yi (Ed.), Static Analysis: 13th International Symposium, SAS 2006, Seoul, Korea, August 29-31, 2006. Proceedings (pp. 336-352). Springer. Lecture Notes in Computer Science Vol. 4134 https://doi.org/10.1007/11823230_22

Kirkegaard, C. & Møller, A. (2006). Type Checking with XML Schema in XACT. Paper presented at PLAN-X 2006: ACM SIGPLAN Workshop on Programming Language Technologies for XML, Charleston, SC, United States.

Biernacki, D., Danvy, O. & Millikin, K. S. (2005). A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations. B R I C S Report Series, (RS-05-16), 1-26.

Ager, M. S., Danvy, O. & Midtgaard, J. (2005). A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational Effects. Theoretical Computer Science, 342(1), 149-172.

Biernacki, D. & Danvy, O. (2005). A Simple Proof of a Folklore Theorem about Delimited Control. B R I C S Report Series, (RS-05-25).

Biernacka, M. & Danvy, O. (2005). A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines. B R I C S Report Series, (RS-05-38).

Biernacka, M., Biernacki, D. & Danvy, O. (2005). An Operational Foundation for Delimited Continuations in the CPS Hierarchy. Logical Methods in Computer Science, 1(2). https://doi.org/10.2168/LMCS-1(2:5)2005

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

Brabrand, C., Møller, A. & Schwartzbach, M. I. (2005). Dual Syntax for XML Languages. In Database Programming Languages: 10th International Workshop, DBPL 2005, Trondheim, Norway, August 28-29, 2005, Revised Selected Papers (pp. 27-41). Springer. Lecture Notes in Computer Science Vol. 3774 https://doi.org/10.1007/11601524_2

Displaying results 101 to 150 out of 323