Use operator precedence: infixr . I don't remember exactly how it is
used, but it should do the trick and let you get rid of the
parentheses.
2009/12/29 Jonathan Fischoff :
> Thirst will work I think. I tested a demo and the only problem I can see is
> the unwieldiness of the syntax, i.e
> testThi
Thirst will work I think. I tested a demo and the only problem I can see is
the unwieldiness of the syntax, i.e
testThirst = f `Cons` (g `Cons` (h `Cons` Nil))
Maybe there is a way to sugar up the syntax to get rid of the parentheses?
On Mon, Dec 28, 2009 at 7:43 PM, Antoine Latter wrote:
> On
forward Id a = a
forward (ICons f _ r) a = forward r (f a)
backward Id a = a
backward (ICons _ f r) a = f (backward r a)
2009/12/29 Eugene Kirpichov :
> data IList a b where
> Id :: IList a a
> ICons :: (a -> b) -> (b -> a) -> IList b c -> IList a c
>
> 2009/12/29 Jonathan Fischoff :
>> Thi
data IList a b where
Id :: IList a a
ICons :: (a -> b) -> (b -> a) -> IList b c -> IList a c
2009/12/29 Jonathan Fischoff :
> This seems like exactly what I want, but there are two problems: I can't
> access the paper and it requires Generic Haskell. I'm just too much of newb
> to jump int
This seems like exactly what I want, but there are two problems: I can't
access the paper and it requires Generic Haskell. I'm just too much of newb
to jump into generic Haskell :).
On Mon, Dec 28, 2009 at 7:41 PM, Dan Weston wrote:
> This might be pertinent:
>
> Alimarine et al, "There and Back
On Mon, Dec 28, 2009 at 10:32 PM, Jonathan Fischoff
wrote:
> Hi,
> I would to create a list of tuples (or something similar) of invertible
> functions
> [((a -> b), (b -> a)), ((b -> c), (c -> b)),
> Such that I could call
> forward invertibleFuctionList domainValue = ? -- composite all the f
Do you need to be able to extract the intermediate types?
If not, then the only observable value for your function list is the
composition (forward/backward), and you can easily represent it like
this:
data Inv a b = Inv { forward :: (a -> b), backward :: (b -> a) }
nil :: Inv a a
nll = Inv id i
This might be pertinent:
Alimarine et al, "There and Back Again: Arrows for Invertible Programming"
http://www.cs.ru.nl/A.vanWeelden/bi-arrows/
Jonathan Fischoff wrote:
Hi,
I would to create a list of tuples (or something similar) of invertible
functions
[((a -> b), (b -> a)), ((b -> c), (c
Hi,
I would to create a list of tuples (or something similar) of invertible
functions
[((a -> b), (b -> a)), ((b -> c), (c -> b)),
Such that I could call
forward invertibleFuctionList domainValue = ? -- composite all the functions
backward invertibleFuctionList rangeValue =
forward (re
