In case you haven't seen it already, you might be interested in Inform
(http://inform7.com/), which is a DSL for interactive fiction (aka "text
adventures") using natural language.
Cheers,
Adam
On 19/05/13 21:27, Matthew O'Connor wrote:
> Hello all,
>
> I recognize this isn't directly a Haskel
What works best for me is to actually merge the type-nats branch into a local
checkout of master; as opposed to checking out the type-nats branch.
Though you will usually have to do some (minor) conflict resolution.
-- Christiaan
On May 17, 2013, at 11:13 PM, Takayuki Muranushi wrote:
> Hey th
The type-nats branch *should* simply work all by itself. (You may need to check
out a corresponding branch on some other repos, though.)
Iavor would you care to comment?
Simon
Microsoft Research Limited (company number 03369488) is registered in England
and Wales
Registered office 21 Station R
All,
Since I'm stuck on a coding problem and can't figure out how to proceed,
I decided to call for help.
I'm unable to get some code to typecheck, so maybe I'm missing something
obvious on the implementation side, or more likely the design is
completely wrong.
Here's the idea: I have some code
:t runMemLog (runTransitionT $ demo 1)
runMemLog (runTransitionT $ demo 1)
:: MonadLog (MemLog a) () => Log a -> ((), [Command ()])
That means, that "foo", if you manage to compile it, would have type MonadLog
(MemLog a) () => ((), [Command ()]). That means that in each call for foo it
would b
Hi Nicolas,
Your design doesn't look too unreasonable, though I haven't looked at in
detail. I do have a quick observation regarding the implementation that
I hope might help. Your gist defines
> class MonadLog m a where
> getEntry :: Index -> m (Entry a)
>
> instance MonadLog (MemLog a) a
and
This sounds like something you might use Grammatical Framework for,
http://www.grammaticalframework.org/doc/tutorial/gf-tutorial.html
- jeremy
On Sun, May 19, 2013 at 3:27 PM, Matthew O'Connor
wrote:
> Hello all,
>
> I recognize this isn't directly a Haskell-related question, but as I'd like
>
All,
The following code results in a compilation error (I tried GHC 7.4.1 & a
7.7.20130430 build):
{-# LANGUAGE TypeFamilies,
GeneralizedNewtypeDeriving,
StandaloneDeriving #-}
module Main where
import Control.Applicative
import Control.Monad.RWS
data C = C
data E = E
Miguel,
On Mon, 2013-05-20 at 16:38 +0400, Miguel Mitrofanov wrote:
> :t runMemLog (runTransitionT $ demo 1)
> runMemLog (runTransitionT $ demo 1)
> :: MonadLog (MemLog a) () => Log a -> ((), [Command ()])
>
> That means, that "foo", if you manage to compile it, would have type MonadLog
> (Mem
Adam,
On Mon, 2013-05-20 at 13:37 +0100, Adam Gundry wrote:
> Hi Nicolas,
>
> Your design doesn't look too unreasonable, though I haven't looked at in
> detail. I do have a quick observation regarding the implementation that
> I hope might help. Your gist defines
>
> > class MonadLog m a where
>
The mistake might be on my side, since I expected the following to work
(but it doesn't, most likely for good reason, I didn't read any
TypeFamilies papers yet):
{-# LANGUAGE GeneralizedNewtypeDeriving, TypeFamilies #-}
module Main where
import Control.Monad.State
data S = S T
data T = T
type
Hi cafe!
I have released ghc-mod v2.0.1. From this version, ghc-mod provides
the ghc-mod library in addition to the ghc-mod command:
http://hackage.haskell.org/package/ghc-mod
http://mew.org/~kazu/proj/ghc-mod/en/
Enjoy!
--Kazu
___
Ha
On 05/19/2013 10:10 PM, Tillmann Rendel wrote:
>
> This is not easily possible. If you could just put the constraint into
> the instance, there would be a problem when youc all toXy in a
> polymorphic context, where a is not known. Example:
>
> class XyConv a where
> toXy :: a b -> [Xy b]
>
Awesome, even with Cabal API!
Just one note: The "emacs" link on the left is "not found".
On Tue 21 May 2013 10:31:01 SGT, Kazu Yamamoto (山本和彦) wrote:
> Hi cafe!
>
> I have released ghc-mod v2.0.1. From this version, ghc-mod provides
> the ghc-mod library in addition to the ghc-mod command:
>
>
Hi Niklas,
> Just one note: The "emacs" link on the left is "not found".
Fixed. Thank you.
--Kazu
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 21/05/13 04:15, Kazu Yamamoto () wrote:
> Hi Niklas,
>
>> Just one note: The "emacs" link on the left is "not found".
>
> Fixed. Thank you.
>
> --Kazu
>
> ___ Haskell-Cafe
> mailing list Haskell-Ca
Thank you everyone!
Iavor have kindly fixed the branch and now I can build it.
2013/5/20 Simon Peyton-Jones :
> The type-nats branch *should* simply work all by itself. (You may need to
> check out a corresponding branch on some other repos, though.)
>
> Iavor would you care to comment?
>
> Simon
Hi,
> While we're on topic of ghc-mod, why does the emacs front-end give
> `Cannot guess type' when the point is on the very first letter of the
> function?
>
> foo 5 = 2
> ^
> foo x = 3
>
> Is this a feature or a bug? It does fine on the second (or any) letter
> after that point.
I think this
Type classes are the approach to constrain type variables, to bound
polymorphism and limit the set of types the variables can be
instantiated with. If we have two type variables to constrain,
multi-parameter type classes are the natural answer then. Let's take
this solution and see where it leads
19 matches
Mail list logo
