Search Results

Search found 18 results on 1 pages for 'typeclass'.

Page 1/1 | 1 

• Why isn't there a typeclass for functions?

  - by Steve314

  I already tried this on Reddit, but there's no sign of a response - maybe it's the wrong place, maybe I'm too impatient. Anyway... In a learning problem I've been messing around with, I realised I needed a typeclass for functions with operations for applying, composing etc. Reasons... It can be convenient to treat a representation of a function…

  Read the article

• Haskell typeclass

  - by Geoff

  I have a Haskell typeclass question. I can't munge the syntax to get this (seemingly reasonable) program to compile under GHC. import Control.Concurrent.MVar blah1 :: [a] -> IO ([a]) blah1 = return blah2 :: [a] -> IO (MVar [a]) blah2 = newMVar class Blah b where blah :: [a] -> IO (b a) instance Blah [] where blah = blah1 --…

  Read the article

• Adding class constraints to typeclass instance

  - by BleuM937

  I'm trying to implement the Cantor Pairing Function, as an instance of a generic Pair typeclass, as so: module Pair (Pair, CantorPair) where -- Pair interface class Pair p where pi :: a -> a -> p a k :: p a -> a l :: p a -> a -- Wrapper for typing newtype CantorPair a = P { unP :: a } -- Assume two functions with…

  Read the article

• Typeclass instances for unnamed types in Scala

  - by ncreep

  How would one encode the following constraint in Scala (pseudocode)? def foo(x: T forSome { type T has a Numeric[T] instance in scope }) = { val n= implicitly[...] // obtain the Numeric instance for x n.negate(x) // and use it with x } In words: I need a type class instance for my input argument, but I don't care about the argument's…

  Read the article

• Demangling typeclass functions in GHC profiler output

  - by Paul Kuliniewicz

  When profiling a Haskell program written in GHC, the names of typeclass functions are mangled in the .prof file to distinguish one instance's implementations of them from another. How can I demangle these names to find out which type's instance it is? For example, suppose I have the following program, where types Fast and Slow both…

  Read the article

• Haskell data serialization of some data implementing a common type class

  - by Evan

  Let's start with the following data A = A String deriving Show data B = B String deriving Show class X a where spooge :: a -> Q [ Some implementations of X for A and B ] Now let's say we have custom implementations of show and read, named show' and read' respectively which utilize Show as a serialization mechanism. I want…

  Read the article

• Instantiate type variable in Haskell

  - by danportin

  EDIT: Solved. I was unware that enabling a language extension in the source file did not enable the language extension in GHCi. The solution was to :set FlexibleContexts in GHCi. I recently discovered that type declarations in classes and instances in Haskell are Horn clauses. So I encoded the arithmetic operations from The Art of…

  Read the article

• "Ambigous type variable" error when defining custom "read" function

  - by Tener

  While trying to compile the following code, which is enhanced version of read build on readMay from Safe package. readI :: (Typeable a, Read a) => String -> a readI str = case readMay str of Just x -> x Nothing -> error ("Prelude.read failed, expected type: " ++ …

  Read the article

• Inherit from Type class of .Net

  - by Miguel Angelo

  Is there any point at all on inheriting from Type class in .Net? i.e. What could be the meaning of doing so? I am asking this because of this text in MSDN documentation: Notes to Inheritors When you inherit from Type, you must override the following members... list of members. MSDN doc for Type:…

  Read the article

• How can I make a Maybe-Transformer MaybeT into an instance of MonadWriter?

  - by martingw

  I am trying to build a MaybeT-Transformer Monad, based on the example in the Real World Haskell, Chapter Monad Transformers: data MaybeT m a = MaybeT { runMT :: m (Maybe a) } instance (Monad m) => Monad (MaybeT m) where m >>= f = MaybeT $ do a <- runMT m case a of …

  Read the article

• Haskell's TypeClasses and Go's Interfaces

  - by Jeremy Jose

  What are the similarities and the differences between Haskell's TypeClasses and Go's Interfaces? What are the relative merits / demerits of the two approaches?

  Read the article

• Appropriate uses of Monad `fail` vs. MonadPlus `mzero`

  - by jberryman

  This is a question that has come up several times for me in the design code, especially libraries. There seems to be some interest in it so I thought it might make a good community wiki. The fail method in Monad is considered by some to be a wart; a somewhat arbitrary addition to the class that does not…

  Read the article

• Haskell: Defaulting constraints to type

  - by yairchu

  Consider this example: applyKTimes :: Integral i => i -> (a -> a) -> a -> a applyKTimes 0 _ x = x applyKTimes k f x = applyKTimes (k-1) f (f x) applyThrice :: (a -> a) -> a -> a applyThrice = applyKTimes 3 The 3 in applyThrice is defaulted by GHC to an Integer as shown when…

  Read the article

• What's the "|" for in a Haskell class definition?

  - by martingw

  I can't figure out what the "| m - w"-part means in a class definition like this: class (Monoid w, Monad m) = MonadWriter w m | m - w What additional information does this add to the class definition?

  Read the article

• Linking/Combining Type Classes in Haskell

  - by thegravian

  Say I have two type classes defined as follows that are identical in function but different in names: class Monad m where (>>=) :: m a -> (a -> m b) -> m b return :: a -> m a class PhantomMonad p where pbind :: p a -> (a -> p b) -> p b preturn :: a…

  Read the article

• functional dependencies vs type families

  - by mhwombat

  I'm developing a framework for running experiments with artificial life, and I'm trying to use type families instead of functional dependencies. Type families seems to be the preferred approach among Haskellers, but I've run into a situation where functional dependencies seem like a better fit. Am…

  Read the article

• Haskell: Problems with overloading: Interpreter can´t tell which + to use

  - by Ben

  Hi, I want to make functions Double - Double an instance of the Num typeclass. I want to define the sum of two functions as sum of their images. So I wrote instance Num Function where f + g = (\ x - (f x) + (g x)) Here the compiler complains he can´t tell whether I´m using Prelude.+ or…

  Read the article

• Haskell: how to get through 'no instance for' ?

  - by artemave

  I am learning Haskell. I am on the 8th chapter of this book. The main thing I've learned so far is that Haskell is very unfriendly to me and it bites my ass where possible. Moreover... Heck! Enough mourning, to business. Here is the code: module GlobRegex ( globToRegex, matchesGlob )…

  Read the article

1