#2146: Decomposition rule for equalities is too weak in case of higher-kinded
type
families
-+--
Reporter: chak | Owner: chak
Type: bug | Status: new
#2418: desugaring type function application to constraint makes bug disappear
-+--
Reporter: claus| Owner:
Type: bug | Status: closed
Priority:
#2418: desugaring type function application to constraint makes bug disappear
-+--
Reporter: claus| Owner:
Type: bug | Status: closed
Priority:
#650: Improve interaction between mutable arrays and GC
--+-
Reporter: simonmar | Owner:
Type: run-time performance bug | Status: new
Priority:
#2146: Decomposition rule for equalities is too weak in case of higher-kinded
type
families
-+--
Reporter: chak | Owner: chak
Type: bug | Status: new
#2146: Decomposition rule for equalities is too weak in case of higher-kinded
type
families
-+--
Reporter: chak | Owner: chak
Type: bug | Status: new
#2429: error building full dll name to be loaded in ghci
+---
Reporter: jvl | Owner:
Type: bug | Status: new
Priority: normal | Component: Driver
Version: 6.8.2
#2418: desugaring type function application to constraint makes bug disappear
-+--
Reporter: claus| Owner:
Type: bug | Status: closed
Priority:
#2146: Decomposition rule for equalities is too weak in case of higher-kinded
type
families
-+--
Reporter: chak | Owner: chak
Type: bug | Status: new
#1900: Type families with class constraints: type-checker loops
-+--
Reporter: h.holtmann | Owner: chak
Type: bug | Status: closed
Priority: normal
I am pleased to announce Uniplate 1.2, available from Hackage:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/uniplate
Description
===
Uniplate is a library for reducing boilerplate code, by performing
generic traversals. For example, given a data type with a Uniplate
Simon Marlow wrote:
My main concern here is that the remit for the new list is not clear
enough. I can see a potential need for two lists:
* a list for discussion related to teaching Haskell;
* a list devoted to those learning Haskell, with a less research-
oriented feel than
On 08/07/2008, Benjamin L. Russell [EMAIL PROTECTED] wrote:
If you are interested in logic programming in a language with some
similarity to Haskell, you might also wish to investigate the strongly
typed logic programming language Godel (see
http://www.cs.bris.ac.uk/~bowers/goedel.html).
Hi,
I have just been asked for usage of timer in haskell. Which I did not
remember clearly. So I ask the search engine.
In Hoogle: timer
In Google: haskell timer
Hoogle does not search the general web, just the libraries supplied
with GHC. A quick scan of the first few Google results
I myselft don't understand why GHCi doesn't accept the type it
infered as an explicit signature ...
I think it has to do with the following:
Looking at the type errors, they seem to indicate that the type
checker is being general and does not assume the |From| and |To|
relations are between
I prefer Bruno's approach, though. It allows meta-level type-checking
of expressions and there's the possibility of closing the extension
with a wrapper:
(References: Generics as a Library and his PhD thesis)
- GADT as a type class (or encode the type as it's fold):
class Exp e where
lit
On Tue, 8 Jul 2008, Galchin, Vasili wrote:
[EMAIL PROTECTED]:~/Desktop/hsql-1.7$ runhaskell Setup.lhs clean
cleaning...
[EMAIL PROTECTED]:~/Desktop/hsql-1.7$ runhaskell Setup.lhs configure --user
--prefix=$HOME
Configuring hsql-1.7...
Warning: No license-file field.
[EMAIL
On Tue, 8 Jul 2008 16:59:00 +1000, David Overton
[EMAIL PROTECTED] wrote:
On 08/07/2008, Benjamin L. Russell [EMAIL PROTECTED] wrote:
If you are interested in logic programming in a language with some
similarity to Haskell, you might also wish to investigate the strongly
typed logic
On Tue, 8 Jul 2008 16:59:00 +1000, David Overton
[EMAIL PROTECTED] wrote:
Also, see my recent attempts at (constraint) logic programming in Haskell:
http://overtond.blogspot.com/2008/07/pre.html
http://overtond.blogspot.com/2008/07/haskell-sudoku-solver-using-finite.html
Whoops! Sorry, I rushed
Can some one explain what the !a does in this:
data
Color3http://cvs.haskell.org/Hugs/pages/libraries/OpenGL/Graphics-Rendering-OpenGL-GL-VertexSpec.html#t%3AColor3a
=
Color3http://cvs.haskell.org/Hugs/pages/libraries/OpenGL/Graphics-Rendering-OpenGL-GL-VertexSpec.html#v%3AColor3!a
!a !a
Daryoush Mehrtash wrote:
Can some one explain what the !a does in this:
data Color3
http://cvs.haskell.org/Hugs/pages/libraries/OpenGL/Graphics-Rendering-OpenGL-GL-VertexSpec.html#t%3AColor3
a = Color3
The Haskell typechecker contains a nice example of a unifier for
freely generated terms. My focus is on equational unification, but
thanks anyway.
John
On Sun, Jul 6, 2008 at 10:38 PM, Don Stewart [EMAIL PROTECTED] wrote:
ramsdell0:
I'd like to write an obviously correct implementation of a
thanks for everyone's help -- it seems the simplest solution is to use
the Typeable class, existential types and type-safe cast.
Cheers,
Dave
On Sun, Jul 6, 2008 at 9:18 PM, Don Stewart [EMAIL PROTECTED] wrote:
princedpw:
Hi all,
SML conveniently contains the type exn which is an instance of
On Tue, Jul 08, 2008 at 08:24:45AM -0400, John D. Ramsdell wrote:
The Haskell typechecker contains a nice example of a unifier for
freely generated terms. My focus is on equational unification, but
thanks anyway.
Are you aware of Term Rewriting and all That? It describes how to do
associative
2008/7/8 Galchin, Vasili [EMAIL PROTECTED]:
Database/HSQL.hsc:66:7:
Could not find module `System.Time':
it is a member of package old-time-1.0.0.0, which is hidden
[EMAIL PROTECTED]:~/Desktop/hsql-1.7$
I have a global ghc installation plus a local one off my user directory. In
On Tue, 2008-07-08 at 06:39 +0100, Dominic Steinitz wrote:
I have a solution so this is for interest only.
It is not normally the case that two monads compose to give another
monad. Monad transformers capture when this is possible. However, when
there is a swap function satisfying some
A simple example to help understand the difference
data NoStrict a = NoStrict a deriving Show
data Strict a = Strict !a deriving Show
ns1 = NoStrict ()
ns2 = NoStrict undefined
ns3 = undefined
nf1 (NoStrict ()) = ok
nf2 (NoStrict _) = ok
s1 = Strict ()
s2 = Strict undefined
s3 =
Daryoush Mehrtash wrote:
Can some one explain what the !a does in this:
data Color3 a = Color3 !a !a !a
Shameless plug: http://www.vex.net/~trebla/haskell/strict-field.xhtml
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Thanks to everybody who responded!
Vasili
On Tue, Jul 8, 2008 at 7:40 AM, Denis Bueno [EMAIL PROTECTED] wrote:
2008/7/8 Galchin, Vasili [EMAIL PROTECTED]:
Database/HSQL.hsc:66:7:
Could not find module `System.Time':
it is a member of package old-time-1.0.0.0, which is hidden
Ryan Ingram wrote:
To answer the question in the subject:
From Simple unification-based type inference for GADTs,
Peyton-Jones, et al. ICFP 2006.
http://research.microsoft.com/users/simonpj/papers/gadt/
Instead of user-specified type, we use the briefer term rigid
type to describe a type
On Tue, 8 Jul 2008, Ben Franksen wrote:
Wow. Such a short and clear explanation. I have been wondering for some time
what exactly this 'rigid' means... Please somebody who understands stuff
like that better than me put it on some wiki page. It's obviously a FAQ.
BTW, do we have a FAQ page? I
On 08/07/2008, Benjamin L. Russell [EMAIL PROTECTED] wrote:
Do you know of any logic programming languages with strong typing and
modules that have GUI-based REPL's, similar to WinHugs, available?
You might want to look at Visual Prolog (http://www.visual-prolog.com/). It
is strongly typed
Hi,
It seems that the qualified import syntax is a bit awkward. At the
moment, its common to see:
import qualified Data.Map as M
import Data.Map(Map)
i.e. import a module, give it an alias (M), and put some things in the
current namespace (Map).
Another way some people sometimes do it is:
Is Haskell still used (in industry as well ?) to write (V)HDL code to
program FPGAs and create circuits on chips?
The Chalmers Lava homepage tells abouta Xilinx version which should be
merged in soon. But on the xilinx homepage there was no reference to
neither Lava nor haskell..
I'm thinking
How about using + and - prefixes instead of implicit and explicit clause?
\begin{code}
module T where
import Data.Map (Map, (\\))
import qualified Data.Map as M hiding (lookup)
f :: (Ord k) = Map k v - k - Map k v
f m k = m \\ M.singleton k (m M.! k)
\end{code}
the following import command
On Tue, Jul 8, 2008 at 5:43 PM, Marc Weber [EMAIL PROTECTED] wrote:
Is Haskell still used (in industry as well ?) to write (V)HDL code to
program FPGAs and create circuits on chips?
Indeed! Galois maintains a language called Cryptol. Almost all tools for
this language, including an FPGA
We'll soon (before september, hopefully) relase a deep-embedded
version of ForSyDe[1] which, among other things, has a VHDL backend
(with specific support for Altera's Modelsim and Quartus).
ForSyDe's new implementation is internally based upon the same concept
as Lava (Observable Sharing).
Hello,
It seems to me by its name that forall denotes a logical universal
quantifier. In any case, hsql-1.7/Database/HSQL/Types.hs uses forall at
line #134. I got a nasty build so I added {-# LANGUAGE
ExistentialQuantification #-} at the top of the module. Now I get the
following a coupleof
Quoth [EMAIL PROTECTED]:
Quoth Neil Mitchell [EMAIL PROTECTED]:
[...]
Both of these require two imports, yet feel like they should require
only one. It seems as though the import syntax more naturally promotes
security (preventing access to some functions), rather than
namespacing.
I
On Wed, 9 Jul 2008, Neil Mitchell wrote:
It seems that the qualified import syntax is a bit awkward. At the
moment, its common to see:
import qualified Data.Map as M
import Data.Map(Map)
i.e. import a module, give it an alias (M), and put some things in the
current namespace (Map).
Another
On Tue, 8 Jul 2008, [EMAIL PROTECTED] wrote:
How about using + and - prefixes instead of implicit and explicit clause?
Hiding of identifiers is the wrong way round. It fails if new identifiers
are added to a module interface:
http://www.haskell.org/haskellwiki/Import_modules_properly
41 matches
Mail list logo
