I happily released two other numeric packages based on the comfort-array
types. These are bindings to fast numeric linear programming solvers:
https://hackage.haskell.org/package/comfort-glpk
https://hackage.haskell.org/package/coinor-clp
The first one is (another) binding to GLPK and the
On Fri, 8 May 2020, Ben Gamari wrote:
Henning Thielemann writes:
We are talking about the HasCallStack stack traces, yes?
How is their emission addressed by extending exceptions with stack
traces?
HasCallStack stack traces are one type of backtrace that the proposal
supports. However
On Fri, 8 May 2020, Ben Gamari wrote:
We can debate whether partial functions like `fromJust` should exist; however,
the fact of the matter is that they do exist and they are used.
That's not my point. I say: fromJust on Nothing is a programming error,
ok. We must debug this. HasCallStack
On Fri, 8 May 2020, Niklas Hambüchen wrote:
What are "unintended exceptions"?
What is an example of an "unintended exception"?
A recent example from my production server:
hPutBuf: resource vanished (Broken pipe)
Ok, I lookup the Haddock comment of hPutBuf and it says:
"This operation
On Fri, 8 May 2020, Niklas Hambüchen wrote:
On 5/8/20 7:32 PM, Henning Thielemann wrote:
Can someone please give me examples where current state lacks
* Currently stack traces are not printed, so users cannot forward them
to the developer, even if both the users and the developers would
On Fri, 8 May 2020, Niklas Hambüchen wrote:
On 5/8/20 5:37 PM, Henning Thielemann wrote:
a callstack is not useful for a user.
Call stacks have been very useful to me as a user of non-Haskell tools
so far, because they are excellent for attaching to bug reports and
usually led
There seem to be multiple beginnings of the discussion. What is currently
discussed?
If someone says "exceptions" and "backtrace" in one sentence, I suspect
like many times before, that again confusion of the concepts of exceptions
and errors is ahead. Errors already support call stacks.
I like two announce two of my packages:
1. comfort-array
http://hackage.haskell.org/package/comfort-array
It provides Boxed and Storable arrays with very liberal shape definitions.
You may use ranges of indices like in 'array' or zero-based indexing like
in 'repa', but you can also use
So far only announced on Haskell-Cafe, but not the Haskell mailing list:
http://mail.haskell.org/haskell-cafe/2018-March/128730.html
___
Haskell mailing list
Haskell@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell
On Sun, 22 May 2016, Jeremy . wrote:
1. If the compiler encounters a term f a, and there is more than one definition
for f in scope (after following all of
the usual rules for qualified imports);
2. And exactly one of these definitions matches the type of a (or the expected
type of f if
I like to propose the following way to warn about instances that are
unwanted by some programmers. First step is to mark the instances at their
definition site like so:
{-# WARN_INSTANCE tuple #-}
instance Foldable ((,) a) where ...
{-# WARN_INSTANCE tuple #-}
instance Functor ((,) a) where
On Mon, 11 Jan 2016, Richard Eisenberg wrote:
On Jan 9, 2016, at 6:44 PM, Henning Thielemann <lemm...@henning-thielemann.de>
wrote:
instance (Natural n) => Num.Integer (Un n) where
type Repr (Un _n) = Unary
GHC-7.6.3 and GHC-7.4.2 complain:
Type indexes must match class
GHC-8.0 emits several new warnings of this kind:
Defined but not used: type variable ‘x’
for declarations like
type instance Snd x y = y
Enthusiastically, I started to replace unused type function arguments by
underscores, only to find out that older GHC versions do not accept that.
On Sat, 9 Jan 2016, Carter Schonwald wrote:
Have you tried _x instead?
Ah, this solves the problem! Almost.
I have an instance like this one:
instance (Natural n) => Num.Integer (Un n) where
type Repr (Un _n) = Unary
GHC-7.6.3 and GHC-7.4.2 complain:
Type indexes must match class
How about just using alloca, peek and poke - like C guys do in order to
get C's speed?
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/glasgow-haskell-users
On Mon, 7 Dec 2015, Patrick Redmond wrote:
I'd also like to show support and participate in building this out if work is
needed. Contact me when/if that happens!
haskell@haskell.org is an announcement list. Please continue discussion in
haskell-cafe etc.
On Tue, 3 Nov 2015, Evan Laforge wrote:
I can work around by putting underscores on field names I haven't used
yet, but it's a hassle to go edit them when I want to use them.
I do it this way and I do not consider it a work-around. The underscore is
just the shortest way to say that a
On Mon, 16 Mar 2015, KC wrote:
There has been discussion on matrix operations and cache thrashing; does
management think using Haskell would
lead to cash thrashing?
What could change management's mind?
Unfortunately I don't understand the question, but in any case I think
that better
On Wed, 4 Mar 2015, K Sai Anirudh wrote:
Hello,
I tried to solve simple constraint satisfaction problem. This is my code
http://pastebin.com/VAaRYSEA ; .
This gives solution for present list of domains, but when I change the domain
of 'd' in the list 'ld' then I
get error. I think the
On Tue, 10 Feb 2015, Tyson Whitehead wrote:
I came across something that seems a bit strange to me. Here is a
simplified version (the original was trying to move from a lens
ReifiedFold to a lens-action ReifiedMonadicFold)
You are on Haskell@haskell.org here. Could you please move to
Right after the announcement of the latest version of Accelerate I like
to announce an application build using that framework:
patch-image assembles a big image from several overlapping parts.
http://hackage.haskell.org/package/patch-image
Now, let me extract the beginning of the docs:
://sim.mathematik.uni-halle.de:8080/hal9/
Anmeldeschluss ist 2014-06-11. Frühes Anmelden sichert Plätze in den
beliebtesten Tutorien!
Viele Grüße
Henning Thielemann
--
Read the whole topic here: Haskell Art:
http://lurk.org/r/topic/6sT8bnDabQ3yRxF8plXb9z
To leave Haskell Art, email haskell-...@group.lurk.org
://sim.mathematik.uni-halle.de:8080/hal9/
Anmeldeschluss ist 2014-06-11. Frühes Anmelden sichert Plätze in den
beliebtesten Tutorien!
Viele Grüße
Henning Thielemann
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
In case I did not announce it before - I wrote a set of two small
programs that upload videos to YouTube. It is useful in two situations:
1. Upload a list of videos with metadata fetched from a spreadsheet.
2. Upload from a remote machine without a graphical browser.
Am 17.03.2014 15:33, schrieb Henning Thielemann:
Am 17.03.2014 10:22, schrieb Simon Marlow:
package. Perhaps you have a copy of that module on the search path
somewhere, or inside the alsa-seq package?
This would confirm how I understood the linker message. Then I guess
that compiling all
die Beitragsvorschläge als PDF-Dokument bis zum
27. April 2014
an
hal-commit...@iba-cg.de
Wir werden Ihnen bis zum 9. Mai mitteilen, ob wir Ihren Beitrag in das
Programm aufnehmen.
Für das Organisationsteam
Henning Thielemann
___
Haskell
Hi Iavor,
Am 19.03.2014 22:27, schrieb Iavor Diatchki:
I see two separate issues that show in what you describe, so it might be
useful to discuss them separately:
Thank you and Richard Eisenberg for the detailed explanations. For now,
I have just fooled GHC by unsafeCoerceing dictionaries
Am 17.03.2014 10:22, schrieb Simon Marlow:
On 11/03/2014 22:11, Henning Thielemann wrote:
I am trying to understand the following linker message. I have started
GHCi, loaded a program and try to run it:
Main main
...
Loading package poll-0.0 ... linking ... done.
Loading package alsa-seq
Am 16.03.2014 09:40, schrieb Christiaan Baaij:
To answer the second question (under the assumption that you want
phantom-type style Vectors and not GADT-style):
That works, someNatVal was the missing piece.
Now the natural next question is how to perform type-level induction on
Nat. This
Am 16.03.2014 11:29, schrieb Henning Thielemann:
Since the unary natural number kind so ubiquituous in examples, is there
a recommended module to import it from, which also contains the
injectivity magic of FromNat1? I cannot see it in:
http://hackage.haskell.org/package/base-4.7.0.0/candidate
Am 16.03.2014 09:40, schrieb Christiaan Baaij:
To answer the second question (under the assumption that you want
phantom-type style Vectors and not GADT-style):
Now I like to define non-empty vectors. The phantom parameter for the
length shall refer to the actual vector length, not to
Am 16.03.2014 13:48, schrieb Dan Frumin:
This is just a wild guess, but is there a possibility that (1+n) will
produce less complaints than (n+1)?
unfortunately no
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
Am 16.03.2014 14:35, schrieb Carter Schonwald:
You can't with type lits. The solver can only decide concrete values :(
I hoped that with type-level natural numbers all my dreams would become
true. :-)
I'd be also happy if I could manually provide the proof for 1=n+1 and
more complicated
Am 16.03.2014 20:02, schrieb Carter Schonwald:
respectfully,
The current typeLits story for nats is kinda a fuster cluck to put it
politely . We have type lits but we cant use them (well, we can't
compute on them, which is the same thing).
For the past 2 years, every ghc release cycle, I first
I want to import Nat and type-level (=) from GHC.TypeLits:
import GHC.TypeLits (Nat, (=))
Nat is found this way, but (=) is not:
Module ‘GHC.TypeLits’ does not export ‘(=)’
What is the trick?
The doc only shows the anonymous import:
Am 15.03.2014 18:13, schrieb adam vogt:
http://www.haskell.org/ghc/docs/7.8.1-rc2/html/users_guide/syntax-extns.html#explicit-namespaces
is the trick
Great, this works!
Now I run into the next problem: How can I convert a type-level natural
number into a data-level number? The Trac-Wiki
Am 15.03.2014 19:17, schrieb Erik Hesselink:
I think most of the singletons stuff has been moved to the
'singletons' package [0].
Yes, that's it. It means that all Nat related functionality in
'singletons' can be implemented using GHC.TypeLits - interesting.
Using the library I succeeded
-Treffen HaL-9
Wann: Freitag, 2014-06-20
Wo: Institut für Informatik an der Martin-Luther-Universität
in Halle an der Saale
Der offizielle Aufruf zum Einreichen von Beiträgen folgt demnächst.
Mit besten Grüßen
Henning Thielemann
___
Haskell mailing list
With GHC-7.8 I get lots of warnings like
src/Foo/Bar.hs:215:6: Warning:
Rule foo may never fire
because ‘bar’ might inline first
Probable fix: add an INLINE[n] or NOINLINE[n] pragma on ‘bar’
So far I thought that rewrite RULES always have precedence to INLINE.
Has this changed? I
Am 14.03.2014 18:05, schrieb Simon Peyton Jones:
You may think they are fragile, but not as fragile as saying nothing and hoping
for the best, which is *super*-fragile. You can't rely on rules to take
priority, because the rule only fires if it matches, and it may only match if
some other
I am trying to understand the following linker message. I have started
GHCi, loaded a program and try to run it:
Main main
...
Loading package poll-0.0 ... linking ... done.
Loading package alsa-seq-0.6.0.3 ... can't load .so/.DLL for:
The first announcement this year:
The 'unicode' package contains functions for construction of various
characters like:
* block graphic elements
* frame elements
* fractions
* subscript and superscript characters
http://hackage.haskell.org/package/unicode
The package is simple Haskell
Hi all,
it's again Advent time and I took the opportunity to program another song
for you. Those who liked last year's songs [1,2,3] may also be interested
in the new one:
http://www.youtube.com/watch?v=0EQCgi5qa3E Alta trinita beata
It employs the great Haskell live sequencer and a
In Richard Bird's Functional Pearls in Algorithm Design there is chapter
10 Removing duplicates which is about a fast and sorting variant of
'nub'. After reading the introduction of the chapter I answered mentally
Set.toAscList . Set.fromList - next chapter please. However after the
On Wed, 4 Sep 2013, Johan Tibell wrote:
* GHCi support. It's now much easier to use ghci when developing your
packages, especially if those packages require preprocessors (e.g.
hsc2hs).
That's a great feature! How can I configure Cabal to start ghci with
certain options? I like to enable
I have prepared the package set-cover for solving exact set cover
problems. It includes example programs for solving Sudoku, 8 Queens, Soma
Cube, Tetris Cube, Cube of L's, and Logika's Baumeister puzzle. Please
refer to these examples for learning how the library works.
The solver is
On Tue, 27 Aug 2013, John Lato wrote:
[1] Most people are physically incapable of reading documents that explain why
what they want to do won't
work. Even if people did read the documentation, I suspect that the people
most in need of the information
would be the least likely to understand
The problem of refinement of type classes annoys me from time to time
when I work on the NumericPrelude. It is an experimental type class
hierarchy for mathematical types. Sometimes a new data type T shall be
implemented and it turns out that you can implement only a part of all
methods of
If you use
$ cabal install --constraint=array installed
then cabal-install is forced to use the installed version of array. If a
package conflicts with this version, then it will report the conflicting
packages.
___
Haskell-Cafe mailing list
Am 10.08.2013 21:48, schrieb Austin Seipp:
Henning,
Thanks for the report. I'm currently investigating this, and think it
should be possible to keep all of the old URLs intact.
Thank you! This would be really really great!
___
Haskell-Cafe mailing
Recently I found that links from Google search results to archive
Haskell-Cafe messages are invalid. The messages are still there, but got
a different number. E.g. the search result says:
http://www.haskell.org/pipermail/haskell-cafe/2011-February/089455.html
But the message is at
On Wed, 7 Aug 2013, Edward Z. Yang wrote:
I am pleased to announce that Issue 22 of the Monad Reader is now available.
http://themonadreader.files.wordpress.com/2013/08/issue22.pdf
Issue 22 consists of the following two articles:
* Generalized Algebraic Data Types in Haskell by Anton
On Sun, 21 Jul 2013, Sergey Mironov wrote:
Hi, I have a Path problem when installing threepenny-gui from Hackage.
Probably somtething trivial.
I have written a small script cabal-upload that tries to compile a package
before uploading it to Hackage. That helps to assert that all required
The page
http://www.haskell.org/ghc/download
refers to directories for the nightly builds, that are actually empty:
http://www.haskell.org/ghc/dist/current/dist/
http://www.haskell.org/ghc/dist/stable/dist/
:-(
___
Glasgow-haskell-users
On Wed, 15 May 2013, 7stud wrote:
Well, my question does not meet the standards for a question at stackoverflow:
(I am a haskell beginner)
Then you might want to post your question to haskell-beginners mailing
list.
Is one solution more efficient than the other? I believe my solution is
Can someone enlighten me about the origin of the term referential
transparency? I can lookup the definition of referential transparency
in the functional programming sense in the Haskell Wiki and I can lookup
the meaning of reference and transparency in a dictionary, but I don't
know why
Recently I needed to define a class with a restricted set of instances.
After some failed attempts I looked into the DataKinds extension and in
Giving Haskell a Promotion I found the example of a new kind Nat for
type level peano numbers. However the interesting part of a complete case
On Tue, 2 Apr 2013, Daniel Peebles wrote:
It seems very similar to Ryan Ingram's post a few years back
(pre-TypeNats):
http://www.haskell.org/pipermail/haskell-cafe/2009-June/062690.html
The main difference is that he introduces the knowledge about zero vs. suc as
a constraint, and you
On Fri, 29 Mar 2013, Niklas Hambüchen wrote:
(This is a slightly detailed email. If you are the maintainer of one of
the packages benchmarked here, you might want to read it though.)
Could you please put your experiences the Wiki? This would help others to
choose a package.
On Fri, 29 Mar 2013, Louis Wasserman wrote:
Bearing in mind that I haven't looked at this in several years...
Why did you switch from queuelike to pqueue?
Because I liked the API better?
Could you put the code up somewhere manageable (repo)?
I had it up on darcs, but since that's not
On Fri, 29 Mar 2013, Niklas Hambüchen wrote:
On 29/03/13 20:14, Henning Thielemann wrote:
Was it on code.haskell.org? Then it might have been moved to a non-web
directory after the last attack 2011.
Does that mean the repo is still there without web access
I assume that.
or gone
On Tue, 22 Jan 2013, John Wiegley wrote:
Use 'onlyIf' with AndM and AndMT to guard later statements, which are only
evaluated if every preceding 'onlyIf' evaluates to True. For example:
foo :: AndM Int
foo = do onlyIf (True == True)
return 100
onlyIf (True ==
On Mon, 21 Jan 2013, mip...@meta.ua wrote:
The program looks like this:
--***
factorial :: Int-Int
factorial n = product [1..n]
main = do
print $ factorial 50
--***
And that yields 0 (no errors). Is it a bug or feature? :)
This question is
On Thu, 3 Jan 2013, Емануела Моллова wrote:
Hello! :)
I think you should better post your question to haskell-c...@haskell.org.
Then I put this script
import qualified Data.Array.Repa as R
:m +Data.Array.Repa
Z
into the file file.hs,
This is GHCi syntax, but it is not a valid Haskell
On Thu, 3 Jan 2013, Емануела Моллова wrote:
Hello! :)
I think you should better post your question to haskell-cafe@haskell.org.
Then I put this script
import qualified Data.Array.Repa as R
:m +Data.Array.Repa
Z
into the file file.hs,
This is GHCi syntax, but it is not a valid Haskell
Hi Haskellers,
since it is Advent time you might like to listen to a song that I programmed
and performed with the Haskell Live-Sequencer [1]:
http://www.youtube.com/watch?v=O5k0wUh0lj8
and you might want to check the Live-Sequencer, too. The Live-Sequencer allows
to compose songs in
On Sat, 1 Dec 2012, Gábor Lehel wrote:
On Fri, Nov 30, 2012 at 11:06 PM, Nate Soares n...@so8r.es wrote:
+1. I agree generally with Gabor's points -- GHC is in the drivers seat. But
at some point we should take a look at all the things GHC has made that did
pay off and that are good and make
On Fri, 23 Nov 2012, José Romildo Malaquias wrote:
When experimenting with the module LLVM.Core in GHCi on my gentoo linux
system, I have got a fatal error:
$ ghci
GHCi, version 7.6.1: http://www.haskell.org/ghc/ :? for help
Loading package ghc-prim ... linking ... done.
Loading package
On Wed, 14 Nov 2012, Jean-Philippe Bernardy wrote:
On Tue, Nov 13, 2012 at 11:39 PM, Andreas Abel andreas.a...@ifi.lmu.de wrote:
On 13.11.12 11:13 PM, Jean-Philippe Bernardy wrote:
Blacklisting equals releasing a bugfix.
Not quite.
I propose to *define* blacklisting as
On Tue, 13 Nov 2012, Bas van Dijk wrote:
On 13 November 2012 17:27, Andreas Abel andreas.a...@ifi.lmu.de wrote:
This calls for a means of blacklisting broken or malicious packages.
cabal update
should also pull a blacklist of packages that will never be selected by
cabal install (except
On Thu, 11 Oct 2012, Mikhail Vorozhtsov wrote:
I'm pleased to announce my new little library, data-dword[1]. It provides
Template Haskell utilities for defining binary word data types from low and
high halves, e.g.
data Word96 = Word96 Word32 Word64 -- strictness is configurable
data Int96
Hi Joachim,
On Wed, 5 Oct 2012, Joachim Breitner wrote:
On Wed, 3 Oct 2012, Henning Thielemann wrote:
I wondered whether there is a brilliant typing technique that makes
Data.Map.! a total function. That is, is it possible to give (!) a
type, such that m!k expects a proof that the key k
I wondered whether there is a brilliant typing technique that makes
Data.Map.! a total function. That is, is it possible to give (!) a type,
such that m!k expects a proof that the key k is actually present in the
dictionary m? How can I provide the proof that k is in m?
Same question for
I want to vote, too.
I am ok with all of
case of
\case
\of
\case of
For me single arguments are enough. We already have this restriction for 'case'
and I can work around it simply by wrapping arguments in pairs temporarily (cf.
curry $ \case ...).
I vote against LambdaIf, since
On Thu, 19 Jul 2012, Herbert Valerio Riedel wrote:
Recently, I was a bit suprised that GHC didn't warn about useless
`where` definitions such as the following when using `-Wall` (and I
couldn't find a respective warning GHC CLI flag which would have enabled
reporting a warning in this case --
On Mon, 16 Jul 2012, Felipe Almeida Lessa wrote:
On Mon, Jul 16, 2012 at 12:33 PM, Vo Minh Thu not...@gmail.com wrote:
It seems like the infered type (and thus bounds) is different when you
force the result to be a Color or not. Just give explicit type
signatures and conversion functions.
On Mon, 9 Jul 2012, gdwe...@iue.edu wrote:
data Type = TypeVar TypeVarName -- named type variable
| TypeCons TypeConsName [Type] -- constructed type
deriving (Eq)
Do you still think my type checker would be useful to you,
or to Haskellers generally?
I see. Then
On Thu, 5 Jul 2012, gdwe...@iue.edu wrote:
Sifflet and sifflet-lib 2.0.0.0, now available on Hackage!
This version introduces a type checker and partial support
for higher order functions in Sifflet, the visual, functional
programming language and support system for students learning
about
On Sat, 7 Jul 2012, rocon...@theorem.ca wrote:
On Fri, 6 Jul 2012, Dan Burton wrote:
Following the announcement of lens-family, I'm pleased to announce
lens-family-th 0.1.0.0, a Template Haskell library supplying macros to
generate
lens-family lenses for fields of data types declared with
On Sat, 7 Jul 2012, Dan Burton wrote:
Could the documentation be an argument of mkLenses?
Does haddock run on the template-haskell expanded code?
TH macros must have type Q [Dec]. Dec has no constructor for comments, with the
exception of pragmas. This
might be feature request worthy,
On Tue, 19 Jun 2012, Jacques Carette wrote:
Its main novel features are:
* introduces a number of /testing strategies/ and /strategy combinators/
* introduces a variety of test execution methods
* guarantees uniform sampling (at each rank) for the random strategy
* guarantees both uniqueness
Just for the record:
I compiled with GHC and got the linker error:
/usr/bin/ld: dist/build/.../Module.dyn_o: relocation R_X86_64_PC32 against
undefined symbol `..._xyz1_closure' can not be used when making a shared
object; recompile with -fPIC
Problem was that I forgot to declare Module
On Mon, 11 Jun 2012, Simon Peyton-Jones wrote:
Thanks. I've linked to it from
http://www.haskell.org/haskellwiki/GHC/Type_families#Frequently_asked_questions
Thank you! I already added this and another link to a new See also
section below. Which one shall we maintain?
On Thu, 7 Jun 2012, Simon Peyton-Jones wrote:
Very useful! Maybe worth turning into a page on the Haskell wiki?
I created one:
http://www.haskell.org/haskellwiki/Functional_dependencies_vs._type_families
___
Haskell-Cafe mailing list
finden Sie hier:
http://iba-cg.de/hal7.html
und die Anmeldung da:
http://sim.mathematik.uni-halle.de:8080/hal7/
Bitte melden Sie sich bis zum 4. Juli an.
Wir freuen uns auf Ihr zahlreiches Erscheinen!
für das Programmkomitee
Henning Thielemann
finden Sie hier:
http://iba-cg.de/hal7.html
und die Anmeldung da:
http://sim.mathematik.uni-halle.de:8080/hal7/
Bitte melden Sie sich bis zum 4. Juli an.
Wir freuen uns auf Ihr zahlreiches Erscheinen!
für das Programmkomitee
Henning Thielemann
Hi all,
when I reported a typechecker performance problem related to functional
dependencies
http://hackage.haskell.org/trac/ghc/ticket/5970
I promised to try to convert from functional dependencies to type
families.
Thus I converted my code and the llvm package to type-families:
On Wed, 9 May 2012, Angus Comber wrote:
I am trying to create a factorial function in GHC. I am following the
online learnyouahaskell.com book (specifically types-and-typeclasses
page).
Bear in mind this is my day 1 of learning Haskell.
Then beginn...@haskell.org might be a better place to
Software.
Schicken Sie Beitragsvorschläge als PDF-Dokument bis zum
21.05.2012
per Mail an hal-committee at iba-cg punkt de oder an ein Mitglied des
Programmkomitees.
Programmkomitee
* Henning Thielemann - Univ. Halle (Vorsitzender),
* Petra Hofstedt - BTU Cottbus,
* Alf Richter - iba CG
On Mon, 23 Apr 2012, Henning Thielemann wrote:
Call for submissions and Save the date
for our local Haskell Workshop in Halle/Saale, Germany.
Tutorials, talks, demonstrations ... everything welcome.
Workshop language is German (mainly), and English (by request).
Submission deadline: May
Software.
Schicken Sie Beitragsvorschläge als PDF-Dokument bis zum
21.05.2012
per Mail an hal-committee at iba-cg punkt de oder an ein Mitglied des
Programmkomitees.
Programmkomitee
* Henning Thielemann - Univ. Halle (Vorsitzender),
* Petra Hofstedt - BTU Cottbus,
* Alf Richter - iba CG
On Fri, 13 Apr 2012, Ben Millwood wrote:
But I never liked using CPP: it completely defeats haskell-src-exts
and hence things like SourceGraph, and anyway it's not designed for
Haskell and doesn't at all understand its structure, or fit with its
syntax. With a little thought, I wondered if
moved to haskell-cafe
On Mon, 5 Mar 2012, Barney Hilken wrote:
Is there any deep reason why I can't write a polymorphic type in a context? I
think the record update problem can be (sort of) solved if you could write:
class Has r Rev (forall a. [a] - [a]) = HRClass r where
I have uploaded three packages to Hackage that shall simplify maintaining
cabal packages under darcs revision control. They simplify tasks like
uploading packages after some tests, cabal version handling, compiling
multiple local packages in the right order, replacing identifiers in
multiple
On Fri, 10 Feb 2012, Duncan Coutts wrote:
Would you mind giving me a breif explanation of the compiling
multiple local packages in the right order feature? I'd like to
understand what is missing in cabal-install in this respect.
Currently with cabal-install you can say:
cabal install ./a ./b
On Fri, 10 Feb 2012, Duncan Coutts wrote:
I wonder if you have any suggestions for UI changes/improvements for
cabal-install for working with related sets of local packages
(something it's fairly weak on at the moment). Are there things in
cabal-sort you think we should just lift directly into
On Fri, 10 Feb 2012, Henning Thielemann wrote:
On Fri, 10 Feb 2012, Duncan Coutts wrote:
I wonder if you have any suggestions for UI changes/improvements for
cabal-install for working with related sets of local packages
(something it's fairly weak on at the moment). Are there things in
cabal
On Sun, 29 Jan 2012, Simon Meier wrote:
I'm currently using Neil Mitchell's cmdargs package [1]. How does your
package compare to that?
Last time I checked cmdargs it was not referential transparent. Is
multiarg better in this respect?
___
On Wed, 18 Jan 2012, Nathan Collins wrote:
- Portland is a very popular US city, known for beer, bikes, music,
and street food:
http://en.wikipedia.org/wiki/Portland_Oregon (wikipedia is blacked out today)
Maybe it is only a JavaScript trick. In Firefox (with JavaScript) I see
the complete
On Wed, 18 Jan 2012, Andrew Butterfield wrote:
Just add ?banner=none to the url if you really have to read the page
Maybe the intention was to demonstrate that censorship (in this case
self-censorship) is mostly a problem for average users but not for
advanced users.
1 - 100 of 2035 matches
Mail list logo
