-
| boun...@haskell.org] On Behalf Of p.k.f.holzensp...@utwente.nl
| Sent: 23 July 2014 17:07
| To: glasgow-haskell-users@haskell.org
| Subject: GhcPlugin-writing and finding things
|
| Dear GHC-ers,
|
| I'm working on a plugin for GHC that should help compile the library
| with which this plugin
-Original Message-
From: xicheko...@gmail.com [mailto:xicheko...@gmail.com] On Behalf Of
Andrew Farmer
Sent: woensdag 23 juli 2014 19:22
To: Holzenspies, P.K.F. (EWI)
Cc: glasgow-haskell-users@haskell.org
Subject: Re: GhcPlugin-writing and finding things
Have you considered using
Dear GHC-ers,
I'm working on a plugin for GHC that should help compile the library with which
this plugin is to ship. What this plugin does is traverse the CoreProgram(s) to
find things of types defined in my library and optimizes them. I have worked
out how to find things, but I was wondering
Have you considered using HERMIT for this? I think this is a rough
approximation of what you are trying to do (using HERMIT):
import HERMIT.Plugin
import HERMIT.Dictionary
plugin = hermitPlugin $ \ opts - firstPhase $ run $ tryR $ innermostR
$ promoteBindR compileFooBindR
compileFooBindR ::
.
John
On Fri, Apr 25, 2014 at 6:17 AM, Simon Marlow marlo...@gmail.com wrote:
I want to propose a simple change to the -i flag for finding source files.
The problem we often have is that when you're writing code for a library
that lives deep in the module hierarchy, you end up needing a deep
for finding source
files.
The problem we often have is that when you're writing code for a library
that lives deep in the module hierarchy, you end up needing a deep
directory
structure, e.g.
src/
Graphics/
UI/
Gtk/
Button.hs
Label.hs
On Fri, May 30, 2014 at 02:00:38AM -0700, John Meacham wrote:
JHC has the feature that
Graphics.UI.GTK.Button can live in any of:
Graphics/UI/GTK/Button.hs
Graphics/UI/GTK.Button.hs
Graphics/UI.GTK.Button.hs
Graphics.UI.GTK.Button.hs
It lets you have deep module hiarchies without deep
On 2014-05-30 at 11:00:38 +0200, John Meacham wrote:
JHC has the feature that
Graphics.UI.GTK.Button can live in any of:
Graphics/UI/GTK/Button.hs
Graphics/UI/GTK.Button.hs
Graphics/UI.GTK.Button.hs
Graphics.UI.GTK.Button.hs
Just wondering: Does JHC warn if, for instance,
On Fri, May 30, 2014 at 2:45 AM, Daniel Trstenjak
daniel.trsten...@gmail.com wrote:
Well, it might not be terribly surprising in itself, but we
just have quite complex systems and the not terribly surprising
things just accumulate and then it might get surprising somewhere.
I really prefer
No, it would be trivial to make it do so, but it would be ususual and
contrary to how ghc does things.
For instance, ghc doesnt warn if both Foo.lhs and Foo.hs exist or
src/Foo.hs and bar/Foo.hs when both -isrc and -ibar are specified on
the command line.
John
On Fri, May 30, 2014 at 3:10
On 2014-05-30 11:00, John Meacham wrote:
JHC has the feature that
Graphics.UI.GTK.Button can live in any of:
Graphics/UI/GTK/Button.hs
Graphics/UI/GTK.Button.hs
Graphics/UI.GTK.Button.hs
Graphics.UI.GTK.Button.hs
It lets you have deep module hiarchies without deep directory
On 30/05/14 11:10, John Meacham wrote:
On Fri, May 30, 2014 at 2:45 AM, Daniel Trstenjak
daniel.trsten...@gmail.com wrote:
Well, it might not be terribly surprising in itself, but we
just have quite complex systems and the not terribly surprising
things just accumulate and then it might get
Thanks for all the feedback. Clearly opinion is divided on this one,
so I'll sit on it and think it through some more.
My assumption was that with what Felipe Lessa suggested, this proposal
is pretty much obsolete. As I understand it, it provides the same
benefits, the major difference being
On 25/04/2014 17:57, Roman Cheplyaka wrote:
* Edward Kmett ekm...@gmail.com [2014-04-25 11:22:46-0400]
+1 from me. I have a lot of projects that suffer with 4 levels of vacuous
subdirectories just for this.
In theory cabal could support this on older GHC versions by copying all of the
files to
On 25/04/2014 21:26, Malcolm Wallace wrote:
On 25 Apr 2014, at 14:17, Simon Marlow wrote:
The problem we often have is that when you're writing code for a library that
lives deep in the module hierarchy, you end up needing a deep directory
structure, where the top few layers are all empty.
Thanks for all the feedback. Clearly opinion is divided on this one, so
I'll sit on it and think it through some more.
Cheers,
Simon
On 25/04/2014 14:17, Simon Marlow wrote:
I want to propose a simple change to the -i flag for finding source
files. The problem we often have is that when
* Simon Marlow marlo...@gmail.com [2014-04-28 09:26:23+0100]
On 25/04/2014 17:57, Roman Cheplyaka wrote:
* Edward Kmett ekm...@gmail.com [2014-04-25 11:22:46-0400]
+1 from me. I have a lot of projects that suffer with 4 levels of vacuous
subdirectories just for this.
In theory cabal could
On 28 April 2014 18:40, Roman Cheplyaka r...@ro-che.info wrote:
* Simon Marlow marlo...@gmail.com [2014-04-28 09:26:23+0100]
No, the idea would be to use hs-source-dirs like this:
hs-source-dirs: A.B.C=src
Cabal just passes this in a -i option to GHC, so it almost Just Works,
Coming from Scala where I can basically structure my directory sources the
way I want I got a bit frustrated by Haskell rigidity here.
So definitely a +1, and I agree cabal support is quite important.
OTOH, I don't think Haskell should go in the way of allowing 'any'
structure (like scala), but
2014-04-25 22:26 GMT+02:00 Malcolm Wallace malcolm.wall...@me.com:
[...] The feature seems like a very low power-to-weight ratio, so -1 from me.
-1 from me, for the same reasons.
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
On 2014-04-25 15:17, Simon Marlow wrote:
I want to propose a simple change to the -i flag for finding source
files. The problem we often have is that when you're writing code for a
library that lives deep in the module hierarchy, you end up needing a
deep directory structure, e.g.
-1, too
Hi,
I want to propose a simple change to the -i flag for finding source
files. The problem we often have is that when you're writing code
for a library that lives deep in the module hierarchy, you end up
needing a deep directory structure, e.g.
+1 from me.
The deep file system hierarchies
I want to propose a simple change to the -i flag for finding source
files. The problem we often have is that when you're writing code for a
library that lives deep in the module hierarchy, you end up needing a
deep directory structure, e.g.
src/
Graphics/
UI/
Gtk
Hi Simon,
I don't quite know what I should think about this addition. Currently
you can be sure that modules correspond to directories. After this
change you can't be sure anymore.
I don't navigate source trees that much by 'cd'-ing into single
directories, so deep hierarchies don't bother me
, Simon Marlow marlo...@gmail.com wrote:
I want to propose a simple change to the -i flag for finding source files.
The problem we often have is that when you're writing code for a library
that lives deep in the module hierarchy, you end up needing a deep
directory structure, e.g.
src
On Fri, Apr 25, 2014 at 10:16 AM, Eric Seidel gridaph...@gmail.com wrote:
The main con here is that there's an increased risk of
module name-clashes, but GHC already solves this with the PackageImports
extension.
IMO almost any use of PackageImports indicates a severe design flaw
somewhere.
On Fri, Apr 25, 2014 at 07:16:03AM -0700, Eric Seidel wrote:
An alternative (and I think this has also been proposed before) is to simply
drop the Graphics.UI header from the module hierarchy. The main con here is
that there's an increased risk of module name-clashes, but GHC already solves
.
On Apr 25, 2014, at 13:17, Simon Marlow marlo...@gmail.com wrote:
I want to propose a simple change to the -i flag for finding source files.
The problem we often have is that when you're writing code for a library that
lives deep in the module hierarchy, you end up needing a deep directory
On Fri, Apr 25, 2014 at 4:46 PM, Daniel Trstenjak
daniel.trsten...@gmail.com wrote:
On Fri, Apr 25, 2014 at 07:16:03AM -0700, Eric Seidel wrote:
An alternative (and I think this has also been proposed before) is to simply
drop the Graphics.UI header from the module hierarchy. The main con here
greater penetration more quickly.
-Edward
On Apr 25, 2014, at 9:17 AM, Simon Marlow marlo...@gmail.com wrote:
I want to propose a simple change to the -i flag for finding source files.
The problem we often have is that when you're writing code for a library that
lives deep in the module
Em 25-04-2014 12:01, Mathieu Boespflug escreveu:
Such a policy violates the separation of provenance from function
principle, which I think is a good one. That is, I ought to be able to
swap in a different implementation of a map for the standard one in
the containers package without having to
Em 25-04-2014 12:22, Edward Kmett escreveu:
+1 from me. I have a lot of projects that suffer with 4 levels of vacuous
subdirectories just for this.
In theory cabal could support this on older GHC versions by copying all of
the files to a working dir in dist with the expected layout on
* Felipe Lessa felipe.le...@gmail.com [2014-04-25 13:01:43-0300]
Em 25-04-2014 12:22, Edward Kmett escreveu:
+1 from me. I have a lot of projects that suffer with 4 levels of vacuous
subdirectories just for this.
In theory cabal could support this on older GHC versions by copying all of
I check out and work on projects on a bunch of machines, so it is important
that I can just pull with git and go. AFAIK, git doesn't understand them won't
build symlinks for me, so it'd just become another setup step for very marginal
benefit, and another thing to .gitignore.
-Edward
On Apr
On 2014-04-25 18:52, Edward Kmett wrote:
I check out and work on projects on a bunch of machines, so it is important
that I
can just pull with git and go. AFAIK, git doesn't understand them won't build
symlinks
for me, so it'd just become another setup step for very marginal benefit, and
* Edward Kmett ekm...@gmail.com [2014-04-25 11:22:46-0400]
+1 from me. I have a lot of projects that suffer with 4 levels of vacuous
subdirectories just for this.
In theory cabal could support this on older GHC versions by copying all of the
files to a working dir in dist with the expected
You can actually make symbolic links (as well as hard links and directory
junctions) on windows.
-Edward
On Apr 25, 2014, at 12:51 PM, Roman Cheplyaka r...@ro-che.info wrote:
* Felipe Lessa felipe.le...@gmail.com [2014-04-25 13:01:43-0300]
Em 25-04-2014 12:22, Edward Kmett escreveu:
+1
I want to propose something really simple that would avoid this
problem with minimal additional complexity:
ghc -iGraphics.UI.Gtk=src
the meaning of this flag is that when searching for modules, ghc
will look for the module Graphics.UI.Gtk.Button in src/Button.hs,
rather than
. The workarounds are viral and wind up
complicating builds considerably.
I could also be totally out to lunch here.
On Apr 25, 2014, at 13:17, Simon Marlow marlo...@gmail.com wrote:
I want to propose a simple change to the -i flag for finding source
files. The problem we often have is that when
On 2014-04-25 15:17, Simon Marlow wrote:
[--snip--]
-1
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
On 25 Apr 2014, at 14:17, Simon Marlow wrote:
The problem we often have is that when you're writing code for a library that
lives deep in the module hierarchy, you end up needing a deep directory
structure, where the top few layers are all empty.
I don't see how this is a problem at all.
using lists, and
attempting to index into them and measure their lengths. Perhaps a
different data structure is in order.
Thanks
Tom Davie
On 3 Apr 2013, at 17:38, Lone Wolf amslonew...@gmail.com wrote:
http://stackoverflow.com/questions/8940470/algorithm-for-finding-numerical
.
Thanks
Tom Davie
On 3 Apr 2013, at 17:38, Lone Wolf amslonew...@gmail.com wrote:
http://stackoverflow.com/questions/8940470/algorithm-for-finding-numerical-permutation-given-lexicographic-index
How would you rewrite this into Haskell? The code snippet is in Scala.
/**
example
http://stackoverflow.com/questions/8940470/algorithm-for-finding-numerical-permutation-given-lexicographic-index
How would you rewrite this into Haskell? The code snippet is in Scala.
/**
example: index:=15, list:=(1, 2, 3, 4)
*/
def permutationIndex (index: Int, list: List [Int
efficient, because you're using lists, and
attempting to index into them and measure their lengths. Perhaps a different
data structure is in order.
Thanks
Tom Davie
On 3 Apr 2013, at 17:38, Lone Wolf amslonew...@gmail.com wrote:
http://stackoverflow.com/questions/8940470/algorithm-for-finding
Sorry for the delayed response -- I've had exams the past few days.
On Sun, May 27, 2012 at 8:21 PM, Eugene Kirpichov ekirpic...@gmail.com wrote:
A lot of people have done this :) eg from me: google up a fairly recent
thread from me about processing streams and perhaps the keyword timeplot
Hello all
I just came up with a way of executing multiple folds in a single
pass. In short, we can write code like this:
average = foldLeft $ (/) $ sumF * lengthF
and it will only traverse the input list once.
The code is at: https://gist.github.com/2802644
My question is: has anyone done
A lot of people have done this :) eg from me: google up a fairly recent thread
from me about processing streams and perhaps the keyword timeplot (writing
from a dying phone, can't do myself)
27.05.2012, в 12:04, Chris Wong chrisyco+haskell-c...@gmail.com написал(а):
Hello all
I just came
There are a few blog posts by Conal Elliott and Max Rabkin (I think)
reifying folds as a data type to get more composition and thus fold
different functions at the same time. Search for beautiful folding
with the above authors names.
Personally I didn't find the examples significantly more
Hi Chris,
On 05/27/2012 10:04 AM, Chris Wong wrote:
I just came up with a way of executing multiple folds in a single
pass. In short, we can write code like this:
average = foldLeft $ (/)$ sumF* lengthF
and it will only traverse the input list once.
The code is at:
I've isolated the below small piece of code that is giving me a stack
overflow. I'm kind of at a loss as has to fix, or even find what is
happening here. (The real program is reading the data from a file,
and doing something more complex with it). I'm not even sure how to
work around this
On 21.04 11:21, David Brown wrote:
I've isolated the below small piece of code that is giving me a stack
overflow. I'm kind of at a loss as has to fix, or even find what is
happening here. (The real program is reading the data from a file,
and doing something more complex with it). I'm not
On Sat, Jan 21, 2012 at 8:18 AM, Twan van Laarhoven twa...@gmail.com wrote:
Notice that there are lots of miku-X prefixes found. This is probably not
what you want. What exactly do you want the algorithm to do? For example,
is obviously a prefix of every string, but it is not very long. On the
On 2012-01-20 23:44, Gwern Branwen wrote:
On Fri, Jan 20, 2012 at 1:57 PM, Twan van Laarhoventwa...@gmail.com wrote:
Here is some example code (untested):
Well, you're right that it doesn't work. I tried to fix the crucial
function, 'atLeastThisManyDescendants', but it's missing something
name files with hyphens as the
delimiters like the hypothetical '1998-wadler-monads.pdf', and it
would be easy to write a stdin/stdout filter to break Strings on
hyphens and sort by whatever is most common. But this is rather
hardwired, can I solve the more general problem of finding the longest
On 20/01/12 18:45, Gwern Branwen wrote:
Recently I wanted to sort through a large folder of varied files and
figure out what is a 'natural' folder to split out, where natural
means something like4 files with the same prefix.
My idea for an algorithm would be: build a trie for the input
On Fri, Jan 20, 2012 at 1:57 PM, Twan van Laarhoven twa...@gmail.com wrote:
Here is some example code (untested):
Well, you're right that it doesn't work. I tried to fix the crucial
function, 'atLeastThisManyDescendants', but it's missing something
because varying parts doesn't much affect the
We're currently looking into so-called expression holes in GHC -- like the
type goals of Agda -- and we've run into a problem of understanding.
We have defined an expression, call it __ for now, for which we want to
find the type after a program is type-checked. In tcExpr (TcExpr.lhs), we
can see
On 5 jan. 2012, at 14:08, Sean Leather wrote:
We're currently looking into so-called expression holes in GHC -- like the
type goals of Agda -- and we've run into a problem of understanding.
We have defined an expression, call it __ for now, for which we want to find
the type after a
#4833: Finding the right loop breaker
-+--
Reporter: simonpj |Owner:
Type: bug | Status: new
Priority: normal|Milestone: 7.2.1
#4833: Finding the right loop breaker
-+--
Reporter: simonpj |Owner:
Type: bug | Status: new
Priority: normal|Milestone
Stephen Tetley wrote:
I thought I read that Firefox does a font swap if it can't find a
glyph, but thinking about it myself I can't see that this would make
sense - Firefox would have to know an awful lot about the OSes fonts
to know if they have missing glyphs.
You're pretty much right,
Hello John
Thanks for the information - after I posted that message I read the
CSS section of Yannis Haralambous's Fonts Encodings (_the_ book of
all things font) and it has this text:
In other words, the browser will check not only the existence of a
given font but also the existence of each
On 05/11/2010 09:05 PM, Stephen Tetley wrote:
On 5 November 2010 20:08, Andrew Coppinandrewcop...@btinternet.com wrote:
Would it be hard to replace - with a real Unicode arrow character?
It should be quite easy - whether a given font has an arrow readily
available is a different matter.
I
On 6 November 2010 09:52, Andrew Coppin andrewcop...@btinternet.com wrote:
I can't remember the last time I saw a browser that couldn't do this. There
/are/ symbols that don't work reliably, but the basic arrow symbols seem to
be pretty well supported.
Okay I'll shift my position a bit...
On Nov 6, 2010, at 3:56 AM, Stephen Tetley wrote:
Modern browsers might add in arrow from a different font if it is not
present in the one chosen by the web page author - I suspect this is
happening on this page where the arrow looks wrong typographically:
I don't think that's what's going
On 6 November 2010 18:01, Alexander Solla a...@2piix.com wrote:
On Nov 6, 2010, at 3:56 AM, Stephen Tetley wrote:
Modern browsers might add in arrow from a different font if it is not
present in the one chosen by the web page author - I suspect this is
happening on this page where the arrow
dons:
magnus:
I know there's a .cabal file for the latest version of HP somewhere,
but I can't coerce Google into finding me a link that actually works.
Furthermore, the following page:
http://hackage.haskell.org/platform/contents.html
does list all the contents, but to my big
On 05/11/2010 02:59 PM, Don Stewart wrote:
The changelog now lists all the versions:
http://hackage.haskell.org/platform/changelog.html
This is quite optimal.
It would still be nice if one could easily answer the question which HP
release was the one that contained process-1.0.1.1,
On 5 November 2010 20:08, Andrew Coppin andrewcop...@btinternet.com wrote:
Would it be hard to replace - with a real Unicode arrow character?
It should be quite easy - whether a given font has an arrow readily
available is a different matter. It might be be simpler to drop into
the Symbol font
On 2010-11-05 21:05 +, Stephen Tetley wrote:
On 5 November 2010 20:08, Andrew Coppin andrewcop...@btinternet.com wrote:
Would it be hard to replace - with a real Unicode arrow character?
It should be quite easy - whether a given font has an arrow readily
available is a different matter.
On 5 November 2010 21:31, Nick Bowler nbow...@elliptictech.com wrote:
Except that the Symbol font family is not available in all browsers.
Ah ha - indeed you are right and the puritans at W3C and Mozilla.org
seem to have dug their heels in.
Unfortunately arrows don't appear to be in either the
I know there's a .cabal file for the latest version of HP somewhere,
but I can't coerce Google into finding me a link that actually works.
Furthermore, the following page:
http://hackage.haskell.org/platform/contents.html
does list all the contents, but to my big surprise it doesn't link
magnus:
I know there's a .cabal file for the latest version of HP somewhere,
but I can't coerce Google into finding me a link that actually works.
Furthermore, the following page:
http://hackage.haskell.org/platform/contents.html
does list all the contents, but to my big surprise
On Mon, Nov 1, 2010 at 14:47, Don Stewart d...@galois.com wrote:
magnus:
I know there's a .cabal file for the latest version of HP somewhere,
but I can't coerce Google into finding me a link that actually works.
Furthermore, the following page:
http://hackage.haskell.org/platform
On Mon, 18 Oct 2010 22:03:15 +0200, d...@patriot.net wrote:
OK, I'm trying to install Haskore and it depends on an old version of
QuickCheck. I'm happy to hack and update, but is there any way of
finding
out which modules depend on QuickCheck rather than going through each
file
one by one
On 18 October 2010 21:03, d...@patriot.net wrote:
[SNIP]
I'm happy to hack and update, but is there any way of finding
out which modules depend on QuickCheck rather than going through each file
one by one?
grep for QuickCheck? - any module that uses it will need it in the
import list
Günther Schmidt gue.schm...@web.de writes:
how can I find out which gcc a ghc is hard-coded to use and is it
possible to override it?
At least in Linux as of 6.12.2, the /usr/bin/ghc wrapper script has a
link to it.
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
Hello,
how can I find out which gcc a ghc is hard-coded to use and is it
possible to override it?
Günther
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
If you're on Windows, I believe you can find the gcc.exe at the following
location:
C:\Program Files\Haskell Platform\2009.2.0.2\gcc.exe
See this link for how to pick which C compiler to use:
http://www.haskell.org/ghc/docs/6.12.2/html/users_guide/options-phases.html#replacing-phases
2010/8/6
On 6 Aug 2010, at 18:05, Günther Schmidt wrote:
Hello,
how can I find out which gcc a ghc is hard-coded to use and is it
possible to override it?
See this page:
http://www.haskell.org/ghc/docs/6.12.2/html/users_guide/options-phases.html
Cheers,
G
Sergey Mironov wrote:
Sorry for late answer. Luke, Heinrich - thank you very much for explanations.
I feel that I need more reading to get familiar with differentiation
of functors and chain rule. Could you suggest some books or papers?
For differentiation of data types, there is for example
2010/7/2 Heinrich Apfelmus apfel...@quantentunnel.de:
Sergey Mironov wrote:
Hello list!
I am trying to understand zipper concept using papers like [1] and [2].
Though main idea looks clear, I still have a problem in applying it for
custom data types.
Please help me with deriving
Günther Schmidt wrote:
Hi list,
the problem I have stems from the app I had developed. What my app does
is to split the money a hospital receives for a case to the departments
involved in a fair way.
An additional requirement however was to allow the users of the app to
re-map any revenue
If you ignore the identity mappings (which all technically create
trivial loops), these mappings would form a directed acyclic graph
(DAG). I would look at some of the graph libraries, e.g. fgl, to see
if they have anything appropriate.
John
From: G?nther Schmidt gue.schm...@web.de
Hi list,
Hi list,
the problem I have stems from the app I had developed. What my app does
is to split the money a hospital receives for a case to the departments
involved in a fair way.
An additional requirement however was to allow the users of the app to
re-map any revenue shares credited to
What sort of model would be suitable to describe this, some sort of
matrix?
You still can get loops if your matrix represents graph.
Sounds like you need a tree.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Luke Palmer wrote:
I would just use List. IIRC the derivative of list is:
data DList a = DLIst [a] [a]
Understood as the elements before the focused one and those after it.
Unfortunately I can't remember how that is derived, and my own
experiments failed to come up with anything similar.
Sergey Mironov wrote:
Hello list!
I am trying to understand zipper concept using papers like [1] and [2].
Though main idea looks clear, I still have a problem in applying it for
custom data types.
Please help me with deriving Zipper-type from
data DTree a = P | D [(a, DTree)]
Looking in [1]
Hello list!
I am trying to understand zipper concept using papers like [1] and [2].
Though main idea looks clear, I still have a problem in applying it for
custom data types.
Please help me with deriving Zipper-type from
data DTree a = P | D [(a, DTree)]
Looking in [1] ('Zippers via
On Thu, Jul 1, 2010 at 1:54 PM, Sergey Mironov ier...@gmail.com wrote:
Hello list!
I am trying to understand zipper concept using papers like [1] and [2].
Though main idea looks clear, I still have a problem in applying it for
custom data types.
Please help me with deriving Zipper-type from
Günther Schmidt wrote:
I've got a problem, in short my haskell code sucks. While it does work
and I do manage to use higher-orderish aspects quite extensively to make
my code more concise it still is nowhere abstract, always concrete and
thus always with lots of boilerplate.
Oh I have
Hello,
I've got a problem, in short my haskell code sucks. While it does work
and I do manage to use higher-orderish aspects quite extensively to make
my code more concise it still is nowhere abstract, always concrete and
thus always with lots of boilerplate.
Oh I have gotten better
2010/2/14 Günther Schmidt gue.schm...@web.de:
So fellows, what is the next stop on my road to enlightenment? I really
think I need best to start from scratch. I think I'm sufficiently familiar
now with most of Haskell's technicalities but how do I climb the ladder of
abstraction?
A couple of
* On Sun, Feb 14 2010, Günther Schmidt wrote:
So fellows, what is the next stop on my road to enlightenment? I
really think I need best to start from scratch. I think I'm
sufficiently familiar now with most of Haskell's technicalities but
how do I climb the ladder of abstraction?
Read more
Hi Günther
Promoting a slightly contrary view, I'm not sure that abstraction
should be a goal in itself. Richard Gabriel makes a point of valuing
'habitable' code over abstract code in his 'Patterns of Software' book
(free from his website now that it's out of print). Habitable code
being code
On Feb 14, 2010, at 4:38 AM, Günther Schmidt wrote:
I've got a problem, in short my haskell code sucks. While it does
work and I do manage to use higher-orderish aspects quite
extensively to make my code more concise it still is nowhere
abstract, always concrete and thus always with lots
Well I just noticed that the boilerplate part consists of this:
Import data by selecting fields from a table, feed them into some sort
of internal data structure for later querying, times 12. All this
involves quite a bit of boilerplate.
Yeah, I guess I could abstract here a little.
Günther
Hello,
2010/2/14, Günther Schmidt gue.schm...@web.de:
Hello,
I've got a problem, in short my haskell code sucks. While it does work
and I do manage to use higher-orderish aspects quite extensively to make
my code more concise it still is nowhere abstract, always concrete and
thus always
Hi all,
I was looking through some of the Hackage packages to find examples of
how developers are extending UserHooks in their Setup files, but it
wasn't easy, since the great majority of Cabal Setup files in Hackage
simply require only the standard line of 'main = defaultMain' or
1 - 100 of 224 matches
Mail list logo
