This is day 1 of the 19th International Conference on Functional Programming.<\/p>\n
Opening by the General Chair, Johan Jeuring<\/strong><\/p>\n Quick facts about ICFP 2014:<\/p>\n Keynote: Using Formal Methods to Enable More Secure Vehicles -- DARPA's HACMS Program<\/strong><\/p>\n Kathleen Fisher (Tufts University)<\/em><\/p>\n Four and a half years long program, 2012--2017.<\/p>\n Many everyday objects today are computers! Infrastructure, medical devices, refrigerators, cars ... examples given for these things being hacked.<\/p>\n Focuses on cars: \"computer on wheel\" -- 100s of interconnected computing units. Everything is under control of software: braking, accelerating, locking.<\/p>\n First attack vector was via diagnostic bus but this requires physical control (you need to be in the car). Later found that physical control is not necessary to take over a car (Bluetooth, emergency number, audio CD).<\/p>\n Documentation for car systems exist and spare parts can be ordered online and analyzed (so no air gap, no security by obscurity).<\/p>\n Use the desktop computer approach? -- anti-virus scanning, intrusion detection systems, patching infrastructure. Problem: \"security software\" tends to introduce vulnerabilities. Also: embedded systems don't have the resources to monitor themselves all the time the way desktop computers do.<\/p>\n SAT solvers are getting faster; this allows us to use them to verify real software and hardware.<\/p>\n Clean-slate methods for high-assurance software: code synthesis, DSLs, Interactive Theorem Prover as PL.<\/p>\n Structure of the HACMS program: technical areas are vehicle experts, OS (building on verified sel4 kernel), control systems, research integration (management, composition: how to put high-assurance components together to create a bigger high-assurance component?, integration), red team (hints at problem of how to assess the security of a system -- currently a heuristic is: how long does it take for hackers to take over the system?).<\/p>\n Air team works on helicopter and quadcopter; ground team works on cars.<\/p>\n Demo video: WiFi-controlled quadcopter being taken over using aircrack-ng.<\/p>\n Every 18 months the red team gets access to the system and tries to find vulnerabilities.<\/p>\n Started with monolithic software, no RTOS, no security. After first iteration: use faster processor, put FreeRTOS and HAL under still monolithic Ardupilot software. Next iterations: generate more and more code from new DSL.<\/p>\n SMACCMCopter 18 months assessment: it flies! Air team can prove system-wide security properties like memory safety, ignoring malformed \/ non-authenticated messages; all good messages received will reach the motor controller. Red team found no security flaws in sex weeks with full access to source code. \"Probably the most secure UAV on the planet\" (\"kinda scary\").<\/p>\n Research integration (Rockwell Collins) used AADL to describe how hardware and software components fit together. Developed tools (AGREE, Resolute) to reason about the system. They are used to check assumptions about the system (example: there is only one way to communicate with the quadcopter).<\/p>\n Control systems (Galois) created Ivory and Tower, open-source EDSLs for synthesizing safe low-level code and tasks, respectively. Designed and built SMACCMCopter, the first high-assurance UAV software, in under two engineer-years.<\/p>\n OS (NICTA) proved full functional correctness of a fast OS microkernel, sel4 (now open source). Also working on eChronos, a high-assurance RTOS product line, and formally verified OS components (drivers, file system etc). CAmkES is a system for connecting and configuring these components.<\/p>\n Vehicle experts (Boeing) integrate HACMS technologies into the Unmanned Little Bird.<\/p>\n Air team in phase two tries to re-architecture (split) the system so it runs on a flight computer and a mission computer as is usual in real world scenarios. Red team will then try to gain control over the flight computer from the mission computer.<\/p>\n More detailed description of individual tasks follows.<\/p>\n Tech transition: a huge problem. The cyber-physical systems industry know they have a cyber-security problem but there are many barriers to adoption of HACMS-like technology.<\/p>\n C: Make it cool! Come up with a catastrophic event! Q: Why not have quadcores in the car? Q: How much does this project cost? Q: Research: top-down or bottom-up, which is better? Q: You expect to pay more for high-assurance code. What is the cost? Especially for the second, third, ... project. Q: Why did you replace the Arduino processor? Q: (bit unclear) Q: How do you combine secure and unsecure code? Q: How do you know the hardware does what you think it does? Session 1: Domain Specific Languages I (Chair: Anil Madhavapeddy)<\/strong><\/p>\n Building Embedded Systems with Embedded DSLs (Experience Report)<\/p>\n Patrick Hickey (presenting), Lee Pike, Trevor Elliott, James Bielman, John Lauchbury (Galois Inc)<\/em><\/p>\n Open source: github.com\/GaloisInc<\/p>\n Goal: Build a high assurance quadcopter controller (long-term: helicopter controller). Small embedded system (microcontroller), hard real time, safe, secure. Had three engineers, 18 months, starting from scratch. Expected to write ~50kloc C\/C++ code.<\/p>\n Embedded systems are everywhere. They're basically computers from the 80s: small and cheap. Development tools are from the 80s too (C). You get all the security flaws you'd expect -- buffer overflows etc. Can't push patches, and there are more attack surfaces than ever.<\/p>\n Approach. Haskell, OCaml? Problem: very resource limited system; GC imcompatible with hard real-time. C, C++? Tradeoff between safety and productivity -- e.g. NASA Jet Propulsion Lab writes high assurance C; extremely costly.<\/p>\n Alternative: build your own tools. Start with clean slate, use language approach, correct by construction. Built an embedded DSL in just a few months: Ivory, embedded in Haskell, compiles to safe subset of C. It's memory safe and allows no undefined or implementation defined behavior. No heap, only global and stack allocation.<\/p>\n Haskell type system guarantees properties of Ivory language programs; Haskell is Ivory's macro language.<\/p>\n Ivory: expressions are pure Haskell values; statements are effectful, embedded in monad. Examples for what has been embedded in the type system from the paper are given.<\/p>\n Ivory programs (modules) are a collection of top level C procedures and variables.<\/p>\n Tower DSL: organising entire applications. Composes Ivory procedures into applications. Initial problem: multithreading with message passing; code generation of low level primitives. Tower is implemented as a Haskell macro that generates Ivory programs. Tower contains concept of Tasks and Channels. It became the DSL describing software components.<\/p>\n (Side story: a third-party Python tool generating C output was modified to output Ivory code as well; this code could then be type checked to make sure it was correct. This way, the Python tool didn't need to be trusted.)<\/p>\n SMACCMPilot: 10kloc (and growing) of drivers, 3kloc application (stabilizing the quadcopter and flying), 10kloc message marshaling. Generates about 48kloc of correct-by-construction C.<\/p>\n Red team results: found no buffer overflow, no undefined behaviours, no denial of service. After five months they found two subtle architecture level bugs. Lifted the layer of abstraction: no need to worry about low-level problems, can concentrate on architecture.<\/p>\n Conclusion. Quickly and cheaply built a large, complex application; caught lots of errors early by Haskell type checking, could focus on application design; used Haskell as a macro system making it possible to build compositional programs.<\/p>\n Q: How is this an improvement over the OCaml code generator? Q: Restricted amount of memory: how did you deal with that? Q: You construct correct-by-construction code that is a subset of C, e.g. you don't do pointer arithmetic. Q: Do all arrays have a size known at compile time? Q: Type error messages were a problem? Q: You don't allow undefined behavior. How do you prevent overflows? Q: How about Rust? Concurrent NetCore: From Policies to Pipelines<\/p>\n Cole Schlesinger (presenting), Michael Greenberg, David Walker (Princeton University)<\/em><\/p>\n Review on networking: have an enterprise network with hosts, connected to a switch. In a SDN, the controller tells the switch which rules to use to deal with packets. Openflow 1.0 uses prioritised rules for this. Has predicates and actions. But switch hardware is not that simple: lots of tables in a switch pipeline. New configurable designs available now.<\/p>\n Openflow 2.0: splits interaction between controller and switch into two phases: 1. configuration (think flashing an FPGA); 2. population of the tables.<\/p>\n Contributions: core calculus for packet processing pipelines and controller policies; hardware models for three switch architectures; compilation algorithms for deploying general controller polices to target switch architectures.<\/p>\n Example: Broadcom \"trident\" switch. Each component can be thought of as function from packets sets of packets. (empty: drop, singleton: forward, multiple: e.g. flooding).<\/p>\n Have forwarding table; sequencing; if-statements over predicates; rewrite component.<\/p>\n Intel \"flexpipe\" supports reconfigurability. Each table can match on and write to every field. Also supports concurrency; introduce concurrency operator to model this.<\/p>\n What about the controller? Easiest for programmer to define virtual pipeline that describes the requirements.<\/p>\n New operator: packet duplication -- copy and run packet through multiple components.<\/p>\n Example: compilation to the barefoot \"RMT\" architecture -- three passes: 1. consolidate packet duplication (output ports must be known at the time of packet duplication, also need to add metadata to model processing as it would have taken place in the virtual pipeline); 2. refactor field modification; 3. place generated tables into physical tables (use commutativity of concurrency and other tricks -- the algorithm is a combination of brute force and dynamic programming).<\/p>\n Metatheory. Predicates form a Boolean algebra; grammar given for Predicates and Policies. Have a type system and small-step semantics.<\/p>\n Typing judgement of the concurrency operator prevents race conditions. Can prove normalization and confluence, in combination giving strong normalization (determinacy). Adequacy can be shown too.<\/p>\n Future work: implement the compiler and transformer on a real chipset.<\/p>\n Q: Does your system support encryption of packets inside the network, like IPSEC? Q: Plus operator? Session 2: Static Analysis (Chair: Ken Friis Larse)<\/strong><\/p>\n SeLINQ: Tracking Information Across Application-Database Boundaries<\/p>\n Daniel Schoepe, Daniel Hedin, Andrei Sabelfeld (Chalmers University of Technology)<\/em><\/p>\n Motivation: confidential data is entrusted to many application which are composed of many components. Information leakage often occurs at boundaries, e.g. SQL injections. Need to look at confidentiality as end-to-end security to prevent attaches.<\/p>\n Contributions: track information flow for code using database queries. Security type system ensures noninterference and proof of soundness. Compiles to executable F# code; realistic demo.<\/p>\n Approach: Traditionally, attacks often occur at component boundary, e.g. SQL injections. Tierless approach: correct communication across boundary ensured at compile-time. Example: write everything in F#, some of which compiles to SQL.<\/p>\n Intuition: untrusted program shouldn't leak private data to third parties. Need to track flow of information through the program.<\/p>\n Noninterference: private inputs must not influence public outputs. Attacker doesn't learn anything about secrets by observing public behavior of the program.<\/p>\n Language-integrated query -- build queries via meta-programming. Example: LINQ in F#. Guarantees user input is sanitized and SQL is syntactically correct.<\/p>\n Idea: types annotated with security levels (L for public, H for private).<\/p>\n Security policy specified by giving a typing to each database. Code example given.<\/p>\n Introduce low-equivalence relation for values that are indistinguishable for the attacker. Defined structurally based on type; components with level L have to be equal.<\/p>\n Each secure program should be noninterfering with itself.<\/p>\n Security type system has soundness: if program is well typed then it is noninterfering.<\/p>\n Implementation: type checker (based on constraint solving and unification)and compiler implemented in Haskell using BNFC. Language compiles to executable F# code; compilation consists mostly of removing security types. Type system and soundness proofs allow user-defined algebraic datatypes.<\/p>\n Case study: near-realistic movie rental database. Want to protect names and exact addresses of customers and staff. Examples given of valid and invalid queries.<\/p>\n Summary: light-weight framework for tracking information flow; security type system ensures noninterference; proof-of-concept implementation given; extension to ADTs; case study.<\/p>\n Future work: extend to client code (JS).<\/p>\n Q: Can I make the security policy express things like \"only certain people should be able to access this\" Q: Could this be embedded into a computational framework where one could assist the system in showing that some access is in fact safe when the type system's approximation cannot show it? Q: Do you deal with aggregation? Type-Based Parametric Analysis of Program Families<\/p>\n Sheng Chen (presenting), Martin Erwig (Oregon State University)<\/em><\/p>\n Can often think of programs as \"program families\" which by configuration can be refined to single programs. But build & install may fail in unexpected ways. Trying all combinations of options is infeasible.<\/p>\n Idea: use variational analysis directly on the program family \/ variational program. Introduce a framework for doing variational analysis in the type system.<\/p>\n Notation for choice in variational programs introduced.<\/p>\n Program by search.<\/p>\n Creating variational analyses: 1. add variation data structures, e.g. lists become variational lists (VL, variation in vales and list structures); 2. adapt analysis, e.g. analysis of sort becomes analysis of VL sort; 3. correctness proof (tedious); 4. performance analysis<\/p>\n Example: variational typing rules shown.<\/p>\n This framework consists of annotations (sets), types and constraints. All three have extension points. Application and Choice typing rules are shown.<\/p>\n A constraint solving example is shown involving merging and splitting.<\/p>\n Instantiating the framework for variational 0CFA: no extensions required for annotations, types and constraints but rules need to be extended.<\/p>\n Correctness evaluation of the framework. Implemented Flyweight Java version of the framework and proved it correct.<\/p>\n Performance evaluation shows that the framework performs almost as good as manually lifted 0CFA analysis.<\/p>\n Q: Is the aggressive (faster) approach powerful enough to check types? Q: Have you tried to do effect analysis in this framework? Session 3: Binding Structure (Chair: Tarmo Uustal)<\/strong><\/p>\n Romeo: A System for More Flexible Binding-Safe Programming<\/p>\n Paul Stansifer (presenting), Mitchell Wand (Northeastern University)<\/em><\/p>\n Introduction: metaprogramming allows us to automatically generate programs. Name binding is a problem -- example given. Recent survey found that 8 out of 9 metaprogramming systems had name binding problems.<\/p>\n Binding safety: alpha-equivalent inputs should produce alpha-equivalent outputs. In theory this works: FreshML, MetaML. But these only support simple binding forms like \u00ce\u00bb. Real languages have more than \u00ce\u00bb, e.g. let* in Racket, \"local\" construct in SML.<\/p>\n Contributions: a binding-safe PL, Romeo, with a notation to express complex binding, clear big-step semantics, proof of correctness.<\/p>\n Explains the concepts of \"imports\" and \"exports\" in the context of name binding.<\/p>\n In Romeo, binding information is in the types.<\/p>\n What makes two let*s alpha-equivalent? Follow-up: when are two Romeo declarations alpha-equivalent? -- must have exactly the same behavior. Thus their exported binders must be the same.<\/p>\n Romeo's runtime enforces safety. It automatically avoids name clashes. Accidentally unbound names are a dynamic error ... which Romeo's optional deduction system can statically rule out.<\/p>\n Conclusion: Romeo is a binding-safe language that supports term languages with complex binding structure.<\/p>\n Q: What about de Bruijn indices? Effects in the metalanguage? Q: Can I play with Romeo? Q: This looks similar to \u00ce\u00bb-m. C: Thanks for starting with a concrete example. Q: How does hygienic macro expansion relate to this? Q: Complexity of expanding Romeo code? Q: How much expressiveness does Romeo have? Maximal Sharing in the Lambda Calculus with letrec<\/p>\n Clemens Grabmayer (presenting, VU University Amsterdam), Jan Rochel (Universiteit Utrecht)<\/em><\/p>\n Motivation: increasing sharing is desirable -- compact code, avoid duplicated work at run-time, enables us to check equality of unfolding semantics of programs.<\/p>\n 1. interpretation of \u00ce\u00bb-letrec terms as term graphs; 2. bisimilarity and bisimulation collapse of \u00ce\u00bb term graphs; 3. readback of \u00ce\u00bb term graphs.<\/p>\n This method extends common subexpression elimination and is targeted at maximizing sharing statically.<\/p>\n Example of unfolding equivalence of fixpoint operator.<\/p>\n Example of graph interpretation given. First we generate a \u00ce\u00bb higher order term graphs. Transform into first-order term graph with scope vertices with backlinks, then into \u00ce\u00bb term graph.<\/p>\n Then we do a bisimulation check between \u00ce\u00bb term graphs.<\/p>\n The class of eager-scope \u00ce\u00bb term graphs is closed under functional bisimilarity.<\/p>\n Implementation: \"maxsharing\" on Hackage, uses Utrecht University Attribute Grammar Compiler.<\/p>\n Time complexity analysis of the individual steps follows.<\/p>\n Possible extensions: support for full functional languages (would require work on a core language with constructors and case statements); prevent space leaks caused by disadvantageous sharing.<\/p>\n Applications: use maximal sharing at run-time, possibly directly on supercombinator graphs; can be coupled with GC; code improvement (statically) to detect code duplication; checking function equivalence (relevant for proof assistants, theorem provers, dependently-typed PLs).<\/p>\n Q: Explicit weakening. Have you tried to implement reduction of the first order term graph? Q: Does this subsume Kleene algebra? Session 4: Program Optimisation (Chair: John Launchbury)<\/strong><\/p>\n Practical and Effective Higher-Order Optimizations<\/p>\n Lars Bergstrom (presenting, Mozilla Research), Matthew Fluet (Rochester Institute of Technology), John Reppy University of Chicago), Nora Sandler (University of Chicago), Matthew Le (Rochester Institute of Technology)<\/em><\/p>\n Control flow analysis (CFA) allows higher-order inlining. In practice, high performance function programs avoid functions.<\/p>\n Two subproblems: 1. what is the concrete function called from some computed function call? -- already handled by 0CFA; 2. does the potential inlining point have a compatible environment? -- \"reflow\", JITs.<\/p>\n Contribution: determine when higher-order inlining is safe. Key insight: don't check \"is the environment the same?\" but \"could any of the free variables have been rebound between the closure capture location and the call site \/ potential inlining point?\". This supersedes ad-hoc higher-order inlining tricks.<\/p>\n Technique: 1. normalize and number source code (annotations for variable binding sites); 2. build control-flow graph; 3. add CFA-informed edges; 4. Perform rebinding search on paths between closure capture location and potential inlining point<\/p>\n Safe and unsafe example given; control flow graphs shown.<\/p>\n Reflow analysis is strictly stronger. But this analysis has about 3% time cost of the entire compilation process.<\/p>\n Conclusion: start using closures in benchmarks!<\/p>\n Higher-order inlining heuristics still missing; correctness proof still incomplete.<\/p>\n Q (SPJ): You showed that the analysis is cheap but what do we get? Q: If I want to use this: is it clear for me where the optimization will kick in? Q: I usually pass closures to \"map\" and \"fold\", so these will have many call sites. Can this still be optimized in this framework? Q: Is it imaginable to prove that the optimization actually makes the program run faster? Q: What's the relationship to Milton's optimizations? Worker\/Wrapper\/Makes It\/Faster<\/p>\n Jennifer Hackett (presenting), Graham Hutton (University of Nottingham)<\/em><\/p>\n Context: lots of research into optimization focuses on correctness: is meaning preserved?; comparatively little work on improvement -- ensuring programs become \"better\".<\/p>\n Example: list reversal function. How can we prove that the improved program is both faithful to the original version and also more efficient?<\/p>\n The Worker\/Wrapper transformation: Original program has type A, worker has type B, wrapper has type B -> A.<\/p>\n Formally, given<\/p>\n and<\/p>\n then<\/p>\n Reasoning about efficiency. Need some way to compare the cost of two programs. Naive approach: count steps taken to evaluate terms to some normal form. But this fails in a lazy context! Need precongruence.<\/p>\n Precongruence: a preorder and a congruence -- this excludes negative interaction between improvements at different points in the program.<\/p>\n Improvement theory: counting steps, also have a notion of improvement within a constant factor.<\/p>\n Improvement induction principle shown. \"tick\" idea. It's like guarded coinduction.<\/p>\n Shows the Worker\/Wrapper theorem for improvement theory (typeless).<\/p>\n Structure of improvement proofs is essentially the same as that of correctness proofs.<\/p>\n Conclusions: we can make rigorous arguments about the efficiency of lazy programs; make performance guarantees for a general-purpose optimization.<\/p>\n Further work: structured recursion; turn it into a typed theory (advantage: only need to worry about contexts where the types make sense); look at improvement of space usage and other resources; quantify improvement (how much faster? which optimization should be applied if there are alternatives?); automate it.<\/p>\n Q: Do you have completeness results? Q: Do you have any examples where Worker\/Wrapper transformation makes things slower? Q: Problem in GHC is the cost of building closures. How is this reflected in your framework? Q: How about local improvements? Q: Would things change dramatically if you applied this to a call by value language? Session 5: Context Dependence (Chair: Yukiyoshi Kameyama)<\/strong><\/p>\n Compositional Semantics for Composable Continuations: From Abortive to Delimited Control<\/p>\n Paul Downen, Zena M. Ariola (University of Oregon)<\/em><\/p>\n Classical control: callcc is the classic control operator, going back to Scheme. Corresponds to classical logic (the way the \u00ce\u00bb-calculus corresponds to intuitionist logic).<\/p>\n Delimited control: delimit the scope of effects; continuations compose like functions. These little changes make delimited control vastly more expressive than classical control.<\/p>\n \u00ce\u00bb-calculus + callcc operator and \u00ce\u00bb\u00ce\u00bc-calculus are equivalent. Relaxing \u00ce\u00bb\u00ce\u00bc syntactically gives \u00ce\u203a\u00ce\u00bc which allows delimited control! \u00ce\u203a\u00ce\u00bc in turn is equivalent to lambda + shift0 + reset0.<\/p>\n Classical control in detail. Operational semantics of callcc as an extension of CBV lambda-calculus given. Alternatively, we can understand callcc using an equational theory. But: it's weaker than operational semantics. Some programs can be evaluated to a value but equational theory for callcc cannot reach a value! How can we know that we have the whole context?<\/p>\n Calling a continuation never returns -- it \"jumps\". A jump is the same when inside a larger evaluation context so it delimits the usable extent of a continuation.<\/p>\n \u00ce\u00bb\u00ce\u00bc syntactically distinguishes jumps as \"commands\".<\/p>\n Relaxing the syntax. \u00ce\u203a\u00ce\u00bc collapses term\/command distinction. It is interpreted with the same rules only that we have more expressive meta-variables. No new constructs, no new rules. As typed calculi, \u00ce\u203a\u00ce\u00bc is considered equivalent to Parigot's \u00ce\u00bb\u00ce\u00bc. What happens if you ignore types?<\/p>\n shift and reset: common basis for delimited control. Continuations return and can be composed like functions.<\/p>\n \u00ce\u00bb-calculus + shift + reset is a true subset of \u00ce\u203a\u00ce\u00bc. What's missing?<\/p>\n Difference between shift and shift0: the latter removes its surrounding delimiter.<\/p>\n \u00ce\u00bb-calculus + shift0 + reset0 is equivalent to \u00ce\u203a\u00ce\u00bc.<\/p>\n \u00ce\u203a\u00ce\u00bc as a framework for delimited control gives provable observational guarantees about the operators, e.g. idempotency of reset.<\/p>\n More in the paper: can get nice reasoning principles using call-by-value, call-by-name, call-by-need; equational correspondence with compositional transformations.<\/p>\n Q: What do you mean by equality in this presentation? Q: \u00ce\u00bb\u00ce\u00bc has a well known type system but to introduce delimited control you had to relax the syntax. Is there a type system for this? Q: Classical logic, intuitionist logic -- delimited logic? Coeffects: A Calculus of Context-Dependent Computation<\/p>\n Tomas Petricek (presenting), Dominic Orchard, Alan Mycroft (University of Cambridge)<\/em><\/p>\n Coeffects is the dual of Effects. Done!<\/p>\n This talk is about the context in a type judgement.<\/p>\n Effect systems: \u00ce\u201c :- e : \u00cf\u201e & \u00cf\u0192 Interesting properties of \u00ce\u201c (\"view from the extreme left\"): variable related -- liveness, bounded linear logic, data-flow programming, provenance; environment related -- implicit parameters, type classes, distributed computing, platform versioning.<\/p>\n Coeffect calculus for bounded reuse: annotate each variable in the environment with the number of its uses in the expression, essentially tracking the number of variable uses.<\/p>\n Variable, abstraction and contraction rules shown.<\/p>\n Another possibility: coeffect calculus with historical values. Replace addition with max operation in the contraction rule.<\/p>\n Environment related: coeffect calculus for implicit parameters. Example: implicit parameter for time zone and time. We can calculate how many parameters are still required (i.e. not given by the current environment). The corresponding rule is non-deterministic.<\/p>\n What's in the paper? Unified system: coeffect scalar structure (a generalized semiring structure) and shape-indexed coeffects (context splitting and merging, per-variable or whole-context). Also have monadic and comonadic semantics -- not simple as \u00ce\u00bb-calculus is asymmetric (many to one)!<\/p>\n Why do coeffects matter? Generalize interesting systems (liveness, data-flow, implicit parameters, type classes) and (indexed) comonads are cool.<\/p>\n Q: What happens if you have (co)monads in the classical calculus? Program Chair's Report<\/strong><\/p>\n Quick paper stats:<\/p>\n 28 accepted papers out of 97 submissions.<\/p>\n 2\/9 functional pearls and 2\/3 experience reports accepted.<\/p>\n 299 reviews -- at least three per paper.<\/p>\n 72 hour author response period (as usual).<\/p>\n It was decided not to allow papers from members of the program committee.<\/p>\n Comparison with previous years: number of papers approximately stable, share of accepted papers even more so.<\/p>\n Functional pearls are accepted less than normal papers.<\/p>\n Author's location: USA, UK, France, Japan, Netherlands, Sweden, Germany, other.<\/p>\n UK has highest acceptance rate, then USA.<\/p>\n Papers submitted only a couple of hours before the deadline were less likely to be accepted -- before that there seems to be no correlation between submission time and acceptance probability.<\/p>\n Big thanks to the program committee!<\/p>\n Deputy Lord Mayer of Gothenburg: invitation for drinks, short history of the city.<\/p>\n","protected":false},"excerpt":{"rendered":" This is day 1 of the 19th International Conference on Functional Programming. Opening by the General Chair, Johan Jeuring Quick facts about ICFP 2014: 340 people registered for ICFP 466 people registered for any event most people are from Sweden, UK and USA 21 sponsors, $60k in sponsoring Keynote: Using Formal Methods to Enable More […]<\/p>\n","protected":false},"author":39,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[6,30],"tags":[98,79,35],"_links":{"self":[{"href":"https:\/\/www.syslog.cl.cam.ac.uk\/wp-json\/wp\/v2\/posts\/1771"}],"collection":[{"href":"https:\/\/www.syslog.cl.cam.ac.uk\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.syslog.cl.cam.ac.uk\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.syslog.cl.cam.ac.uk\/wp-json\/wp\/v2\/users\/39"}],"replies":[{"embeddable":true,"href":"https:\/\/www.syslog.cl.cam.ac.uk\/wp-json\/wp\/v2\/comments?post=1771"}],"version-history":[{"count":10,"href":"https:\/\/www.syslog.cl.cam.ac.uk\/wp-json\/wp\/v2\/posts\/1771\/revisions"}],"predecessor-version":[{"id":1790,"href":"https:\/\/www.syslog.cl.cam.ac.uk\/wp-json\/wp\/v2\/posts\/1771\/revisions\/1790"}],"wp:attachment":[{"href":"https:\/\/www.syslog.cl.cam.ac.uk\/wp-json\/wp\/v2\/media?parent=1771"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.syslog.cl.cam.ac.uk\/wp-json\/wp\/v2\/categories?post=1771"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.syslog.cl.cam.ac.uk\/wp-json\/wp\/v2\/tags?post=1771"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}\n
\nA: Well this is a response to \"you can take over a car wirelessly\". Another aspect: it will probably be mandated soon for cars to take to each other -- but remote code execution was never considered.<\/p>\n
\nA: Very price-sensitive; the industry has tiny margins.<\/p>\n
\nA: $70m.<\/p>\n
\nA: We need both. DARPA is bottom-up, NSF is top-down.<\/p>\n
\nA: High-assurance code will always be more expensive. We hope to bring down the additional cost by developing tools that aid building high-assurance code. But have to consider: traditionally we pay people to write sloppy code; the cost from running sloppy code is never properly accounted for! Maybe high-assurance software is cheaper in the long run.<\/p>\n
\nA: We wanted to start with an existing open source hardware platform.<\/p>\n
\nA: We're close to having one high-assurance system, the SMACCMCopter. Still far away from having a high-assurance car for example (one problem: no-one knows how many lines of code a normal car has!)<\/p>\n
\nA: That's one of the challenges of course.<\/p>\n
\nA: In this project, we simply trusted the hardware. Other people are working on hardware issues.<\/p>\n
\nA: Cross-compilation was a specific concern, making sure the code runs on 8-bit, 16-bit, 32-bit architectures.<\/p>\n
\nA: Don't yet have a way to assess the maximum stack use of a program. But we think it is solvable.<\/p>\n
\nA: Yes.<\/p>\n
\nA: Yes.<\/p>\n
\nA: Yes.<\/p>\n
\nA: This is not done at the type level; instead we insert assertions in the C code (at the moment ~2500 assertions). Hope to analyze and discharge these assertions statically in the future.<\/p>\n
\nA: Big fan. Rust was in its infancy when the project started two years ago. But when using Haskell we get type checking for our macros.<\/p>\n
\nA: Yes and no -- you could think of encryption as an atomic action but it has not been fully worked out.<\/p>\n
\nA: Plus operator is duplication. Semantics: both packets are sequentially processed by the remaining pipeline.<\/p>\n
\nA: No, can't do this at the moment.<\/p>\n
\nA: That would be an interesting extension.<\/p>\n
\nA: This has not been considered yet.<\/p>\n
\nA: Yes.<\/p>\n
\nA: The framework should be expressive enough to do this but it hasn't been done yet.<\/p>\n
\nA: Romeo is side-effect free.<\/p>\n
\nA: I'll try to convince my supervisor to release the source code. Currently the implementation is out of sync with the formalism.<\/p>\n
\nA: Lambda-m is not powerful enough. We give you syntax case.<\/p>\n
\nA: Thanks to my peers for the criticism!<\/p>\n
\nA: If your macro gets larger and larger, there is less safety -- hygienic macros are all about protecting macros from each other.<\/p>\n
\nA: O squared, so that's not good. Macro systems have the same problem though. Trick: perform actual substitution lazily, and we think the same technique could be used with Romeo also.<\/p>\n
\nA: Can we express all Racket macros -- probably, we think most are just simple extensions of what we have right now.<\/p>\n
\nA: It's possible. Used port graphs to implement reduction because that seemed easier.<\/p>\n
\nA: Maybe? Interesting idea.<\/p>\n
\nA: Benchmarks are in the paper.<\/p>\n
\nA: Well, yes, if you're the compiler writer (laughs from the audience). But this is a problem indeed.<\/p>\n
\nA: \"map\" and \"fold\" are usually handled in a special way by the compiler anyway.<\/p>\n
\nA: Next presentation will try to answer this. But it's very difficult.<\/p>\n
\nA: Not entirely sure. Is defunctionalization or CFA-style analysis better? An interesting question.<\/p>\nf : A -> A, g : B -> B, abs : B -> A, rep : A -> B<\/pre>\n
abs . rep = id, g . rep = rep . f<\/pre>\n
fix f = abs (fix g)<\/pre>\n
\nA: It's not clear whether Worker\/Wrapper improvement proofs can be translated from fixpoint style to improvement theory.<\/p>\n
\nA: Of course we have come across these, but we wouldn't put that in the paper! (Laughs from the audience). [Tree reversal example follows]<\/p>\n
\nA: Read early papers on improvement theory.<\/p>\n
\nA: This work does not look at the surroundings.<\/p>\n
\nA: There has been some work on that.<\/p>\n
\nA: Observational equality -- this is about tools for reasoning about programs rather than expressivity of the calculi.<\/p>\n
\nA: (?)<\/p>\n
\nA: YES! Should investigate this.<\/p>\n
\nCoeffect : \u00ce\u201c & x :- e : \u00cf\u201e<\/p>\n
\nA: Interesting question.<\/p>\n