analysis of functional transformation and programs
play

Analysis of Functional Transformation and Programs Neil Mitchell - PDF document

Analysis of Functional Transformation and Programs Neil Mitchell The Thesis Catch Uniplate Checking, safer Generic, shorter Supero Firstify Optimisation, faster Defunctionalisation Uniplate Generics library (similar to SYB1)


  1. Analysis of Functional Transformation and Programs Neil Mitchell

  2. The Thesis Catch Uniplate Checking, safer Generic, shorter Supero Firstify Optimisation, faster Defunctionalisation

  3. Uniplate • Generics library (similar to SYB1) • Write concise traversals over structures • Collect all variables in an expression: [v | Var v <- universe x] • Make all variables title-case: transform f where f (Var (x:xs)) = Var (toUpper x : xs) f x = x

  4. Uniplate advantages • No/few extensions • Simple types • Concise (~40% shorter than SYB) • Fast (at least 50% faster than SYB) • Makes use of compiler support • Does common stuff well

  5. Supero • A supercompiler – Evaluate the program at compile time – Resituate so you terminate • Old ideas, but rarely implemented – Supercompilation from Turchin – Homeomorphic embedding from Glück • First attempt for Haskell

  6. Supero improvements • New contributions – A strategy for let bindings – A better generalisation • Competitive with C (microbenchmarks) • Faster than GHC (small benchmarks) • Still a prototype, lots of choices to make

  7. Firstify • Partial defunctionalisation + First-order analysis method = Higher-order analysis method • Take several ingredients – Arity raising, inlining, specialisation – Add termination bounds

  8. Firstify results • Very practically motivated – Works well on the nofib suite • Stress test: print (0 :: Double) – Makes use of Arrays, IO Monad, IO Function, Show Continuation, list comprehensions..

  9. Catch • Automatic safety proof – If Catch says “Safe”, your program will not crash by calling error • First-order language (needs Firstify) • Division into two parts – An algorithm (deals with Core) – A constraint language (the lossy bit)

  10. Catch constraints • Constraints must: – Be finite (for a given type) – Provide three operations – The operations must be consistent • MP-constraints represent data type patterns in a finite way

  11. Catch results • Tried on HsColour – Real program, real users – Even a web service (hpaste.org) – Found 3 real bugs, now fixed – 1 false positive, but a nice refactoring • Very automatic, but still powerful

  12. Current status • Uniplate: already widely used • Supero: proof of concept • Firstify: works well enough for Catch • Catch: useful in some situations

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend