2009/12/31 Michael Snoyman mich...@snoyman.com:
Some of us prefer not to look at that kind of material. I'd appreciate if,
in the future, you could either refrain from sending such links or making it
clear that they contain objectionable content.
Agreed; however, looking at the URL does hint
2009/12/7 Jochem Berndsen joc...@functor.nl:
Jochem Berndsen wrote:
nerds
This was a friend of mine trying to be funny.
You allow your friends (and what kind of a friend does this anyway)
access to your email?
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMiljenovic.wordpress.com
2009/7/20 Brandon S. Allbery KF8NH allb...@ece.cmu.edu:
Shouldn't String then be replaced by a sum type? In fact, as described this
would subsume the Either as well.
-- replace Either Bool String: AttrN are the strings, AltValue the bool
data upstreamValue = AttrA | AttrB | AltValue
Yes, as
Yay, someone read my proposal! :p
2009/6/25 Andrew Hunter andrewhhun...@gmail.com:
This is a good idea and one I support. (I think I've been told before
that this has been tried w/o a lot of success, but, well...) My
primary concern is this: you built your class for things that operate
on
2008/10/8 Gwern Branwen [EMAIL PROTECTED]:
So it'll be fixed for the next release? Cool then; I look forward to seeing
my XMC modules' analysis.
Yeah, I was planning on making a new release some time this week...
and then I somehow accidentally uninstalled just about everything on
my system,
2008/10/6 Niklas Broberg [EMAIL PROTECTED]:
* the dependency on haskell-src-exts says any version should do, but
the one shipped in Debian Sid
(http://packages.debian.org/sid/libghc6-src-exts-dev) doesn't do, so
some extra versioning info seems to be required
Ouch, that one's pretty old.
I've now uploaded my SourceGraph program to Hackage [1]. It's rather
simple at the moment, but if you pass in the .cabal file as a
parameter (e.g. run it as SourceGraph Foo.cabal), it will create in
the same directory as the .cabal file a Directory called SourceGraph
that contains an html report
I've now uploaded my SourceGraph program to Hackage [1]. It's rather
simple at the moment, but if you pass in the .cabal file as a
parameter (e.g. run it as SourceGraph Foo.cabal), it will create in
the same directory as the .cabal file a Directory called SourceGraph
that contains an html report
I'd like to announce the initial release of my graph-theoretic
analysis library, Graphalyze [1], the darcs repo for which is also
available [2].
This is a pre-release of the library that I'm writing for my
mathematics honours thesis, Graph-Theoretic Analysis of the
Relationships in Discrete Data.
I'd like to announce the initial release of my graph-theoretic
analysis library, Graphalyze [1], the darcs repo for which is also
available [2].
This is a pre-release of the library that I'm writing for my
mathematics honours thesis, Graph-Theoretic Analysis of the
Relationships in Discrete Data.
The latest version of Matthew Sackman's Haskell bindings to Graphviz
[1] are now available on Hackage [2]. The reason there's a new
release only two weeks after the previous one is that I've made some
extensions to it (hence why I'm writing the announcement) that Matthew
has kindly included.
C.M.Brown cmb21 at kent.ac.uk writes:
I have approx. 100+ source files and I was wondering if anyone has a tool
that would let me see a visual call graph for the source files; i.e. a
visual hierarchy of which module is imported by what, and so forth.
For my maths honours thesis, I'll be
Next year, I'm thinking of going overseas (I'm currently in Australia)
to do a PhD. Preferably, I'd like to do something in the area of
computational combinatorics using Haskell. Does anyone know of any
particular unis/supervisors I should be looking at/talking to about
this?
--
Ivan Lazar
(CC'd to the list)
On 07/03/2008, Dusan Kolar [EMAIL PROTECTED] wrote:
I'm just wondering what algorithms you use for analysis. For instance,
clique is an NP complete problem. Do you use some approximation? If yes,
which? I'm particularly interested in the algorithm.
I haven't gotten that
On 07/03/2008, Arnar Birgisson [EMAIL PROTECTED] wrote:
Will you be considering parallel programs? Also, perhaps some
information flow analysis would be interesting.
What do you mean by parallel programs? The parallelism hints used by
ghc? In that case, I'll be supporting whatever the parser
On 07/03/2008, Ketil Malde [EMAIL PROTECTED] wrote:
Sometimes, it's not obvious where to draw boundaries between modules,
perhaps finding a smallest cut (if that is the correct term) could
help to minimize the interfaces? I.e. find tightly connected
components that have relatively few
Back in December, I posted that I was thinking about doing a project
for my honours year on using graph theory for analysis on Haskell
source code, amongst others:
http://thread.gmane.org/gmane.comp.lang.haskell.cafe/32912
Well, I've officially started this project, and my supervisor and I
have
On 07/03/2008, Vimal [EMAIL PROTECTED] wrote:
Will the graph be completely computed before the analysis begins? Or
will you try to build the graph lazily as and when you require more
information?
Probably beforehand.
Are you looking for Haskell functions that can be used to solve the
On 07/12/2007, Tommy McGuire [EMAIL PROTECTED] wrote:
How I envisage it happening is that a parser would be used to find all
functions in the given code, treat these as nodes in the graph and
then use directed edges to indicate which functions call other
functions. This resultant graph
On 07/12/2007, Tommy McGuire [EMAIL PROTECTED] wrote:
I was actually thinking that something like that would be more valuable
for a language like C, where types are not represented in the control flow.
By the way, in a completely different context I just ran across a couple
of references:
On 06/12/2007, Tim Chevalier [EMAIL PROTECTED] wrote:
This is very well-trodden ground, but if you familiarize yourself with
the literature on the subject, then who knows, you may discover
something new. And you can take pleasure in knowing that you've
already independently conceived of an
This isn't strictly Haskell related, but anyway.
Next year I will be doing my honours in mathematics. One possible
topic for my thesis that I've thought of - and my supervisor is quite
enthused about - is to use graph theory to analyse various textual
sources, starting with source code but
Speaking of Stackless Python, its homepage (http://www.stackless.com/)
has a rather nice layout... maybe slightly less emphasis on the About
section, but there you've got the links, the info and the news all on
the one page.
___
Haskell-Cafe mailing list
On 21/03/07, apfelmus [EMAIL PROTECTED] wrote:
Concerning Sudoku, there is a beautiful talk from R. Bird
http://icfp06.cs.uchicago.edu/bird-talk.pdf
I based my Latin Squares algorithms on Bird's Functional Pearl article
A Program to play Sudoku
The other problem with using a list of
Some of you might recall me annoying people on #haskell over the New
Year about my Latin Squares project. Well, I'm looking at re-doing it
from scratch, but the first thing I need to do is find a new way of
representing my square.
I have been using a list of lists ([[a]]) to represent a matrix.
201 - 225 of 225 matches
Mail list logo
