- Haskell-Cafe - Haskell.org

Yi Google summer of code project
by Bastien Jacot-Guillarmod 23 Apr '13

23 Apr '13

Hello, I'm interested in doing some improvments on the Yi editor for my Google summer of code by implementing a completion pop up list for any buffer and a smart completion for haskell. But I don't really know if this kind of project could be acceptable, for the following reason: 1) Should a GSoC project be mostly a working experience or also a learning one? I am not the most seasoned haskell programmer, but I really which to dive into a real-life project in this language. 2) Is it too long, too small? I don't have too many years of programmation in haskell behind me even if I have done some functionnal programming in other languages (Scala most of the time), hence I don't want to take something that will be overwhelming. 3) is Yi associated with haskell.org or it is not possible to have a project on Yi while being mentored by haskell? Thanks for your insight! Regards, Bastien Jacot-Guillarmod, 3rd CS bachelor student at EPFL (Lausanne) -- View this message in context: http://haskell.1045720.n5.nabble.com/Yi-Google-summer-of-code-project-tp572… Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.

3 2

Re: [Haskell-cafe] Implementing an embedded language that threads a global structure.
by Ian Bloom 23 Apr '13

23 Apr '13

I'm probably not the best person to answer your questions but here is a try: I refer to my language as a mini language because I'm only showing lamda, application and extension. You might choose to add other features like symbol definitions, fixed points, pattern matching etc. which in the more extensive versions of my code, I have. The state monad would essentially be application only, it would not include the very powerful lambda. I imagine you could implement such a language using monads but it would just be the same thing, yet more difficult to read and understand. By implementing the language embedded in Haskell you can "piggyback" on Haskell's parser and type-checker. This is the first paper I read about embedded languages. Compiling Embedded Languages - CiteSeerX<http://www.google.com/url?sa=t&rct=j&q=compiling%20embedded%20languages&sou…> You might think of embedded languages as a style or design pattern. It's purpose is to abstract an entire category of behavior and simplify the task of a person programming in the embedded language even if they are somehow limited. It seems like an embedded language would be a good option. In the code sample below, if you add a string parameter to LambdaExtension to include pieces of Perl code and make a version of the instance Pr for printing perl code into a string you might be well on your way: module Main ( main, lam, app, ext, trmA, trmB, trmC, trmD, trmE, trmF ) where data LambdaExtension f = LExtend String f int_ :: Integer -> LambdaExtension Integer int_ x = LExtend (show x) x add_ :: Num a => LambdaExtension (a -> a -> a) add_ = LExtend "+" (+) mul_ :: Num a => LambdaExtension (a -> a -> a) mul_ = LExtend "*" (*) leq_ :: Ord a => LambdaExtension (a -> a -> Bool) leq_ = LExtend "<=" (<=) not_ :: LambdaExtension (Bool -> Bool) not_ = LExtend "not" not class Calculus repr where lam :: String -> (repr gl a -> repr gl b) -> repr gl (a->b) def :: String -> repr gl a -> repr gl a app :: repr gl (a->b) -> repr gl a -> repr gl b fix :: String -> (repr gl a -> repr gl a) -> repr gl a ext :: LambdaExtension e -> repr gl e -- R is the evaluator data R gl t = R t deriving Show unR (R x) = x instance Calculus R where lam _ f = R (\z -> unR (f (R z))) def _ f = R (unR f) app e1 e2 = R ( (unR e1) (unR e2) ) fix _ f = R (fx (unR . f. R)) where fx f = f (fx f) ext (LExtend _ f) = R f -- Pr is the printer newtype Pr g a = Pr String unPr (Pr f) = f instance Calculus Pr where lam vN f = Pr(let var = Pr vN body = unPr (f var) in "\\"++ vN ++"->"++ body) def dN f = Pr (dN ++ " = " ++ unPr f) app e1 e2 = Pr(let e1b = unPr e1 e2b = unPr e2 in "(" ++ e1b ++ " " ++ e2b ++ ")") fix vN f = Pr(let var = Pr vN body = unPr (f var) in "fix\\" ++ vN ++ "->" ++ body) ext (LExtend s _) = Pr s app2 f x y = (app (app f x) y) app3 f x y z = (app (app2 f x y) z) app4 f x y z w = (app (app3 f x y z) w) -- Sample Terms trmA = lam "x" (\x -> lam "y" (\y -> app x y)) trmB = lam "y" (\y -> app trmC y) trmC = lam "c" (\c-> app2 (ext add_) c (ext (int_ 1))) trmD = (ext (int_ 3)) trmE = app trmC trmD trmF = app trmC trmE main = do putStrLn "Hello!" putStrLn $ show $ unPr (trmA) putStrLn $ show $ unPr (trmF) putStrLn "**************" Cheers, Ian On Tue, Apr 23, 2013 at 11:12 AM, Ian Bloom <ianmbloom(a)gmail.com> wrote: > I'm probably not the best person to answer your questions but here is a > try: > > I refer to my language as a mini language because I'm only showing lamda, > application and extension. You might choose to add other features like > symbol definitions, fixed points, pattern matching etc. which in the more > extensive versions of my code, I have. > > The state monad would essentially be application only, it would not > include the very powerful lambda. I imagine you could implement such a > language using monads but it would just be the same thing, yet more > difficult to read and understand. By implementing the language embedded in > Haskell you can "piggyback" on Haskell's parser and type-checker. > > This is the first paper I read about embedded languages. Compiling > Embedded Languages - CiteSeerX<http://www.google.com/url?sa=t&rct=j&q=compiling%20embedded%20languages&sou…> > You might think of embedded languages as a style or design pattern. It's > purpose is to abstract an entire category of behavior and simplify the task > of a person programming in the embedded language even if they are somehow > limited. > > It seems like an embedded language would be a good option. > In the code sample below, if you add a string parameter to LambdaExtension > to include pieces of Perl code and make a version of the instance Pr for > printing perl code into a string you might be well on your way: > > module Main ( > main, > lam, app, ext, > trmA, trmB, trmC, trmD, trmE, trmF > ) where > > data LambdaExtension f = LExtend String f > > int_ :: Integer -> LambdaExtension Integer > int_ x = LExtend (show x) x > > add_ :: Num a => LambdaExtension (a -> a -> a) > add_ = LExtend "+" (+) > > mul_ :: Num a => LambdaExtension (a -> a -> a) > mul_ = LExtend "*" (*) > > leq_ :: Ord a => LambdaExtension (a -> a -> Bool) > leq_ = LExtend "<=" (<=) > > not_ :: LambdaExtension (Bool -> Bool) > not_ = LExtend "not" not > > class Calculus repr where > lam :: String -> (repr gl a -> repr gl b) -> repr gl (a->b) > def :: String -> repr gl a -> repr gl a > app :: repr gl (a->b) -> repr gl a -> repr gl b > fix :: String -> (repr gl a -> repr gl a) -> repr gl a > ext :: LambdaExtension e -> repr gl e > > -- R is the evaluator > data R gl t = R t deriving Show > unR (R x) = x > > instance Calculus R where > lam _ f = R (\z -> unR (f (R z))) > def _ f = R (unR f) > app e1 e2 = R ( (unR e1) (unR e2) ) > fix _ f = R (fx (unR . f. R)) where fx f = f (fx f) > ext (LExtend _ f) = R f > > -- Pr is the printer > > newtype Pr g a = Pr String > unPr (Pr f) = f > > instance Calculus Pr where > lam vN f = Pr(let var = Pr vN > body = unPr (f var) > in "\\"++ vN ++"->"++ body) > def dN f = Pr (dN ++ " = " ++ unPr f) > app e1 e2 = Pr(let e1b = unPr e1 > e2b = unPr e2 > in "(" ++ e1b ++ " " ++ e2b ++ ")") > fix vN f = Pr(let var = Pr vN > body = unPr (f var) > in "fix\\" ++ vN ++ "->" ++ body) > ext (LExtend s _) = Pr s > > > app2 f x y = (app (app f x) y) > app3 f x y z = (app (app2 f x y) z) > app4 f x y z w = (app (app3 f x y z) w) > > -- Sample Terms > trmA = lam "x" (\x -> lam "y" (\y -> app x y)) > trmB = lam "y" (\y -> app trmC y) > trmC = lam "c" (\c-> app2 (ext add_) c (ext (int_ 1))) > trmD = (ext (int_ 3)) > trmE = app trmC trmD > trmF = app trmC trmE > > main = do > putStrLn "Hello!" > putStrLn $ show $ unPr (trmA) > putStrLn $ show $ unPr (trmF) > putStrLn "**************" > > Cheers, > Ian > > On Tue, Apr 23, 2013 at 12:42 AM, C K Kashyap <ckkashyap(a)gmail.com> wrote: > >> Hi Ian, >> I have a couple of questions for you - >> >> 1. Could you explain why a lambda calculus like language embedded in >> Haskell would be useful - I ask this because, the way I understand, Haskell >> is already such a language - one could easily chose to restrict oneself to >> just function definition and application. Perhaps an example problem which >> can be expressed more clearly in your described embedded language but not >> in Haskell would help me understand your point of view better. >> >> 2. Have you considered using the state monad? >> >> I am personally attempting to figure out a way to embed Perl in Haskell - >> as in, describe Perl like code (but statically checked) in Haskell and then >> generate Perl that I could use to execute on server farms which run on old >> Linux kernels where I cannot run Haskell code. >> >> I totally get that "edge of understanding" feeling :) >> >> Regards, >> Kashyap >> >> >> >> >> On Mon, Apr 22, 2013 at 3:22 AM, Ian Bloom <ianmbloom(a)gmail.com> wrote: >> >>> Hi, >>> >>> I've been working on this problem for some time and I was hoping for >>> some feedback. I'm trying to implement an embedded language that can thread >>> a global structure through the evaluation of a term. >>> >>> A mini version of this language only includes three functions, lam, app >>> and ext (lambda, apply and extension respectively). The only difference >>> between this and other embedded languages is that terms embedded in an >>> extension have access to a global variable that is invisible to the terms >>> themselves. >>> >>> The writer of a term in this language can only access the global >>> variable by applying an extension. The writer extensions insures that the >>> effect of evaluation on the global variable is commutative and insures that >>> the effect of the global variable on terms is constant regardless of the >>> order of evaluation. >>> >>> For example the global variable could be a map with some sort of lazy >>> processing. An extension that queries the map for an element might cause a >>> change in the state of the map and return some information about an >>> element, but as long as the change in state are commutative and the same >>> information is returned about elements regardless of the order of >>> evaluation then the concept is safe. >>> >>> My motivation for experimenting with such a language comes from a belief >>> that certain complicated programs would be easier to express in such a >>> language and that there might be very useful code transformations that >>> could eventually be applied to such a language that would be possible >>> because of the constraints on the behavior of extensions. >>> >>> However I have yet to properly implement a language in Haskell and so I >>> decided to post what I have and look for comments. >>> >>> Basically the language takes a common form of embedded languages; a >>> lambda expression such as >>> >>> \x y->x y >>> >>> would have the form: >>> >>> lam (\x -> lam (\y -> app x y)) >>> >>> however in order to evaluate an expression the need to also apply it to >>> a global term: >>> >>> lam (\x -> lam (\y -> app x y)) global >>> >>> Ideally the result of evaluating this would be a (global', \x y-> x y), >>> a modified version of global paired with the term. So the type of the term: >>> >>> lam (\x -> lam (\y -> app x y)) is something like g -> (g, (a -> b) -> a >>> -> b) where g is the type of global. >>> >>> From that came the first idea of the types of the evaluator functions: >>> >>> lam :: ( (g->(g,a)) -> (g->(g,b)) )-> (g->(g, a->b)) >>> app :: (g->(g,a->b)) -> (g->(g, a)) -> (g->(g,b)) >>> >>> with some additional parenthesis for sake of clarity. Each sub-term has >>> the type g->(g,t) >>> >>> any function can be included as an extension as long as the function has >>> the type: >>> (g->(g,a)) -> (g->(g,b)) >>> >>> This seems to work well except that it seems to be impossible (as far as >>> I've tried) to construct a definition for the lam function that both fits >>> this type and properly passes the global through the entire evaluation. For >>> example it's easy to define app like this: >>> >>> app :: (g->(g,a->b)) -> (g->(g,a)) -> (g->(g,b)) >>> app = (\ eA eB -> \ g0 -> let (gB, fB) = eB g0 >>> in let (gA, fA) = eA gB >>> in (gA, fA fB) ) >>> >>> but so far the definition of lam has eluded me. This is the closest I've >>> come: >>> >>> lam :: ((g->(g,a)) -> (g->(g,b))) -> (g->(g,a->b)) >>> lam = (\ f -> \ g0 -> (g0, \x -> snd $ (f (\ gv->(gv,x))) g0 )) >>> >>> This fits the type but I fear this definition does not return the >>> properly modified version of global. >>> >>> I tried some other iterations of this idea. In one effort the first >>> argument of a function is extracted into the type of a term. So a term of >>> type a->b has the type (g->a->(g,b)). And a term of type a has the type >>> (g->((g, a)) such that: >>> >>> lam2 :: ((g->(g,a)) -> (g->(g,b))) -> (g->a->(g,b)) >>> lam2 = (\ f -> \ g x -> (f (\ gv -> (gv, x))) g) >>> >>> app2 :: (g->a->(g,b)) -> (g->(g,a)) -> (g->(g,b)) >>> app2 = (\ eA eB -> \ g0 -> let (gB, fB) = eB g0 >>> in eA gB fB ) >>> >>> This seems like a step in the right direction unfortunately because the >>> return type of lam is now (g->a->(g,b)) and not (g->(g->c)) we cannot type >>> the term lam (\x -> lam (\y -> app x y)). In other words this language can >>> only express unary and nullary functions. >>> Just to help clarify this for myself I created to addition functions >>> lam2Helper and app2Helper: >>> >>> lam2Helper :: (g->a->(g,b)) -> (g->(g,a->b)) >>> lam2Helper = (\f -> \g -> (g, \a -> snd $ f g a)) >>> app2Helper :: (g->(g,a->b)) -> (g->a->(g,b)) >>> app2Helper = (\f -> \g a-> let (g1, f1) = f g >>> in (g1, f1 a)) >>> >>> these allow me to create the term: >>> lam2 (\x -> lam2Helper $ lam2 (\y -> app2 (app2Helper x) y)) >>> >>> but just like the original definition of lam from my first try, there is >>> no way to construct lam2Helper without improperly passing the global as >>> I've done in my attempt. >>> >>> Finally on my third try I attempted to make every term have type >>> (g->a->(g,b) by allowing embedded nullary functions to have the type >>> (g->()->(g,t)) >>> >>> lam3 :: ((g->()->(g,a)) -> (g->()->(g,b))) -> (g->a->(g,b)) >>> lam3 = (\ f -> \ g x -> (f (\ gv () -> (gv, x))) g () ) >>> app3 :: (g->a->(g,b)) -> (g->()->(g,a)) -> (g->()->(g,b)) >>> app3 = (\ eA eB -> \ gz () -> let (gB, fB) = eB gz () >>> in eA gB fB ) >>> >>> This allows me to construct the term: >>> lam (\x -> lam (\y -> app x y)) >>> but only by throwing out important type information... >>> >>> A compilable example of this is available here: >>> http://hpaste.org/86273 >>> >>> And with source candy here: >>> http://hpaste.org/86274 >>> >>> My goal at this point is just to understand the problem better. I feel >>> I'm at the edge of my understanding of type systems and arity and I'm >>> unsure if what I want to do is possible in Haskell. My goal would >>> eventually be to construct a working prototype of such a language and to >>> construct a proof that it maintains the types of terms and that the global >>> variable is evaluated once by every subterm. >>> >>> I appreciate any insight, interest or help. >>> >>> Thanks, >>> Ian Bloom >>> ianmbloom(a)gmail.com >>> >>> >>> >>> >>> >>> _______________________________________________ >>> Haskell-Cafe mailing list >>> Haskell-Cafe(a)haskell.org >>> http://www.haskell.org/mailman/listinfo/haskell-cafe >>> >>> >> > > > -- > 718.755.5483 > http://ianbloom.com/ > -- 718.755.5483 http://ianbloom.com/

1 0

Automated Differentiation Type Question
by Dominic Steinitz 23 Apr '13

23 Apr '13

Can anyone tell me why I get a type error with testGrad2? What are my options? Clearly I would like to be able find the gradient of my cost function for different sets of observations. Thanks, Dominic. > {-# LANGUAGE NoMonomorphismRestriction #-} > > import Numeric.AD > > default() > > costFn :: Floating a => [a] -> [[a]] -> [a] -> a > costFn ys xss thetas = (/ (2*m)) $ sum $ map (^ (2 :: Int)) $ > zipWith (\y xs -> costFnAux y xs thetas) ys xss > where > m = fromIntegral $ length xss > costFnAux :: Floating a => a -> [a] -> [a] -> a > costFnAux y xs thetas = y - head thetas - sum (zipWith (*) xs (tail thetas)) > > ys :: Floating a => [a] > ys = [1.0, 2.0, 3.0] > > xss :: Floating a => [[a]] > xss = [[1.0], [2.0], [3.0]] > > thetas :: Floating a => [a] > thetas = [0.0, 1.0] > > test :: Floating a => a > test = costFn ys xss thetas > > testGrad0 = grad (costFn ys xss) > > testGrad1 :: Floating a => [a] -> [[a]] -> [a] -> [a] > testGrad1 ys xss = grad (costFn (undefined :: Floating a => [a]) (undefined :: Floating a => [[a]])) > > testGrad2 :: Floating a => [a] -> [[a]] -> [a] -> [a] > testGrad2 ys xss = grad (costFn ys xss) > [1 of 1] Compiling Main ( /Users/dom/Dropbox/Private/Whales/ADTypePuzzle.hs, interpreted ) > > /Users/dom/Dropbox/Private/Whales/ADTypePuzzle.hs:33:33: > Could not deduce (a ~ ad-3.4:Numeric.AD.Internal.Types.AD s a) > from the context (Floating a) > bound by the type signature for > testGrad2 :: Floating a => [a] -> [[a]] -> [a] -> [a] > at /Users/dom/Dropbox/Private/Whales/ADTypePuzzle.hs:32:14-53 > or from (Numeric.AD.Internal.Classes.Mode s) > bound by a type expected by the context: > Numeric.AD.Internal.Classes.Mode s => > [ad-3.4:Numeric.AD.Internal.Types.AD s a] > -> ad-3.4:Numeric.AD.Internal.Types.AD s a > at /Users/dom/Dropbox/Private/Whales/ADTypePuzzle.hs:33:20-39 > `a' is a rigid type variable bound by > the type signature for > testGrad2 :: Floating a => [a] -> [[a]] -> [a] -> [a] > at /Users/dom/Dropbox/Private/Whales/ADTypePuzzle.hs:32:14 > Expected type: [ad-3.4:Numeric.AD.Internal.Types.AD s a] > Actual type: [a] > In the first argument of `costFn', namely `ys' > In the first argument of `grad', namely `(costFn ys xss)' > In the expression: grad (costFn ys xss) > > /Users/dom/Dropbox/Private/Whales/ADTypePuzzle.hs:33:36: > Could not deduce (a ~ ad-3.4:Numeric.AD.Internal.Types.AD s a) > from the context (Floating a) > bound by the type signature for > testGrad2 :: Floating a => [a] -> [[a]] -> [a] -> [a] > at /Users/dom/Dropbox/Private/Whales/ADTypePuzzle.hs:32:14-53 > or from (Numeric.AD.Internal.Classes.Mode s) > bound by a type expected by the context: > Numeric.AD.Internal.Classes.Mode s => > [ad-3.4:Numeric.AD.Internal.Types.AD s a] > -> ad-3.4:Numeric.AD.Internal.Types.AD s a > at /Users/dom/Dropbox/Private/Whales/ADTypePuzzle.hs:33:20-39 > `a' is a rigid type variable bound by > the type signature for > testGrad2 :: Floating a => [a] -> [[a]] -> [a] -> [a] > at /Users/dom/Dropbox/Private/Whales/ADTypePuzzle.hs:32:14 > Expected type: [[ad-3.4:Numeric.AD.Internal.Types.AD s a]] > Actual type: [[a]] > In the second argument of `costFn', namely `xss' > In the first argument of `grad', namely `(costFn ys xss)' > In the expression: grad (costFn ys xss) > Failed, modules loaded: none.

1 1

Why are QuasiQuotes allowed in SafeHaskell?
by kudah 23 Apr '13

23 Apr '13

In GHC User's Guide, the reason to disable TemplateHaskell is as follows: > TemplateHaskell — Is particularly dangerous, as it can cause side > effects even at compilation time and can be used to access > constructors of abstract data types. Doesn't the same apply to quasi-quotes?

1 0

createProcess interferes with sockets?
by Evan Laforge 23 Apr '13

23 Apr '13

I've had a strange bug that's baffled me for a long time. I finally got serious about tracking it down, and managed to reduce it to a small program that exhibits the unexpected behaviour, namely that a createProcess seems to block writing to and closing a socket. Here's the example program: --- import Control.Monad import qualified Network import qualified System.Environment as Environment import qualified System.IO as IO import qualified System.Process as Process main :: IO () main = Network.withSocketsDo $ do args <- Environment.getArgs case args of ["server"] -> server ["client"] -> client _ -> error $ show args server :: IO () server = do socket <- Network.listenOn port forever $ do putStrLn "accept" (hdl, _host, _port) <- Network.accept socket msg <- IO.hGetLine hdl putStrLn $ "from client: " ++ show msg sleep putStrLn "send response" IO.hPutStr hdl "response" IO.hClose hdl client :: IO () client = do hdl <- Network.connectTo "localhost" port IO.hPutStr hdl "hi from client\n" IO.hFlush hdl resp <- IO.hGetContents hdl print resp port = Network.UnixSocket "port" sleep = Process.createProcess (Process.proc "sleep" ["5"]) --- You can test with: % ghc --make Test.hs && rm -f port && ./Test server then on another window: % ./Test client Since the createProcess is async (it doesn't wait on the pid), I expect the response to come back to the client immediately. And the server immediately says "send response" then "accept", so it doesn't get stuck on the sleep. But the client waits 5 seconds before displaying "response", so evidently even though the handle has already been written to and closed from the server, the client waits until the subprocess (of the server!) completes before getting the response. Comment out the "sleep" line and everything is fast. Can anyone else repro this? I'm guessing it has to do with the ghc IO manager, and the fork implied by a createProcess is causing it the socket close to block, but I haven't dug any deeper yet, in case this is a know issue, or I'm just doing something wrong. This is OS X 10.8.3. thanks!

3 6

Unbound: rebind and unrebind
by Eric Dobson 23 Apr '13

23 Apr '13

I am working at reimplementing the library Unbound to understand how it works. One issue I have come up with is that an equation that I thought held true doesn't. The equation is: Forall e::Rebind a b, e `aeq` (uncurry rebind . unrebind $ e) => True. That is that spliting the binding of a rebind and then adding it back should be the identity. The issue is that Rebind does not freshen its pattern variables on unrebind, because it assumes that a higher level unbind already did that if required. But I believe this is not sufficient as there is not necesarily a higher level Bind to be ubound as shown by this program: {-# LANGUAGE TemplateHaskell, UndecidableInstances, FlexibleInstances, MultiParamTypeClasses #-} module Main where import Unbound.LocallyNameless data Exp = Var (Name Exp) deriving Show $(derive [''Exp]) instance Alpha Exp instance Subst Exp Exp where isvar (Var x) = Just (SubstName x) x :: Name Exp x = string2Name "x" y :: Name Exp y = string2Name "y" rebindPass :: Alpha a => Rebind Exp a -> Rebind Exp a rebindPass = (uncurry rebind . unrebind) main :: IO () main = do let rebound = (rebind (Var y) (Embed (Var x))) print $ rebound let substed = subst x (Var y) rebound print $ substed print $ unrebind substed print $ rebindPass substed Which outputs: <<Var y>> {Var x} <<Var y>> {Var y} (Var y,{Var y}) <<Var y>> {Var 0@0} If the equation holds true then the second and fourth lines should be identical but they are not. Can someone explain why this is the correct behavior or if the implementation is incorrect?

2 2

ANN: ipopt-hs 0.0.0.0
by adam vogt 23 Apr '13

23 Apr '13

I'm pleased to announce the first release of ipopt-hs. This package is a binding to a software package for large-scale nonlinear optimization <https://projects.coin-or.org/Ipopt>. You can get it from hackage: http://hackage.haskell.org/package/ipopt-hs Or if the documentation doesn't build (since hackage probably doesn't have ipopt), check: http://code.haskell.org/~aavogt/ipopt-hs/dist/doc/html/ipopt-hs/Ipopt.html One useful feature is that derivatives needed for the optimization can be calculated by automatic differentiation, thanks to <http://hackage.haskell.org/package/ad>. Some of the caveats with this release: - has only been tested with one problem, and only on linux, ghc-7.6.2 - derivatives are computed and stored without taking advantage of the fact that they may be sparse - advanced functions in coin/IpStdCInterface.h such as SetIntermediateCallback are not included Cheers, Adam Vogt

1 0

Dynamic collections of wires with netwire?
by Kata 23 Apr '13

23 Apr '13

I'm using netwire to make a top-down shooter; the player can spawn projectiles by clicking, and projectiles will destroy themselves and whatever they hit on collisions. So the way I'm thinking of this is as a collection of wires, one for each projectile, that I can cast input events to; however, I'm not sure how to deal with the fact that the set of wires is dynamically changing, since you can't do projectileWires <- accum (++) [] -< newProjectiles projectileState <- multicast projectileWires -< () or whatever. Do I have to write the relevant code out by hand using stepWire/stepWireP, or is there a nicer way?

1 0

Implementing an embedded language that threads a global structure.
by Ian Bloom 23 Apr '13

23 Apr '13

Hi, I've been working on this problem for some time and I was hoping for some feedback. I'm trying to implement an embedded language that can thread a global structure through the evaluation of a term. A mini version of this language only includes three functions, lam, app and ext (lambda, apply and extension respectively). The only difference between this and other embedded languages is that terms embedded in an extension have access to a global variable that is invisible to the terms themselves. The writer of a term in this language can only access the global variable by applying an extension. The writer extensions insures that the effect of evaluation on the global variable is commutative and insures that the effect of the global variable on terms is constant regardless of the order of evaluation. For example the global variable could be a map with some sort of lazy processing. An extension that queries the map for an element might cause a change in the state of the map and return some information about an element, but as long as the change in state are commutative and the same information is returned about elements regardless of the order of evaluation then the concept is safe. My motivation for experimenting with such a language comes from a belief that certain complicated programs would be easier to express in such a language and that there might be very useful code transformations that could eventually be applied to such a language that would be possible because of the constraints on the behavior of extensions. However I have yet to properly implement a language in Haskell and so I decided to post what I have and look for comments. Basically the language takes a common form of embedded languages; a lambda expression such as \x y->x y would have the form: lam (\x -> lam (\y -> app x y)) however in order to evaluate an expression the need to also apply it to a global term: lam (\x -> lam (\y -> app x y)) global Ideally the result of evaluating this would be a (global', \x y-> x y), a modified version of global paired with the term. So the type of the term: lam (\x -> lam (\y -> app x y)) is something like g -> (g, (a -> b) -> a -> b) where g is the type of global. >From that came the first idea of the types of the evaluator functions: lam :: ( (g->(g,a)) -> (g->(g,b)) )-> (g->(g, a->b)) app :: (g->(g,a->b)) -> (g->(g, a)) -> (g->(g,b)) with some additional parenthesis for sake of clarity. Each sub-term has the type g->(g,t) any function can be included as an extension as long as the function has the type: (g->(g,a)) -> (g->(g,b)) This seems to work well except that it seems to be impossible (as far as I've tried) to construct a definition for the lam function that both fits this type and properly passes the global through the entire evaluation. For example it's easy to define app like this: app :: (g->(g,a->b)) -> (g->(g,a)) -> (g->(g,b)) app = (\ eA eB -> \ g0 -> let (gB, fB) = eB g0 in let (gA, fA) = eA gB in (gA, fA fB) ) but so far the definition of lam has eluded me. This is the closest I've come: lam :: ((g->(g,a)) -> (g->(g,b))) -> (g->(g,a->b)) lam = (\ f -> \ g0 -> (g0, \x -> snd $ (f (\ gv->(gv,x))) g0 )) This fits the type but I fear this definition does not return the properly modified version of global. I tried some other iterations of this idea. In one effort the first argument of a function is extracted into the type of a term. So a term of type a->b has the type (g->a->(g,b)). And a term of type a has the type (g->((g, a)) such that: lam2 :: ((g->(g,a)) -> (g->(g,b))) -> (g->a->(g,b)) lam2 = (\ f -> \ g x -> (f (\ gv -> (gv, x))) g) app2 :: (g->a->(g,b)) -> (g->(g,a)) -> (g->(g,b)) app2 = (\ eA eB -> \ g0 -> let (gB, fB) = eB g0 in eA gB fB ) This seems like a step in the right direction unfortunately because the return type of lam is now (g->a->(g,b)) and not (g->(g->c)) we cannot type the term lam (\x -> lam (\y -> app x y)). In other words this language can only express unary and nullary functions. Just to help clarify this for myself I created to addition functions lam2Helper and app2Helper: lam2Helper :: (g->a->(g,b)) -> (g->(g,a->b)) lam2Helper = (\f -> \g -> (g, \a -> snd $ f g a)) app2Helper :: (g->(g,a->b)) -> (g->a->(g,b)) app2Helper = (\f -> \g a-> let (g1, f1) = f g in (g1, f1 a)) these allow me to create the term: lam2 (\x -> lam2Helper $ lam2 (\y -> app2 (app2Helper x) y)) but just like the original definition of lam from my first try, there is no way to construct lam2Helper without improperly passing the global as I've done in my attempt. Finally on my third try I attempted to make every term have type (g->a->(g,b) by allowing embedded nullary functions to have the type (g->()->(g,t)) lam3 :: ((g->()->(g,a)) -> (g->()->(g,b))) -> (g->a->(g,b)) lam3 = (\ f -> \ g x -> (f (\ gv () -> (gv, x))) g () ) app3 :: (g->a->(g,b)) -> (g->()->(g,a)) -> (g->()->(g,b)) app3 = (\ eA eB -> \ gz () -> let (gB, fB) = eB gz () in eA gB fB ) This allows me to construct the term: lam (\x -> lam (\y -> app x y)) but only by throwing out important type information... A compilable example of this is available here: http://hpaste.org/86273 And with source candy here: http://hpaste.org/86274 My goal at this point is just to understand the problem better. I feel I'm at the edge of my understanding of type systems and arity and I'm unsure if what I want to do is possible in Haskell. My goal would eventually be to construct a working prototype of such a language and to construct a proof that it maintains the types of terms and that the global variable is evaluated once by every subterm. I appreciate any insight, interest or help. Thanks, Ian Bloom ianmbloom(a)gmail.com

2 1

17th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES
by Simon Thompson 22 Apr '13

22 Apr '13

[Apologies if you receive multiple copies of this CFP] ======================================================= CALL FOR PAPERS 17th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES Brasília, Distrito Federal, Brazil September 29th to October 4th, 2013 http://cbsoft2013.unb.br/en/sblp-en ======================================================== IMPORTANT DATES Paper abstract submission (15 lines): May 6th, 2013 (extended deadline) Full paper submission: May 10th, 2013 (extended deadline) Notification of acceptance: June 7, 2013 Final papers due: June 28th, 2013 INVITED SPEAKERS * Tim Harris, Oracle Labs * More TBA INTRODUCTION The 17th Brazilian Symposium on Programming Languages, SBLP 2013, will be held in Brasília, Brazil, on September 29th to October 4th, 2013. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. The symposium will be part of the 4th Brazilian Conference on Software: Theory and Practice, CBSoft 2013,http://cbsoft2013.cic.unb.br/, which will host four traditional, well-established symposia: * XXVII Brazilian Symposium on Software Engineering (SBES) * XVII Brazilian Symposium on Programming Languages (SBLP) * XVI Brazilian Symposium on Formal Methods (SBMF) * VII Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) SBLP 2013 invites authors to contribute with technical papers related (but not limited) to: * Program generation and transformation, including domain-specific languages and model-driven development in the context of programming languages. * Programming paradigms and styles, including functional, object-oriented, aspect-oriented, scripting languages, real-time, service-oriented, multithreaded, parallel, and distributed programming. * Formal semantics and theoretical foundations, including denotational, operational, algebraic and categorical. * Program analysis and verification, including type systems, static analysis and abstract interpretation. * Programming language design and implementation, including new programming models, programming language environments, compilation and interpretation techniques. SUBMISSIONS Contributions should be written in Portuguese or English. We solicit papers that should fall into one of two different categories: full papers, with at most 15 pages, or short papers, with at most 5 pages. Full papers submitted in English will be published in a volume of Lecture Notes in Computer Science (LNCS), by Springer. For this reason, all papers must be prepared using the LNCS template, available at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0. We encourage the submission of short papers reporting on partial results of on-going master dissertations or doctoral theses. All accepted papers will be published in the conference proceedings distributed in a digital media by the CBSOFT organizers. Submissions should be done using SBLP 2013 installation of the EasyChair conference mangement system athttp://www.easychair.org/conferences/?conf=sblp2013. As in previous editions, a journal special issue, with selected papers from accepted contributions, is anticipated. Selected papers from 2003 to 2008 editions of SBLP were published in special issues of the Journal of Universal Computer Science, by Springer. The post-proceedings of SBLP from 2009 to 2012, also with selected papers from the conference proceedings, are being edited as special issues of Science of Computer Programming, published by Elsevier. CBSOFT CHAIRS Genaina Nunes Rodrigues, UnB Rodrigo Bonifácio, UnB Diego Aranha, UnB PROGRAMME CHAIRS André Rauber Du Bois, UFPel Phil Trinder, Glasgow University PROGRAMME COMMITTEE Alberto Pardo, Univ. de La Republica Alex Garcia, IME Alvaro Freitas Moreira, UFRGS André Rauber Du Bois, UFPel (co-chair) Andre Santos, UFPE Carlos Camarao, UFMG Christiano Braga, UFF Edwin Brady, University of St. Andrews Fernando Castor Filho, UFPE Fernando Quintão Pereira, UFMG Francisco Heron de Carvalho Junior, UFC Hans-Wofgang Loidl, Heriot-Watt University Jeremy Singer, Glasgow University Joao Saraiva, Universidade do Minho João F. Ferreira, Teesside University Lucilia Figueiredo, UFOP Luis Soares Barbosa, Univ. do Minho Manuel António Martins, Univ. de Aveiro Marcelo A. Maia, UFU Marcello Bonsangue, Leiden Univ/CWI Marcelo d'Amorim, UFPE Marco Tulio Valente, UFMG Mariza A. S. Bigonha, UFMG Martin A. Musicante, UFRN Noemi Rodriguez, PUC-Rio Peter Mosses, Swansea University Phil Trinder, Glasgow University (co-chair) Qiu Zongyang, Beijing University Rafael Dueire Lins, UFPE Renato Cerqueira, PUC-Rio Ricardo Massa, UFPE Roberto S. Bigonha, UFMG Roberto Ierusalimschy, PUC-Rio Sandro Rigo, UNICAMP Sergio Soares, UFPE Simon Thompson, Univ. of Kent Varmo Vene, Univ. de Tartu Simon Thompson | Professor of Logic and Computation School of Computing | University of Kent | Canterbury, CT2 7NF, UK s.j.thompson(a)kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt

1 0