1 / 11

600.429 FUNCTIONAL PROGRAMING AT WORK - HASKELL AND DOMAIN SPECIFIC LANGUAGES

600.429 FUNCTIONAL PROGRAMING AT WORK - HASKELL AND DOMAIN SPECIFIC LANGUAGES. Dr. John Peterson Western State Colorado University. This Week. Homework 6: Last questions? Homwork 7 should be ready to go later today. It will be due next Friday.

zareh
Download Presentation

600.429 FUNCTIONAL PROGRAMING AT WORK - HASKELL AND DOMAIN SPECIFIC LANGUAGES

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 600.429FUNCTIONAL PROGRAMING AT WORK - HASKELL AND DOMAIN SPECIFIC LANGUAGES Dr. John Peterson Western State Colorado University

  2. This Week Homework 6: Last questions? Homwork 7 should be ready to go later today. It will be due next Friday. Next Monday will be spent getting organized on the projects – come ready to work. I’ll be talking to each group during class.

  3. SPJ! The God of Haskell will be here next week. Talk is at 11:15 – Be There!

  4. A New FRP – Arrows! Problems with the original FRP: • No way to capture system inputs. The type Behavior a does not make the source of a explicit • Nasty implementation issues involving space / time leaks The solution: Arrows (Yay for Category Theory)

  5. A New Abstraction • http://www.haskell.org/arrows/

  6. Example: Stream Processors data Stream a b = Stream ([a] -> [b]) runS :: Stream a b -> [a] -> [b] runS (Stream f) inputs = f inputs instance Arrow Stream where arr g = Stream (map g) Stream f1 >>> Stream f2 = Stream (\input -> f2 (f1 input)) first (Stream f) = Stream (\s -> zip (f (map fst s)) (map snd s))

  7. Euterpea Signal Processors The basic type is Clock c => SigFun c a b This allows different streams to have different sampling rates. Note that the arrow notation will require all components share a common clock You can explicitly upsample / downsample clocks using conversion functions

  8. Oscillators osc :: Clock c => Table-> Double-> SigFunc () Double oscFixed:: Clock c => Double -> SigFunc () Double Tables are a fast way of representing functions They allow arbitrary functions to be pre-computed Instead of calculating values on the fly (sin and cosare computationally complex!)

  9. Example: 3 Harmonics s :: Clock c => Sigfun c () Double s = proc () -> do f0 <- oscFixed 440 -< () f1 <- oscFixed880 -< () f2 <- oscFixed1320 -< () outA -< (f0 * 0.5 + f1 * 0.33 + f2 * 0.33)/1.83

  10. Instruments reedyWav= tableSinesN 1024 [0.4, 0.3, 0.35, 0.5, 0.1, 0.2, 0.15, 0.0, 0.02, 0.05, 0.03] reed :: Instr (Stereo AudRate) reed durpchvolparams = let reedy = oscreedyWav0 freq = apToHzpch vel = fromIntegralvol / 127 / 3 env = envLineSeg [0, 1, 0.8, 0.6, 0.7, 0.6, 0] (replicate 6 (fromRationaldur/6))

  11. Instruments in proc _ -> do amp <- env -< () r1 <- reedy -< freq r2 <- reedy -< freq + (0.023 * freq) r3 <- reedy -< freq + (0.019 * freq) let [a1, a2, a3] = map (* (amp * vel)) [r1, r2, r3] let rleft = a1 * 0.5 + a2 * 0.44 * 0.35 + a3 * 0.26 * 0.65 rright = a1 * 0.5 + a2 * 0.44 * 0.65 + a3 * 0.26 * 0.35 outA -< (rleft, rright)

More Related