DOCSLIB.ORG

ICFP 2008 Final Program

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
ICFP 2008 Final Program ICFP 2008 Final Program Monday, Sep 22, 2008 Tuesday, Sep 23, 2008 Wednesday, Sep 24, 2008 Invited Talk (Chair: Peter Thiemann) Invited Talk (Chair: James Hook) Invited Talk (Chair: Mitchell Wand) 9:00 Lazy and Speculative Execution in Computer Systems 9:00 Defunctionalized Interpreters for Higher-Order Lan- 9:00 Polymorphism and Page Tables|Systems Program- Butler Lampson; Microsoft Research guages ming From a Functional Programmer's Perspective 10:00 Break Olivier Danvy; University of Aarhus Mark Jones; Portland State University Session 1 (Chair: Martin Sulzmann) 10:00 Break 10:00 Break 10:30 Flux: FunctionaL Updates for XML Session 6 (Chair: Andrew Tolmach) Session 11 (Chair: Fritz Henglein) James Cheney; University of Edinburgh 10:30 Parametric Higher-Order Abstract Syntax for Mecha- 10:30 Pattern Minimization Problems over Recursive Data 10:55 Typed Iterators for XML nized Semantics Types 1 2 Giuseppe Castagna , Kim Nguyen ; 1PPS (CNRS) - Universit´e Adam Chlipala; Harvard University Alexander Krauss; TU M¨unchen Paris 7 - Paris, France, 2LRI - Universit´eParis-Sud 11 - Orsay, France 10:55 Typed Closure Conversion Preserves Observational 10:55 Deciding kCFA is complete for EXPTIME 11:20 Break Equivalence David Van Horn, Harry Mairson; Brandeis University Toyota Technological Institute at Session 2 (Chair: Matthew Fluet) Amal Ahmed, Matthias Blume; 11:20 Break 11:50 Aura: A Programming Language for Authorization Chicago Session 12 (Chair: Derek Dreyer) and Audit 11:20 Break 11:50 HMF: Simple Type Inference for First-Class Polymor- Limin Jia, Jeffrey Vaughan, Karl Mazurak, Jianzhou Zhao, Session 7 (Chair: Manuel Chakravarty) phism Microsoft Research Luke Zarko, Joseph Schorr, Steve Zdancewic; U Pennsylvania 11:50 Write it Recursively: A Generic Framework for Opti- Daan Leijen; 12:15 The Power of Pi mal Path Queries 12:15 FPH: First-class Polymorphism for Haskell 1 1 Nicolas Oury, Wouter Swierstra; University of Nottingham Akimasa Morihata, Kiminori Matsuzaki, Masato Takeichi; Dimitrios Vytiniotis , Stephanie Weirich , Simon Peyton 2 12:40 Lunch break University of Tokyo Jones ; 1University of Pennsylvania, 2Microsoft Research 12:15 Efficient Nondestructive Equality Checking for Trees 12:40 Lunch break Session 3 (Chair: Ralf Hinze) and Graphs 14:00 Type Checking with Open Type Functions Session 13 (Chair: Chung-chieh Shan) Michael D. Adams, R. Kent Dybvig; Indiana University 14:00 Mixin' Up the ML Module System Tom Schrijvers1, Simon Peyton Jones2, Manuel 3 4 12:40 Lunch break Derek Dreyer, Andreas Rossberg; MPI-SWS Chakravarty , Martin Sulzmann ; 1K.U.Leuven, 2Microsoft Session 8 (Chair: Zhenjiang Hu) 14:25 Compiling Self-Adjusting Programs with Continua- Research Cambridge, 3UNSW, Sydney, 4ITU, Denmark 14:00 Functional Pearl: Streams and Unique Fixed Points tions 14:25 Graphic Type Constraints and Efficient Type Infer- Ralf Hinze; University of Oxford 1 2 2 1 ence: from ML to MLF Ruy Ley-Wild , Matthew Fluet , Umut Acar ; Carnegie Mel- 14:25 Data-Flow Testing of Declarative Programs lon University, 2Toyota Technological Institute at Chicago Boris Yakobowski, Didier Remy; INRIA 1 2 Sebastian Fischer , Herbert Kuchen ; 1U Kiel, 2U M¨unster 14:50 Break 14:50 Break 14:50 Break Session 14 (Chair: Henrik Nilsson) Session 4 (Chair: Tim Sheard) Session 9 (Chair: Andrew Kennedy) 15:20 Flask: Staged Functional Programming for Sensor 15:20 A Type-Preserving Compiler in Haskell 15:20 Functional Translation of a Calculus of Capabilities Networks Louis-Julien Guillemette, Stefan Monnier; U Montr´eal Arthur Chargu´eraud, Fran¸coisPottier; INRIA Geoffrey Mainland, Greg Morrisett, Matt Welsh; Harvard 15:45 Experience Report: Playing the DSL Card, A Domain 15:45 Experience Report: Paradise: A Two-Stage DSL Em- Specific Language for Component Configuration University bedded in Haskell 15:45 Experience Report: A Pure Shirt Fits Reflections on Mark Jones; Portland State University Lennart Augustsson, Howard Mansell, Ganesh Sittam- Haskell at Bluespec 16:05 Generic Discrimination|Sorting and Partitioning Un- palam; Credit Suisse Ravi Nanavati; Bluespec, Inc. shared Data in Linear Time 16:05 Ynot: Reasoning with the Awkward Squad 16:05 Functional Netlists Fritz Henglein; DIKU, University of Copenhagen 1 2 2 Aleksandar Nanevski , Greg Morrisett , Avi Shinnar , Paul Sungwoo Park, Jinha Kim, Hyeonseung Im; Pohang University 16:30 Break 2 3 Govereau , Lars Birkedal ; 1Microsoft Research, Cambridge, of Science and Technology Session 5 (Chair: Norman Ramsey) 2Harvard University, 3IT University, Copenhagen 16:30 Break 17:00 Transactional Events for ML 16:30 Break Session 15 (Chair: Kathleen Fisher) Laura Effinger-Dean, Matthew Kehrt, Dan Grossman; Uni- Session 10 (Chair: Michael Sperber) 17:00 NixOS: A Purely Functional Linux Distribution versity of Washington 1 2 17:00 A Scheduling Framework for General-Purpose Parallel Eelco Dolstra , Andres L¨oh ; 1Delft University of Technology, 17:25 Experience Report: Erlang in Acoustic Ray Tracing 2 1 1 Languages Utrecht University Christian Convey , Andrew Fredricks , Christopher 1 2 2 1 1 1 2 Matthew Fluet , Michael Rainey , John Reppy ; Toyota 17:25 Experience Report: Visualizing Data through Func- Gagner , Douglas Maxwell , Lutz Hamel ; 1Naval Undersea Technological Institute at Chicago, 2University of Chicago tional Pipelines 2 Warfare Centers, RI, USA, Dept. of Computer Science and Statistics, 17:25 Space Profiling for Parallel Functional Programs David Duke1, Rita Borgo1, Colin Runciman2, Malcolm U Rhode Island 1 1 1 2 Daniel Spoonhower , Guy E. Blelloch , Robert Harper , Wallace ; 1University of Leeds, UK, 2University of York, UK 17:45 Implicitly-threaded parallelism in Manticore 2 Phillip B. Gibbons ; 1Carnegie Mellon University, 2Intel Reseach 17:45 Quotient Lenses Matthew Fluet1, Mike Rainey2, John Reppy2, Adam Shaw2; Pittsburgh 1 2 1 2 J. Nathan Foster , Alexandre Pilkiewicz , Benjamin C. Toyota Technological Institute at Chicago, University of Chicago 1 17:50 Short Break Pierce ; 1University of Pennsylvania, 2Ecole Polytechnique 18:10 PC chair's report Awards and Announcements (Chair: Kevin Millikin) 18:10 Closing 18:00 ICFP 2009 Announcement (Phil Wadler) 18:10 Most Influential ICFP'98 Paper Award (Kathleen Fisher) 18:20 Report on the Eleventh ICFP Programming Contest Tim Sheard1, Tim Chevalier1, Chuan-kai Lin1, Garrett Morris1, Emerson Murphy-Hill1, Andy Gill1, John Reppy2, Lars Bergstrom2, Mike Rainey2, Adam Shaw2, Virgil 2 Gheorghiu ; 1Portland State University, 2University of Chicago 19:00 Reception.
Load more

Recommended publications
  • Functional Programming at Facebook
    Functional Programming at Facebook Chris Piro, Eugene Letuchy Commercial Users of Functional Programming (CUFP) Edinburgh, Scotland ! September "##$ Agenda ! Facebook and Chat " Chat architecture # Erlang strengths $ Setbacks % What has worked Facebook The Facebook Environment The Facebook Environment ▪ The web site ▪ More than 250 million active users ▪ More than 3.5 billion minutes are spent on Facebook each day The Facebook Environment ▪ The web site ▪ More than 250 million active users ▪ More than 3.5 billion minutes are spent on Facebook each day ▪ The engineering team ▪ Fast iteration: code gets out to production within a week ▪ Polyglot programming: interoperability with Thrift ▪ Practical: high-leverage tools win Using FP at Facebook Using FP at Facebook ▪ Erlang ▪ Chat backend (channel servers) ▪ Chat Jabber interface (ejabberd) ▪ AIM presence: a JSONP validator Using FP at Facebook ▪ Erlang ▪ Chat backend (channel servers) ▪ Chat Jabber interface (ejabberd) ▪ AIM presence: a JSONP validator ▪ Haskell ▪ lex-pass: PHP parse transforms ▪ Lambdabot ▪ textbook: command line Facebook API client ▪ Thrift binding Thrift Thrift ▪ An efficient, cross-language serialization and RPC framework Thrift ▪ An efficient, cross-language serialization and RPC framework ▪ Write interoperable servers and clients Thrift ▪ An efficient, cross-language serialization and RPC framework ▪ Write interoperable servers and clients ▪ Includes library and code generator for each language Thrift ▪ An efficient, cross-language serialization and RPC framework ▪ Write
    [Show full text]
  • The Third Annual ICFP Programming Contest
    The Third Annual ICFP Programming Contest August 26 – 29, 2000 (Version 1.18) 1 The problem This year’s ICFP programming challenge is to implement a ray tracer. The input to the ray tracer is a scene description written in a simple functional language, called GML. Execution of a GML program produces zero, or more, image files, which are in PPM format. A web page of sample images, along with the GML inputs that were used to produce them, is linked off of the contest home page. The feature set of GML is organized into three tiers. Submissions must implement the first tier of features and extra credit will be given to submissions that implement the second or third tiers. Submissions will be evaluated on three scales: correctness of the produced images, run-time performance, and the tier of implemented GML features. GML has primitives for defining simple geometric objects (e.g., planes, spheres, and cubes) and lighting sources. The surface properties used to render the objects are specified as functions in GML itself. In addition to supporting scene description, GML also has a render operator that renders a scene to an image file. For each pixel in the output image, the render command must compute a color. Conceptually, this color is computed by tracing the path of the light backwards from the eye of the viewer, to where it bounced off an object, and ultimately back to the light sources. This document is organized as follows. Section 2 describes the syntax and general semantics of the modeling language. It is followed by Section 3, which describes those aspects of the language that are specific to ray tracing.
    [Show full text]
  • ICFP Programming Contest 2010 International Cars and Fuels Production
    About Contest Task Running the Contest Background Winners Future ICFP Programming Contest 2010 International Cars and Fuels Production Bertram Felgenhauer, University of Innsbruck, Austria Johannes Waldmann, HTWK Leipzig, Germany June 18–21, 2010 Felgenhauer, Waldmann ICFP Programming Contest 2010 1/31 About Contest Task Running the Contest Background Winners Future About the ICFP Programming Contest programming, problem solving, fun annual contest, since 1998 sponsored by ICFP conference/ACM 2010 contest hosted by HTWK Leipzig, Germany contest format 72 hours (June 18, 12:00 – June 21, 12:00 GMT) participation online, international teams allowed no fixed programming language lightning division (first 24 hours) Felgenhauer, Waldmann ICFP Programming Contest 2010 2/31 earn money by (efficiently) solving instances, or creating instances (with solution, which is hard to find) income tax (devaluates earnings by 1/2 per day) About Contest Task Running the Contest Background Winners Future Contest Task storyline: market for cars (= problem instance) (public) fuels (= problem solution) (private) Felgenhauer, Waldmann ICFP Programming Contest 2010 3/31 About Contest Task Running the Contest Background Winners Future Contest Task storyline: market for cars (= problem instance) (public) fuels (= problem solution) (private) earn money by (efficiently) solving instances, or creating instances (with solution, which is hard to find) income tax (devaluates earnings by 1/2 per day) Felgenhauer, Waldmann ICFP Programming Contest 2010 3/31 About Contest Task
    [Show full text]
  • ICFP 2009 Final Program
    ICFP 2009 Final Program Monday, August 31, 2009 Tuesday, September 1, 2009 Wednesday, September 2, 2009 Invited Talk (Chair: Andrew Tolmach) Invited Talk (Chair: Graham Hutton) Invited Talk (Chair: Lennart Augustsson) 9:00 Organizing Functional Code for Parallel Execution; or, 9:00 Lambda, the Ultimate TA: Using a Proof Assistant to 9:00 Commutative Monads, Diagrams and Knots foldl and foldr Considered Slightly Harmful Teach Programming Language Foundations Dan Piponi; Industrial Light & Magic Guy L. Steele, Jr.; Sun Microsystems Benjamin C. Pierce; University of Pennsylvania 10:00 Break 10:00 Break 10:00 Break Session 11 (Chair: Ralf Hinze) Session 1 (Chair: Shin-Cheng Mu) Session 6 (Chair: Xavier Leroy) 10:25 Generic Programming with Fixed Points for Mutually 10:25 Functional Pearl: La Tour D’Hano¨ı 10:25 A Universe of Binding and Computation Recursive Datatypes Ralf Hinze; University of Oxford Daniel Licata and Robert Harper; Carnegie Mellon University Alexey Rodriguez Yakushev1, Stefan Holdermans2, Andres 2 3 10:50 Purely Functional Lazy Non-deterministic Program- 10:50 Non-Parametric Parametricity L¨oh , Johan Jeuring ; 1Vector Fabrics B.V., 2Utrecht University, ming Georg Neis, Derek Dreyer, Andreas Rossberg; MPI-SWS 3Utrecht University, Open University of the Netherlands Sebastian Fischer1, Oleg Kiselyov2, Chung-chieh Shan3; 11:15 Break 10:50 Attribute Grammars Fly First-Class: How to do As- 1Christian-Albrechts University, 2FNMOC, 3Rutgers University Session 7 (Chair: Robby Findler) pect Oriented Programming in Haskell 11:15 Break
    [Show full text]
  • Stephanie Weirich –
    Stephanie Weirich School of Engineering and Science, University of Pennsylvania Levine 510, 3330 Walnut St, Philadelphia, PA 19104 215-573-2821 • [email protected] July 13, 2021 Positions University of Pennsylvania Philadelphia, Pennsylvania ENIAC President’s Distinguished Professor September 2019-present Galois, Inc Portland, Oregon Visiting Scientist June 2018-August 2019 University of Pennsylvania Philadelphia, Pennsylvania Professor July 2015-August 2019 University of Pennsylvania Philadelphia, Pennsylvania Associate Professor July 2008-June 2015 University of Cambridge Cambridge, UK Visitor August 2009-July 2010 Microsoft Research Cambridge, UK Visiting Researcher September-November 2009 University of Pennsylvania Philadelphia, Pennsylvania Assistant Professor July 2002-July 2008 Cornell University Ithaca, New York Instructor, Research Assistant and Teaching AssistantAugust 1996-July 2002 Lucent Technologies Murray Hill, New Jersey Intern June-July 1999 Education Cornell University Ithaca, NY Ph.D., Computer Science 2002 Cornell University Ithaca, NY M.S., Computer Science 2000 Rice University Houston, TX B.A., Computer Science, magnum cum laude 1996 Honors ○␣ SIGPLAN Robin Milner Young Researcher award, 2016 ○␣ Most Influential ICFP 2006 Paper, awarded in 2016 ○␣ Microsoft Outstanding Collaborator, 2016 ○␣ Penn Engineering Fellow, University of Pennsylvania, 2014 ○␣ Institute for Defense Analyses Computer Science Study Panel, 2007 ○␣ National Science Foundation CAREER Award, 2003 ○␣ Intel Graduate Student Fellowship, 2000–2001
    [Show full text]
  • An E Cient and General Implementation of Futures on Large
    An Ecient and General Implementation of Futures on Large Scale SharedMemory Multipro cessors A Dissertation Presented to The Faculty of the Graduate School of Arts and Sciences Brandeis University Department of Computer Science James S Miller advisor In Partial Fulllment of the Requirements of the Degree of Doctor of Philosophy by Marc Feeley April This dissertation directed and approved by the candidates committee has b een ac cepted and approved by the Graduate Faculty of Brandeis University in partial fulll ment of the requirements for the degree of DOCTOR OF PHILOSOPHY Dean Graduate School of Arts and Sciences Dissertation Committee Dr James S Miller chair Digital Equipment Corp oration Prof Harry Mairson Prof Timothy Hickey Prof David Waltz Dr Rob ert H Halstead Jr Digital Equipment Corp oration Copyright by Marc Feeley Abstract An Ecient and General Implementation of Futures on Large Scale SharedMemory Multipro cessors A dissertation presented to the Faculty of the Graduate School of Arts and Sciences of Brandeis University Waltham Massachusetts by Marc Feeley This thesis describ es a highp erformance implementation technique for Multilisps future parallelism construct This metho d addresses the nonuniform memory access NUMA problem inherent in large scale sharedmemory multiprocessors The technique is based on lazy task creation LTC a dynamic task partitioning mechanism that dramatically reduces the cost of task creation and consequently makes it p ossible to exploit ne grain parallelism In LTC idle pro cessors get work to do
    [Show full text]
  • Stephanie Weirich –
    Stephanie Weirich School of Engineering and Science, University of Pennsylvania Levine 510, 3330 Walnut St, Philadelphia, PA 19104 215-573-2821 • [email protected] • June 21, 2014 Education Cornell University Ithaca, NY Ph.D., Computer Science August 2002 Cornell University Ithaca, NY M.S., Computer Science August 2000 Rice University Houston, TX B.A., Computer Science May 1996 magnum cum laude Positions Held University of Pennsylvania Philadelphia, Pennsylvania Associate Professor July 2008-present University of Cambridge Cambridge, UK Visitor August 2009-July 2010 Microsoft Research Cambridge, UK Visiting Researcher September-November 2009 University of Pennsylvania Philadelphia, Pennsylvania Assistant Professor July 2002-July 2008 Cornell University Ithaca, New York Instructor, Research Assistant and Teaching Assistant August 1996-July 2002 Lucent Technologies Murray Hill, New Jersey Intern June-July 1999 Research Interests Programming languages, Type systems, Functional programming, Generic programming, De- pendent types, Program verification, Proof assistants Honors Penn Engineering Fellow, University of Pennsylvania, 2014. Institute for Defense Analyses Computer Science Study Panel, 2007. National Science Foundation CAREER Award, 2003. Intel Graduate Student Fellowship, 2000–2001. National Science Foundation Graduate Research Fellowship, 1996–1999. CRA-W Distributed Mentorship Project Award, 1996. Microsoft Technical Scholar, 1995–1996. Technical Society Membership Association for Computing Machinery, 1998-present ACM SIGPLAN, 1998-present ACM SIGLOG, 2014-present IFIP Working Group 2.8 (Functional Programming), 2003-present IFIP Working Group 2.11 (Program Generation), 2007-2012 Teaching Experience CIS 120 - Programming Languages and Techniques I CIS 552 - Advanced Programming CIS 670/700 - Advanced topics in Programming Languages CIS 500 - Software Foundations CIS 341 - Programming Languages Students Dissertation supervision...................................................................................
    [Show full text]
  • The Complexity of Flow Analysis in Higher-Order Languages
    The Complexity of Flow Analysis in Higher-Order Languages David Van Horn arXiv:1311.4733v1 [cs.PL] 19 Nov 2013 The Complexity of Flow Analysis in Higher-Order Languages A Dissertation Presented to The Faculty of the Graduate School of Arts and Sciences Brandeis University Mitchom School of Computer Science In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy by David Van Horn August, 2009 This dissertation, directed and approved by David Van Horn’s committee, has been accepted and approved by the Graduate Faculty of Brandeis University in partial fulfillment of the requirements for the degree of: DOCTOR OF PHILOSOPHY Adam B. Jaffe, Dean of Arts and Sciences Dissertation Committee: Harry G. Mairson, Brandeis University, Chair Olivier Danvy, University of Aarhus Timothy J. Hickey, Brandeis University Olin Shivers, Northeastern University c David Van Horn, 2009 Licensed under the Academic Free License version 3.0. in memory of William Gordon Mercer July 22, 1927–October 8, 2007 Acknowledgments Harry taught me so much, not the least of which was a compelling kind of science. It is fairly obvious that I am not uninfluenced by Olivier Danvy and Olin Shivers and that I do not regret their influence upon me. My family provided their own weird kind of emotional support and humor. I gratefully acknowledge the support of the following people, groups, and institu- tions, in no particular order: Matthew Goldfield. Jan Midtgaard. Fritz Henglein. Matthew Might. Ugo Dal Lago. Chung-chieh Shan. Kazushige Terui. Christian Skalka. Shriram Krishnamurthi. Michael Sperber. David McAllester. Mitchell Wand. Damien Sereni. Jean-Jacques Levy.´ Julia Lawall.
    [Show full text]
  • Fundamentals of Type Inference Systems
    Fundamentals of type inference systems Fritz Henglein DIKU, University of Copenhagen [email protected] February 1, 1991; revised January 31, 1994; updated August 9, 2009 1 Introduction These notes give a compact overview of established core type systems and of their fundamental properties. We emphasize the use and application of type systems in programming languages, but also mention their role in logic. Proofs are omitted, but references to relevant sources in the literature are usually given. 1.1 What is a \type"? There are many examples of types in programming languages: • Primitive types: int, float, bool • Compound types: products (records), sums (disjoint unions), lists, arrays • Recursively definable types, such as tree data types • Function types, e.g. int !int • Parametric polymorphic types • Abstract types, e.g. Java interfaces Loosely speaking a type is a description of a collection of related values. • A type has syntax (\description"): It denotes a collection. • A type has elements (\collection"): It makes sense to talk about ele- ments of a type; in particular, it may have zero, one or many elements 1 • A type's elements have common properties (\related"): Users of a type can rely on each element having some common properties|an interface| without having to know the identity of particular elements. Types incorporate multiple aspects: • Type as a set of values: This view focuses on how values are con- structed to be elements of a type; e.g. constructing the natural num- bers from 0 and the successor function; • Type as a an interface: This view focuses on how values can be used (\deconstructed") by a client; e.g.
    [Show full text]
  • On the Resolution Semiring
    Aix-Marseille Université École doctorale 184 UFR sciences Institut de Mathématiques de Marseille Thèse présentée pour obtenir le grade universitaire de docteur Spécialité: Mathématiques On the Resolution Semiring Marc Bagnol Jury: Pierre-Louis Curien Université Paris Diderot Jean-Yves Girard Aix-Marseille Université (directeur) Ugo dal Lago Università di Bologna (rapporteur) Paul-André Melliès Université Paris Diderot Myriam Quatrini Aix-Marseille Université Ulrich Schöpp LMU München Philip Scott University of Ottawa (rapporteur) Kazushige Terui Kyoto University Soutenue le 4/12/2014 à Marseille. This thesis is licensed under a Attribution-NonCommercial-ShareAlike 4.0 International licence. Résumé On étudie dans cette thèse une structure de semi-anneau dont le produit est basé sur la règle de résolution de la programmation logique. Cet objet mathématique a été initialement introduit dans le but de modéliser la procédure d’élimination des coupures de la logique linéaire, dans le cadre du programme de géométrie de l’interaction. Il fournit un cadre algébrique et abstrait, tout en étant présenté sous une forme syntaxique et concrète, dans lequel mener une étude théorique du calcul. On reviendra dans un premier temps sur l’interprétation interactive de la théorie de la démonstration dans ce semi-anneau, via l’axiomatisation catégorique de l’approche de la géométrie de l’interaction. Cette interprétation établit une traduction des programmes fonctionnels vers une forme très simple de programmes logiques. Dans un deuxième temps, on abordera des problématiques de théorie de la complexité: bien que le problème de la nilpotence dans le semi-anneau étudié soit indécidable en général, on fera apparaître des restrictions qui permettent de caractériser le calcul en espace logarithmique (déterministe et non-déterministe) et en temps polynomial (déterministe).
    [Show full text]
  • Daniel R. Licata
    Daniel R. Licata Personal E-mail: [email protected] Information: Web: http://www.cs.cmu.edu/~drl/ Home Address: 79 Merit Ln. Princeton, NJ 08540 Mobile Phone: +1 (412) 889-0106 Academic Institute for Advanced Study 2012-2013 Background: Member. Post-doc for a year-long special program on Homotopy Type Theory. Carnegie Mellon University 2011-2012 Teaching Post-doctoral Fellow. Designed and delivered a new intro. course, Principles of Functional Programming. Carnegie Mellon University 2004 to 2011 PhD in Computer Science. Advised by Robert Harper. Brown University 2000 to 2004 Bachelor of Science in Mathematics and Computer Science. Awards & FoLLI E.W. Beth Dissertation Award, 2012 Winner Fellowships: CMU SCS Dissertation Award, Honorable Mention, 2011 Pradeep Sindhu Computer Science Fellowship, Carnegie Mellon University, 2009-2010. Finalist for Computing Research Association Outstanding Undergraduate Award, 2004. Funding Cowrote NSF Grant CCF-1116703: Foundations and Applications of Higher-Dimensional Type Theory, which funded part of my post-doc. Cowrote NSF Grant CCF-0702381: Integrating Types and Verification, which funded part of my dissertation work. Publications: Dissertation Dependently Typed Programming with Domain-Specific Logics. February, 2011. Committee: Robert Harper, Frank Pfenning, Karl Crary, Greg Morrisett Journal Articles Robert Harper and Daniel R. Licata. Mechanizing Metatheory in a Logical Framework. Journal of Functional Programming. 17(4-5), pp 613-673, July 2007. Conference Papers Calculating the Fundamental Group of the Circle in Homotopy Type Theory. Daniel R. Licata and Michael Shulman. IEEE Symposium on Logic in Computer Science (LICS), June, 2013. Canonicity for 2-Dimensional Type Theory. Daniel R. Licata and Robert Harper.
    [Show full text]
  • Metatheorems About Convertibility in Typed Lambda Calculi
    Metatheorems about Convertibility in Typed Lambda Calculi: Applications to CPS transform and "Free Theorems" by Jakov Kucan B.S.E., University of Pennsylvania (1991) M.A., University of Pennsylvania (1991) Submitted to the Department of Mathematics in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY February 1997 @ Massachusetts Institute of Technology 1997. All rights reserved. x - I A uthor .... ................ Department of Mathematics /1. October 10, 1996 Certified by ....... , ,.... ..... .... ........................... Albert R. Meyer Hitachi America Professor of Engineering / -Thesis Supervisor (/1 n / Accepted by..... ... ......Accep.. ...yHungApplied.... .... ....ma.. .........Cheng..... Chairman, itics Committee Accepted by ................................... .......... .... ............ Richard Melrose oChairman, Departmental Committee on Graduate Students MAR 0 41997 Metatheorems about Convertibility in Typed Lambda Calculi: Applications to CPS transform and "Free Theorems" by Jakov Kutan Submitted to the Department of Mathematics on October 10, 1996, in partial fulfillment of the requirements for the degree of Doctor of Philosophy Abstract In this thesis we present two applications of using types of a typed lambda calculus to derive equation schemas, instances of which are provable by convertibility. Part 1: Retraction Approach to CPS transform: We study the continuation passing style (CPS) transform and its generalization, the computational transform, in which the notion of computation is generalized from continuation passing to an arbitrary one. To establish a relation between direct style and continuationpassing style interpretation of sequential call- by-value programs, we prove the Retraction Theorem which says that a lambda term can be recovered from its continuationized form via a A-definable retraction. The Retraction Theorem is proved in the logic of computational lambda calculus for the simply typable terms.
    [Show full text]