Dreyer, Derek - Max-Planck-Institut für Softwaresysteme

• Saarland University Faculty of Natural Sciences and Technology I
• A Type System for WellFounded Recursion # Derek Dreyer
• Modular Type Classes Derek Dreyer
• Principal Type Schemes for Modular Programs Derek Dreyer and Matthias Blume
• Mixin' Up the ML Module System Derek Dreyer Andreas Rossberg
• Separation Logic in the Presence of Garbage Collection Technical Appendix
• Logical Methods in Computer Science Vol. 7 (2:16) 2011, pp. 137
• A Kripke Logical Relation Between ML and Assembly Chung-Kil Hur Derek Dreyer
• The Impact of Higher-Order State and Control Effects on Local Relational Reasoning
• The Impact of Higher-Order State and Control Effects on Local Relational Reasoning
• F-ing Modules Andreas Rossberg
• A Relational Modal Logic for Higher-Order Stateful ADTs
• Mixin' Up the ML Module System Derek Dreyer Andreas Rossberg
• Mechanizing the Metatheory of a Language With Linear Resources and Context Effects
• A Type System for Recursive Modules Derek Dreyer
• Recursive Type Generativity Derek Dreyer
• A Type System for Higher-Order Modules (Expanded Version)
• Separation Logic in the Presence of Garbage Collection Chung-Kil Hur Derek Dreyer Viktor Vafeiadis
• How to Make Ad Hoc Proof Automation Less Ad Hoc Georges Gonthier
• Two Heuristics for the Euclidean Steiner Tree Derek R. Dreyer Michael L. Overton y
• A Type System for Higher-Order Modules (Expanded Version)
• Derek Dreyer Research Statement MPI-SWS, Germany March 2010
• Logical Step-Indexed Logical Relations Derek Dreyer
• A Relational Modal Logic for Higher-Order Stateful ADTs (Technical Appendix)
• A Type System for Well-Founded Recursion Derek Dreyer
• JFP 17 (4 & 5): 433471, 2007. c 2007 Cambridge University Press doi:10.1017/S0956796807006429 Printed in the United Kingdom
• A Type System for Recursive Modules Derek Dreyer
• ZU064-05-FPR main 29 April 2011 15:27 Under consideration for publication in J. Functional Programming 1
• Practical Type Theory for Recursive Modules Derek Dreyer
• Two Heuristics for the Euclidean Steiner Tree Derek R. Dreyer
• PROOFS AND TYPES JEAN-YVES GIRARD
• A Kripke Logical Relation Between ML and Assembly Technical Appendix
• Non-Parametric Parametricity neis@mpi-sws.org
• Extensional Equivalence and Singleton Types CHRISTOPHER A. STONE
• Department of Computer & Information Science Technical Reports (CIS)
• Separation Logic in the Presence of Garbage Collection
• ZU064-05-FPR main 18 July 2011 18:14 Under consideration for publication in J. Functional Programming 1
• The Marriage of Bisimulations and Kripke Logical Relations Technical Appendix
• The Marriage of Bisimulations and Kripke Logical Relations Chung-Kil Hur Derek Dreyer Georg Neis Viktor Vafeiadis
• The Marriage of Bisimulations and Kripke Logical Relations Chung-Kil Hur Derek Dreyer Georg Neis Viktor Vafeiadis
• Mixin' Up the ML Module System ANDREAS ROSSBERG, Google
• How to Make Ad Hoc Proof Automation Less Ad Hoc
• The Marriage of Bisimulations and Kripke Logical Relations
• The Transitive Composability of Relation Transition Systems Technical Appendix
• The Transitive Composability of Relation Transition Systems Chung-Kil Hur Georg Neis Derek Dreyer Viktor Vafeiadis