The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Olivier Danvy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Charles Consel, Olivier Danvy
    Tutorial Notes on Partial Evaluation. [Citation Graph (2, 0)][DBLP]
    POPL, 1993, pp:493-501 [Conf]
  2. Mads Sig Ager, Olivier Danvy, Mayer Goldberg
    A Symmetric Approach to Compilation and Decompilation. [Citation Graph (0, 0)][DBLP]
    The Essence of Computation, 2002, pp:296-331 [Conf]
  3. Torben Amtoft, Charles Consel, Olivier Danvy, Karoline Malmkjær
    The Abstraction and Instantiation of String-Matching Programs. [Citation Graph (0, 0)][DBLP]
    The Essence of Computation, 2002, pp:332-357 [Conf]
  4. Olivier Danvy
    A New One-Pass Transformation into Monadic Normal Form. [Citation Graph (0, 0)][DBLP]
    CC, 2003, pp:77-89 [Conf]
  5. Olivier Danvy
    Pragmatics of Type-Directed Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Partial Evaluation, 1996, pp:73-94 [Conf]
  6. Charles Consel, Olivier Danvy
    From Interpreting to Compiling Binding Times. [Citation Graph (0, 0)][DBLP]
    ESOP, 1990, pp:88-105 [Conf]
  7. Olivier Danvy
    Formalizing Implementation Strategies for First-Class Continuations. [Citation Graph (0, 0)][DBLP]
    ESOP, 2000, pp:88-103 [Conf]
  8. Olivier Danvy
    Back to Direct Style. [Citation Graph (0, 0)][DBLP]
    ESOP, 1992, pp:130-150 [Conf]
  9. Olivier Danvy, Pablo E. Martínez López
    Tagging, Encoding, and Jones Optimality. [Citation Graph (0, 0)][DBLP]
    ESOP, 2003, pp:335-347 [Conf]
  10. Olivier Danvy, Zhe Yang
    An Operational Investigation of the CPS Hierarchy. [Citation Graph (0, 0)][DBLP]
    ESOP, 1999, pp:224-242 [Conf]
  11. Olivier Danvy
    Online Type-Directed Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    Fuji International Symposium on Functional and Logic Programming, 1998, pp:271-295 [Conf]
  12. Olivier Danvy
    An Extensional Characterization of Lambda-Lifting and Lambda-Dropping. [Citation Graph (0, 0)][DBLP]
    Fuji International Symposium on Functional and Logic Programming, 1999, pp:241-250 [Conf]
  13. Olivier Danvy, Lasse R. Nielsen
    A Higher-Order Colon Translation. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2001, pp:78-91 [Conf]
  14. Olivier Danvy, Morten Rhiger
    A Simple Take on Typed Abstract Syntax in Haskell-like Languages. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2001, pp:343-358 [Conf]
  15. Olivier Danvy, Ulrik Pagh Schultz
    Lambda-Lifting in Quadratic Time. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2002, pp:134-151 [Conf]
  16. Olivier Danvy, Lasse R. Nielsen
    A First-Order One-Pass CPS Transformation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:98-113 [Conf]
  17. Charles Consel, Olivier Danvy
    For a Better Support of Static Data Flow. [Citation Graph (0, 0)][DBLP]
    FPCA, 1991, pp:496-519 [Conf]
  18. Vincent Balat, Olivier Danvy
    Memoization in Type-Directed Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    GPCE, 2002, pp:78-92 [Conf]
  19. Olivier Danvy
    A Journey from Interpreters to Compilers and Virtual Machines. [Citation Graph (0, 0)][DBLP]
    GPCE, 2003, pp:117- [Conf]
  20. Olivier Danvy
    A Simple Solution to Type Specialization. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:908-917 [Conf]
  21. Neil D. Jones, Carsten K. Gomard, Anders Bondorf, Olivier Danvy, Torben Æ. Mogensen
    A Self-Applicable Partial Evaluator for the Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    ICCL, 1990, pp:49-58 [Conf]
  22. Daniel Damian, Olivier Danvy
    Syntactic accidents in program analysis: on the impact of the CPS transformation. [Citation Graph (0, 0)][DBLP]
    ICFP, 2000, pp:209-220 [Conf]
  23. Olivier Danvy, Mayer Goldberg
    There and back again. [Citation Graph (0, 0)][DBLP]
    ICFP, 2002, pp:230-234 [Conf]
  24. Olivier Danvy
    Partial Evaluation for Program Speedups. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:579-580 [Conf]
  25. Olivier Danvy, Kevin Millikin
    A Rational Deconstruction of Landin's J Operator. [Citation Graph (0, 0)][DBLP]
    IFL, 2005, pp:55-73 [Conf]
  26. Olivier Danvy
    A Rational Deconstruction of Landin's SECD Machine. [Citation Graph (0, 0)][DBLP]
    IFL, 2004, pp:52-71 [Conf]
  27. Olivier Danvy, Andrzej Filinski
    Abstracting Control. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1990, pp:151-160 [Conf]
  28. Olivier Danvy, Julia L. Lawall
    Back to Direct Style II: First-Class Continuations. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1992, pp:299-310 [Conf]
  29. Olivier Danvy, Karoline Malmkjær
    Intensions and Extensions in a Reflective Tower. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1988, pp:327-341 [Conf]
  30. Julia L. Lawall, Olivier Danvy
    Continuation-Based Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1994, pp:227-238 [Conf]
  31. Dariusz Biernacki, Olivier Danvy
    From Interpreter to Logic Engine by Defunctionalization. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2003, pp:143-159 [Conf]
  32. Olivier Danvy, John Hatcliff
    On the Transformation between Direct and Continuation Semantics. [Citation Graph (0, 0)][DBLP]
    MFPS, 1993, pp:627-648 [Conf]
  33. Olivier Danvy
    Refunctionalization at Work. [Citation Graph (0, 0)][DBLP]
    MPC, 2006, pp:4- [Conf]
  34. Olivier Danvy, Karoline Malmkjær, Jens Palsberg
    The Essence of Eta-Expansion in Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    PEPM, 1994, pp:11-20 [Conf]
  35. Olivier Danvy, Ulrik Pagh Schultz
    Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure. [Citation Graph (0, 0)][DBLP]
    PEPM, 1997, pp:90-106 [Conf]
  36. Mads Sig Ager, Olivier Danvy, Henning Korsholm Rohde
    On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation. [Citation Graph (0, 0)][DBLP]
    ASIA-PEPM, 2002, pp:32-46 [Conf]
  37. Mads Sig Ager, Olivier Danvy, Henning Korsholm Rohde
    Fast partial evaluation of pattern matching in strings. [Citation Graph (0, 0)][DBLP]
    PEPM, 2003, pp:3-9 [Conf]
  38. Olivier Danvy
    Type-Directed Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    Partial Evaluation, 1998, pp:367-411 [Conf]
  39. Olivier Danvy
    Memory allocation and higher-order functions. [Citation Graph (0, 0)][DBLP]
    PLDI, 1987, pp:241-252 [Conf]
  40. Olivier Danvy, René Vestergaard
    Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    PLILP, 1996, pp:182-197 [Conf]
  41. Olivier Danvy
    Type-Directed Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    POPL, 1996, pp:242-257 [Conf]
  42. Charles Consel, Olivier Danvy
    Static and Dynamic Semantics Processing. [Citation Graph (0, 0)][DBLP]
    POPL, 1991, pp:14-24 [Conf]
  43. John Hatcliff, Olivier Danvy
    A Generic Account of Continuation-Passing Styles. [Citation Graph (0, 0)][DBLP]
    POPL, 1994, pp:458-471 [Conf]
  44. Julia L. Lawall, Olivier Danvy
    Separating Stages in the Continuation-Passing Style Transformation. [Citation Graph (0, 0)][DBLP]
    POPL, 1993, pp:124-136 [Conf]
  45. Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard
    A functional correspondence between evaluators and abstract machines. [Citation Graph (0, 0)][DBLP]
    PPDP, 2003, pp:8-19 [Conf]
  46. Olivier Danvy, Lasse R. Nielsen
    Defunctionalization at Work. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:162-174 [Conf]
  47. Olivier Danvy, Kristoffer Høgsbro Rose
    Higher-Order Rewriting and Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:286-301 [Conf]
  48. Daniel Damian, Olivier Danvy
    Static Transition Compression. [Citation Graph (0, 0)][DBLP]
    SAIG, 2001, pp:92-107 [Conf]
  49. Olivier Danvy, Bernd Grobauer, Morten Rhiger
    A Unifying Approach to Goal-Directed Evaluation. [Citation Graph (0, 0)][DBLP]
    SAIG, 2001, pp:108-125 [Conf]
  50. Olivier Danvy, John Hatcliff
    Thunks (Continued). [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:3-11 [Conf]
  51. Vincent Balat, Olivier Danvy
    Strong Normalization by Type-Directed Partial Evaluation and Run-Time Code Generation. [Citation Graph (0, 0)][DBLP]
    Types in Compilation, 1998, pp:240-252 [Conf]
  52. Olivier Danvy
    Many Happy Returns. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:1- [Conf]
  53. Olivier Danvy, Robert Glück, Peter Thiemann
    1998 Symposium on Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1998, v:30, n:3, pp:285-290 [Journal]
  54. Olivier Danvy, Nevin Hentze, Karoline Malmkjær
    Resource-Bounded Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:2, pp:329-332 [Journal]
  55. Malgorzata Biernacka, Olivier Danvy, Kristian Støvring
    Program Extraction From Proofs of Weak Head Normalization. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:155, n:, pp:169-189 [Journal]
  56. Olivier Danvy
    From Reduction-based to Reduction-free Normalization. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:124, n:2, pp:79-100 [Journal]
  57. Olivier Danvy, Belmina Dzafic, Frank Pfenning
    On proving syntactic properties of CPS programs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:26, n:, pp:- [Journal]
  58. Olivier Danvy, Mayer Goldberg
    There and Back Again. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:66, n:4, pp:397-413 [Journal]
  59. Daniel Damian, Olivier Danvy
    A Simple CPS Transformation of Control-Flow Information. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2002, v:10, n:5, pp:501-515 [Journal]
  60. Mads Sig Ager, Olivier Danvy, Jan Midtgaard
    A functional correspondence between call-by-need evaluators and lazy abstract machines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:5, pp:223-232 [Journal]
  61. Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan
    On the dynamic extent of delimited continuations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:1, pp:7-17 [Journal]
  62. Charles Consel, Olivier Danvy
    Partial Evaluation of Pattern Matching in Strings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:2, pp:79-86 [Journal]
  63. Olivier Danvy
    Semantics-Directed Compilation of Nonlinear Patterns. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:6, pp:315-322 [Journal]
  64. Olivier Danvy, Lasse R. Nielsen
    CPS transformation of beta-redexes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:5, pp:217-224 [Journal]
  65. Olivier Danvy, Henning Korsholm Rohde
    On obtaining the Boyer-Moore string-matching algorithm by partial evaluation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:4, pp:158-162 [Journal]
  66. Olivier Danvy, Ulrik Pagh Schultz
    Lambda-Lifting in Quadratic Time. [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 2004, v:2004, n:, pp:- [Journal]
  67. Daniel Damian, Olivier Danvy
    Syntactic accidents in program analysis: on the impact of the CPS transformation. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:5, pp:867-904 [Journal]
  68. Daniel Damian, Olivier Danvy
    CPS transformation of flow information, Part II: administrative reductions. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:5, pp:925-933 [Journal]
  69. Olivier Danvy
    Functional Unparsing. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1998, v:8, n:6, pp:621-625 [Journal]
  70. Olivier Danvy, Morten Rhiger, Kristoffer Høgsbro Rose
    Normalization by evaluation with typed abstract syntax. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2001, v:11, n:6, pp:673-680 [Journal]
  71. John Hatcliff, Olivier Danvy
    Thunks and the lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1997, v:7, n:3, pp:303-319 [Journal]
  72. Dariusz Biernacki, Olivier Danvy
    Theoretical Pearl: A simple proof of a folklore theorem about delimited control. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2006, v:16, n:3, pp:269-280 [Journal]
  73. David A. Basin, Olivier Danvy, Robert Harper
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2004, v:17, n:3, pp:171-171 [Journal]
  74. Olivier Danvy, Carolyn L. Talcott
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2002, v:15, n:4, pp:271- [Journal]
  75. Olivier Danvy, Carolyn L. Talcott
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 1999, v:12, n:1, pp:5- [Journal]
  76. Olivier Danvy, Carolyn L. Talcott
    Introduction. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 1999, v:12, n:2, pp:123-124 [Journal]
  77. Olivier Danvy, Carolyn L. Talcott
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 1999, v:12, n:4, pp:307-308 [Journal]
  78. Wei-Ngan Chin, Olivier Danvy, Peter Thiemann
    Editorial: Theme Issue on Partial Evaluation and Semantics-Based Program Manipulation. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2004, v:17, n:1-2, pp:5-6 [Journal]
  79. Charles Consel, Olivier Danvy
    Partial Evaluation in Parallel. [Citation Graph (0, 0)][DBLP]
    Lisp and Symbolic Computation, 1992, v:5, n:4, pp:327-342 [Journal]
  80. Olivier Danvy, Mayer Goldberg
    Partial Evaluation of the Euclidian Algorithm. [Citation Graph (0, 0)][DBLP]
    Lisp and Symbolic Computation, 1997, v:10, n:2, pp:101-111 [Journal]
  81. Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi
    Editorial: Special Issue Dedicated to Bob Paige. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2003, v:16, n:1-2, pp:5-6 [Journal]
  82. Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2005, v:18, n:1-2, pp:5-6 [Journal]
  83. Olivier Danvy, Takayasu Ito, Carolyn L. Talcott
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2001, v:14, n:4, pp:307-307 [Journal]
  84. Olivier Danvy, Takayasu Ito, Carolyn L. Talcott
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2002, v:15, n:1, pp:5- [Journal]
  85. Olivier Danvy, Julia L. Lawall
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2001, v:14, n:2-3, pp:99-100 [Journal]
  86. Olivier Danvy, Ian A. Mason
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2004, v:17, n:4, pp:275-275 [Journal]
  87. Olivier Danvy, Karoline Malmkjær, Jens Palsberg
    The Essence of Eta-Expansion in Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    Lisp and Symbolic Computation, 1995, v:8, n:3, pp:209-227 [Journal]
  88. Olivier Danvy, Amr Sabry
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2002, v:15, n:2-3, pp:139-140 [Journal]
  89. Olivier Danvy, Carolyn L. Talcott
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2000, v:13, n:1/2, pp:5-6 [Journal]
  90. Olivier Danvy, Carolyn L. Talcott
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2000, v:13, n:3, pp:159-160 [Journal]
  91. Olivier Danvy, Carolyn L. Talcott
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2000, v:13, n:4, pp:287-288 [Journal]
  92. Olivier Danvy, Carolyn L. Talcott
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2001, v:14, n:1, pp:5- [Journal]
  93. Olivier Danvy, Carolyn L. Talcott
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 1999, v:12, n:3, pp:219- [Journal]
  94. Olivier Danvy, Oege de Moor, Julian A. Padget, Peter Thiemann
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2006, v:19, n:1, pp:5- [Journal]
  95. Olivier Danvy, Andrzej Filinski, Jean-Louis Giavitto, Andy King, Pierre-Etienne Moreau, Carolyn L. Talcott
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2006, v:19, n:4, pp:343-344 [Journal]
  96. Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy
    An Operational Foundation for Delimited Continuations in the CPS Hierarchy. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2005, v:1, n:2, pp:- [Journal]
  97. Olivier Danvy, John Hatcliff
    CPS-Transformation After Strictness Analysis. [Citation Graph (0, 0)][DBLP]
    LOPLAS, 1992, v:1, n:3, pp:195-212 [Journal]
  98. Olivier Danvy, Andrzej Filinski
    Representing Control: A Study of the CPS Transformation. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1992, v:2, n:4, pp:361-391 [Journal]
  99. John Hatcliff, Olivier Danvy
    A Computational Formalization for Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1997, v:7, n:5, pp:507-541 [Journal]
  100. Olivier Danvy, Bernd Grobauer, Morten Rhiger
    A Unifying Approach to Goal-directed Evaluation. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 2001, v:20, n:1, pp:53-74 [Journal]
  101. Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan
    On the static and dynamic extents of delimited continuations. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2006, v:60, n:3, pp:274-297 [Journal]
  102. Anders Bondorf, Olivier Danvy
    Automatic Autoprojection of Recursive Equations with Global Variables and Abstract Data Types. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1991, v:16, n:2, pp:151-195 [Journal]
  103. Olivier Danvy
    Back to Direct Style. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1994, v:22, n:3, pp:183-195 [Journal]
  104. Mads Sig Ager, Olivier Danvy, Jan Midtgaard
    A functional correspondence between monadic evaluators and abstract machines for languages with computational effects. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:342, n:1, pp:149-172 [Journal]
  105. Olivier Danvy, Lasse R. Nielsen
    Syntactic Theories in Practice. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:59, n:4, pp:- [Journal]
  106. Olivier Danvy, Lasse R. Nielsen
    A first-order one-pass CPS transformation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:308, n:1-3, pp:239-257 [Journal]
  107. Olivier Danvy, Ulrik Pagh Schultz
    Lambda-dropping: transforming recursive equations into programs with block structure. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:248, n:1-2, pp:243-287 [Journal]
  108. Olivier Danvy, Peter W. O'Hearn, Philip Wadler
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:375, n:1-3, pp:1-2 [Journal]
  109. Malgorzata Biernacka, Olivier Danvy
    A syntactic correspondence between context-sensitive calculi and abstract machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:375, n:1-3, pp:76-108 [Journal]
  110. Olivier Danvy, Jens Palsberg
    Eta-Expansion Does The Trick. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1996, v:18, n:6, pp:730-751 [Journal]
  111. Mads Sig Ager, Olivier Danvy, Henning Korsholm Rohde
    Fast partial evaluation of pattern matching in strings. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2006, v:28, n:4, pp:696-714 [Journal]
  112. Olivier Danvy, J. Michael Spivey
    On Barron and Strachey's cartesian product function. [Citation Graph (0, 0)][DBLP]
    ICFP, 2007, pp:41-46 [Conf]

  113. From Reduction-Based to Reduction-Free Normalization. [Citation Graph (, )][DBLP]


  114. Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines. [Citation Graph (, )][DBLP]


  115. Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines. [Citation Graph (, )][DBLP]


  116. J Is for JavaScript: A Direct-Style Correspondence between Algol-Like Languages and JavaScript Using First-Class Continuations. [Citation Graph (, )][DBLP]


  117. Defunctionalized Interpreters for Call-by-Need Evaluation. [Citation Graph (, )][DBLP]


  118. Defunctionalized interpreters for programming languages. [Citation Graph (, )][DBLP]


  119. Inter-deriving Semantic Artifacts for Object-Oriented Programming. [Citation Graph (, )][DBLP]


  120. An Operational Foundation for Delimited Continuations in<br><br> the<br><br><br> CPS<br><br> Hierarchy [Citation Graph (, )][DBLP]


  121. A Rational Deconstruction of Landin&#39;s SECD Machine with the J Operator [Citation Graph (, )][DBLP]


Search in 0.037secs, Finished in 0.041secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002