Hello Bulat!
Sun, Feb 01, 2009 at 10:19:18PM +0300 you wrote:
Hello haskell-cafe,
pure functional denotation for crisis:
(_|_)
Thus, when people try to evaluate the amount of savings they have left,
their behavior frequently becomes _undefined_ :)
--
DoubleF
pgpqVznaWBs7H.pgp
I spent four hours investigating this problem! Thank you very much for the
excellent brainfood, and challenging Haskell's claim to be rawkin' at
parallelism. I think, though it took much experimentation, that I have
confirmed that it is :-)
On Sun, Feb 1, 2009 at 9:26 PM, John D. Ramsdell
On Mon, Feb 2, 2009 at 2:15 AM, Luke Palmer lrpal...@gmail.com wrote:
I spent four hours investigating this problem! Thank you very much for the
excellent brainfood, and challenging Haskell's claim to be rawkin' at
parallelism. I think, though it took much experimentation, that I have
Hello,
Are there any Haskell tutorials suitable for people who don't (and
possibly don't want to) know Haskell, but just want to use an embedded
language that happens to be in Haskell?
Such a tutorial would focus on using libraries rather than defining
them. For example, it might explain
Hi,
The concept of type seems to be a little like porno: I know it when
I see it, but I can't define it (apologies to Justice Stewart). I've
picked through lots of documents that discuss types in various ways,
but I have yet to find one that actually says what a type really is.
For example,
Hi
Are you still in a not-able-to-do-a-cabal-install state?
I had this problem as well and I solved it by simply deleting (or moving) my
~/.ghc directory and then re-installing ghc, as per this message:
http://markmail.org/message/fraw3cw56squfeld
Note: that this should only be used if you
Although efficient text rendering (or more generally, massive similar shape
rendering) requires a lot of clever caching I guess :)
On Mon, Feb 2, 2009 at 3:26 PM, Jeff Heard jefferson.r.he...@gmail.comwrote:
That's my thought.
On Mon, Feb 2, 2009 at 7:23 AM, Achim Schneider bars...@web.de
2009/2/2 Emil Axelsson e...@chalmers.se:
Hello,
Are there any Haskell tutorials suitable for people who don't (and possibly
don't want to) know Haskell, but just want to use an embedded language that
happens to be in Haskell?
Such a tutorial would focus on using libraries rather than
Martijn van Steenbergen wrote:
To my naive mind this sounds
suspiciously like the set of all sets, so it's too big to be a set.
Here you're probably thinking about the distinction between countable
and uncountable sets. See also:
http://en.wikipedia.org/wiki/Countable_set
No - it's even
* Martijn van Steenbergen wrote:
Int has 2^32 values, just like in Java.
Haskell Report 6.4 (revised):
The finite-precision integer type Int covers at least
the range [ - 2^29, 2^29 - 1].
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hi Deniz,
Deniz Dogan skrev:
I don't think it's a good idea (or even possible) to use a Haskell
library without knowing anything about Haskell or functional
programming. However, it shouldn't take too long to learn the very
Well, I guess I was asking for a tutorial which covers everything
Hi Martijn,
On Mon, Feb 2, 2009 at 9:49 AM, Martijn van Steenbergen
mart...@van.steenbergen.nl wrote:
There are many answers to the question what is a type?, depending on
one's
view.
One that has been helpful to me when learning Haskell is a type is a set
of
values.
That's the way I've
Thinking of types as sets is not a bad approximation. You need to add
_|_ to your set of values, though.
So, Bool={_|_, False, True}, Nat={_|_,Zero,Succ _|_, Succ Zero, ...}
2009/2/2 Gregg Reynolds d...@mobileink.com:
Hi Martijn,
On Mon, Feb 2, 2009 at 9:49 AM, Martijn van Steenbergen
On 2009 Feb 1, at 17:49, Erik de Castro Lopo wrote:
The following code creates a symbolic link in the current directory
and then uses System.Posix.Files.getFileStatus to get the status of
the link.
However, isDirectory returns True and isSymbolicLink returns False
which is very different from
Hi and thanks for the response,
On Mon, Feb 2, 2009 at 10:32 AM, Lennart Augustsson
lenn...@augustsson.netwrote:
Thinking of types as sets is not a bad approximation. You need to add
_|_ to your set of values, though.
So, Bool={_|_, False, True}, Nat={_|_,Zero,Succ _|_, Succ Zero, ...}
On Mon, Feb 2, 2009 at 8:09 AM, Gregg Reynolds d...@mobileink.com wrote:
Yes, that's my hypothesis: type constructors take us outside of set
theory (ZF set theory, at least). I just can't prove it.
It's too big for Set Theory if you insist on representing functions
in type theory as
If we're talking Haskell types here I think it's reasonable to talk
about the values of a type as those that we can actually express in
the Haskell program, any other values are really besides the point.
Well, if you have a more philosophical view of types then I guess
there is a point, but I
Lennart Augustsson wrote:
The Haskell function space, A-B, is not uncountable.
There is only a countable number of Haskell functions you can write,
so how could there be more elements in the Haskell function space? :)
The explanation is that the Haskell function space is not the same as
the
You can enumerate all possible implementations of functions of type
(Integer - Bool).
Just enumerate all strings, and give this to a Haskell compiler
f :: Integer - Bool
f = enumerated-string-goes-here
if the compiler is happy you have an implementation.
The enumerated functions do not include
I had the same idea, here's my implemention, running on an old Winhugs
2001 (and GHC 6.8).
regards, Daniel
import System
import Directory
chars = map chr [32..126]
string 0 = return
string n = do
c - chars
s - string (n-1)
return (c:s)
mkfun n = do
s - string n
return (f :: Integer -
On Mon, 2009-02-02 at 13:49 +0900, Benjamin L.Russell wrote:
On Sun, 01 Feb 2009 15:01:28 +, Duncan Coutts
duncan.cou...@worc.ox.ac.uk wrote:
On Sat, 2009-01-31 at 16:50 -0800, Don Stewart wrote:
Windows people need to set up a wind...@haskell.org to sort out their
packaging issues,
oops, the '$ drop 1000' in the main function should not be there...
Daniel van den Eijkel schrieb:
I had the same idea, here's my implemention, running on an old Winhugs
2001 (and GHC 6.8).
regards, Daniel
import System
import Directory
chars = map chr [32..126]
string 0 = return
string
Gregg Reynolds d...@mobileink.com writes:
This gives a very interesting way of looking at Haskell type
constructors: a value of (say) Tcon Int is anything that satisfies
isA Tcon Int.
Reminiscent of arguments between dynamic and static typing camps - as
far as I understand, a dynamic type
On Mon, Feb 2, 2009 at 11:51 AM, Lennart Augustsson
lenn...@augustsson.netwrote:
If we're talking Haskell types here I think it's reasonable to talk
about the values of a type as those that we can actually express in
the Haskell program, any other values are really besides the point.
Well, if
Hello,
I'm interested to hear if anyone out there has used Haskell (or other
functional languages for that matter) to build simulators for real-
time systems.
I'm somewhat familiar with Timber http://www.timber-lang.org/ and
similar languages for actually constructing real-time systems.
On Mon, Feb 2, 2009 at 12:39 PM, Ketil Malde ke...@malde.org wrote:
Gregg Reynolds d...@mobileink.com writes:
This gives a very interesting way of looking at Haskell type
constructors: a value of (say) Tcon Int is anything that satisfies
isA Tcon Int.
Reminiscent of arguments between
Opis is an ocaml library for implementing reactive systems where the
same code can either be executed, run in a simulator or used as a
specification in a formal model checker. The model checking is only
possible because referential transparency massively reduces the state
space of the program.
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Emil Axelsson wrote:
| Well, I guess I was asking for a tutorial which covers everything except
| the parts that are not normally relevant for a DSEL user. For example, I
| would expect the following to be left out:
|
| * Definition of data types
Hi,
Am Montag, den 02.02.2009, 11:06 -0700 schrieb Luke Palmer:
That question has kind of a crazy answer.
In mathematics, Nat - Bool is uncountable, i.e. there is no function
Nat - (Nat - Bool) which has every function in its range.
But we know we are dealing with computable functions,
2009/1/29 Conal Elliott co...@conal.net:
Hi Achim,
I came to the same conclusion: I want to sweep aside these OO, imperative
toolkits, and replace them with something genuinely functional, which for
me means having a precise simple compositional (denotational) semantics.
Something
The actual presentation and layout of widgets would be better handled
by a DSL such as CSS (which is, in fact, declarative in nature), while
event logic would be best handled purely in Haskell.
Regards,
John A. De Goes
N-BRAIN, Inc.
The Evolution of Collaboration
http://www.n-brain.net
Hello,
With Data.Typeable :
*Graph typeRepArgs (typeOf 1)
[]
*Graph typeRepArgs (typeOf 'a')
[]
*Graph typeRepArgs (typeOf True)
[]
*Graph typeRepArgs (typeOf hello)
[Char]
I don't understand why the latter is not []. Could someone explain it ?
Thank you,
Thu
On Mon, 2009-02-02 at 17:30 +0100, Krzysztof Skrzętnicki wrote:
Do they? Haskell is a programing language. Therefore legal Haskell
types has to be represented by some string. And there are countably
many strings (of which only a subset is legal type representation, but
that's not important).
On Mon, 2009-02-02 at 21:09 +0100, minh thu wrote:
Hello,
With Data.Typeable :
*Graph typeRepArgs (typeOf 1)
[]
*Graph typeRepArgs (typeOf 'a')
[]
*Graph typeRepArgs (typeOf True)
[]
*Graph typeRepArgs (typeOf hello)
[Char]
I don't understand why the latter is not []. Could
The type of hello is String, which is [Char], which is really []
Char (that is, the list type of kind * - *, applied to Char).
1, 'a', and True are all simple types (I'm sure there's a more
particular term, maybe monomorphic?) with no type arguments.
[] has a type argument, Char.
Gregg Reynolds d...@mobileink.com writes:
Just shorthand for something like data Tcon a = Dcon a, applied to Int.
Any data constructor expression using an Int will yield a value of type Tcon
Int.
Right. But then the set of values is isomorphic to the set of Ints,
right?
I don't follow
Thanks. Could you add to your explanation this one :
*Graph typeRepArgs (typeOf (+))
[Integer,Integer - Integer]
In fact, I tried to write a function that would give the types used by
a function,
for instance [Integer, Integer, Integer] for (+) (the last one would
be the 'return' type).
So I
I have three announcements to make about regex-* related packages.
The regex-posix-0.94.1 package update provides better semantics for multiple
matches. Below version 0.94, if any match was empty the matching would stop.
Now the empty match is returned and the position is incremented and the
Sure:
(+) :: Integer - Integer - Integer (really Num a = a - a -
a, but we'll use the defaulted one)
Which is really
(+) :: - Integer (- Integer Integer)(that is, the function type
constructor is * - * - * and right associative)
So when you say typeRepArgs (typeOf (+)) you get
Could CSS give us semantic clarity? - Conal
On Mon, Feb 2, 2009 at 11:58 AM, John A. De Goes j...@n-brain.net wrote:
The actual presentation and layout of widgets would be better handled by a
DSL such as CSS (which is, in fact, declarative in nature), while event
logic would be best handled
Hi Gregg,
Firsly: I'm not an expert on this, so if anyone thinks I'm writing
nonsense, do correct me.
There are many answers to the question what is a type?, depending on
one's view.
One that has been helpful to me when learning Haskell is a type is a
set of values. When seen like this it
On Sun, Feb 1, 2009 at 12:36 PM, Gregg Reynolds d...@mobileink.com wrote:
On Sat, Jan 31, 2009 at 3:14 PM, David Menendez d...@zednenem.com wrote:
There's a paper about defining catamorphisms for GADTs and nested
recursive types that models type constructors that way.
If you recall a title
On Mon, Feb 2, 2009 at 11:39 AM, Creighton Hogg wch...@gmail.com wrote:
2009/1/29 Conal Elliott co...@conal.net:
Hi Achim,
I came to the same conclusion: I want to sweep aside these OO, imperative
toolkits, and replace them with something genuinely functional, which
for
me means
The size, color, and layout of widgets has no effect on interaction
semantics and is best pushed elsewhere, into a designer-friendly realm
such as CSS.
Regards,
John A. De Goes
N-BRAIN, Inc.
The Evolution of Collaboration
http://www.n-brain.net|877-376-2724 x 101
On Feb 2, 2009,
Hi,
I'm bringing up an old thread, because it's very relevant to my problem.
On Tue, Nov 18, 2008 at 22:30, Duncan Coutts wrote:
On Tue, 2008-11-18 at 01:48 -0800, Jason Dusek wrote:
I'd like to be able to do something like:
if (template-haskell 2.3)
cpp-options: -D
Hello cafe-subscribers,
I saw some issues about installing haskell bindings for cURL under Windows,
and now I'm trapped too.
So, here is actions' log for everything (very detail; you can PgDn to the
end with questions):
1. Windows Vista without UAC
2. ghc-6.10.1-i386-windows.exe is installed to
On Mon, 2009-02-02 at 13:28 -0800, Conal Elliott wrote:
On Mon, Feb 2, 2009 at 11:39 AM, Creighton Hogg wch...@gmail.com
wrote:
2009/1/29 Conal Elliott co...@conal.net:
Hi Achim,
I came to the same conclusion: I want to sweep aside these
OO,
On Mon, Feb 2, 2009 at 3:25 PM, Ketil Malde ke...@malde.org wrote:
Gregg Reynolds d...@mobileink.com writes:
Just shorthand for something like data Tcon a = Dcon a, applied to Int.
Any data constructor expression using an Int will yield a value of type Tcon
Int.
Right. But then the set of
The Haskell function space, A-B, is not uncountable.
There is only a countable number of Haskell functions you can write,
so how could there be more elements in the Haskell function space? :)
The explanation is that the Haskell function space is not the same as
the functions space in set theory.
On Mon, Feb 2, 2009 at 3:28 PM, Conal Elliott co...@conal.net wrote:
On Mon, Feb 2, 2009 at 11:39 AM, Creighton Hogg wch...@gmail.com wrote:
snip
I think working on a purely functional widget toolkit would actually
be a really cool project. Do you have any ideas, though, on what
should be
ndmitchell:
Hi
So actually just having more Windows users subscribed to cabal-devel and
commenting on tickets would be very useful, even if you do not have much
time for hacking.
I believe that as soon as a Windows user starts doing that you'll
start asking them for patches :-)
Talking about the class of all Haskell types is a little tricky.
If one program has
data Foo x = Ick x | Ack x
and another program has
data Bar y = Ack y | Ick y
are {Program1}Foo and {Program2}Bar the same type or not?
They are certainly isomorphic.
Any Haskell program can be
pocmatos:
Hi all,
Much is talked that Haskell, since it is purely functional is easier
to be verified. However, most of the research I have seen in software
verification (either through model checking or theorem proving)
targets C/C++ or subsets of these. What's the state of the art of
jwlato:
Duncan Coutts wrote:
Some are trivial and should be done away with. For example the ones that
just check if a C header / lib is present are unnecessary (and typically
do not work correctly). The next point release of Cabal can do these
checks automatically, eg:
Do they? Haskell is a programing language. Therefore legal Haskell types has
to be represented by some string. And there are countably many strings (of
which only a subset is legal type representation, but that's not
important).
All best
Christopher Skrzętnicki
On Mon, Feb 2, 2009 at 17:09,
Final Call for Papers
ICFP 2009: International Conference on Functional Programming
Edinburgh, Scotland, 31 August - 2 September 2009
http://www.cs.nott.ac.uk/~gmh/icfp09.html
** Submission deadline: 2 March 2009 **
2009/2/2 Joachim Breitner m...@joachim-breitner.de
Hi,
Am Montag, den 02.02.2009, 11:06 -0700 schrieb Luke Palmer:
That question has kind of a crazy answer.
In mathematics, Nat - Bool is uncountable, i.e. there is no function
Nat - (Nat - Bool) which has every function in its range.
Hi
So actually just having more Windows users subscribed to cabal-devel and
commenting on tickets would be very useful, even if you do not have much
time for hacking.
I believe that as soon as a Windows user starts doing that you'll
start asking them for patches :-)
There are a number of
Don Stewart wrote:
GHC doesn't bundle with cabal-install on any system.
What is needed is not for the GHC team to be doing Windows platform
packages, but for the Windows Haskell devs to build their own system,
as happens on all the Unices.
Take GHC's release, wrap it up with native
Hi,
Am Montag, den 02.02.2009, 15:30 -0700 schrieb Luke Palmer:
That's what I meant.
thanks for the clarification, I indeed were confused by the notation and
saw Haskell functions where you meant mathematical functions.
Greetings,
Joachim
--
Joachim nomeata Breitner
mail:
Gregg Reynolds wrote:
On Sat, Jan 31, 2009 at 4:26 PM, wren ng thornton w...@freegeek.org wrote:
But a data constructor Dcon a is an /element/ mapping taking elements
(values) of one type to elements of another type. So it too can be
construed as a functor, if each type itself is
Thanks a lot !
2009/2/2 Ross Mellgren rmm-hask...@z.odi.ac:
Sure:
(+) :: Integer - Integer - Integer (really Num a = a - a - a, but
we'll use the defaulted one)
Which is really
(+) :: - Integer (- Integer Integer)(that is, the function type
constructor is * - * - * and right
2009/2/2 Luke Palmer lrpal...@gmail.com:
However! If we have a function f : Nat - Nat - Bool, we can construct the
diagonalization g : Nat - Bool as: g n = not (f n n), with g not in the
range of f. That makes Nat - Bool computably uncountable.
This is making my head explode. How is g not
Well, that is also the idea behind Microsoft's WPF/XAML: they provide a
declarative approach to describe the widget tree (specifying what it is, not
what is does), and a GUI toolkit (Expression Blend) for artists and
designers so they can use a high level tool to build the GUI. You can even
define
2009/2/2 Luke Palmer lrpal...@gmail.com:
But Nat ~ Bool is computably uncountable, meaning there is no injective
(surjective?)
function Nat ~ (Nat ~ Bool), by the diagonal argument above.
Given that the Haskell functions Nat - Bool are computably
uncountable, you'd expect that for any
On Mon, Feb 02, 2009 at 10:07:57AM +, Neil Mitchell wrote:
Hi
The nix package manager (although beeing primarly a linux tool) can run
on cygwin as well (at least it did some time ago)..
I'd suggest trying that to package windows libraries. It dose generate
tag files for you automatically as
On Sun, 01 Feb 2009 20:19:18 +0100, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Hello haskell-cafe,
pure functional denotation for crisis:
(_|_)
Well, some experts say, the crisis has reached it's bottom.
--
Regards,
Henk-Jan van Tuyl
--
http://functor.bamikanarie.com
Hi,
Am Montag, den 02.02.2009, 14:41 -0800 schrieb Dan Piponi:
2009/2/2 Luke Palmer lrpal...@gmail.com:
But Nat ~ Bool is computably uncountable, meaning there is no injective
(surjective?)
function Nat ~ (Nat ~ Bool), by the diagonal argument above.
Given that the Haskell functions
A lot of people are suggesting using Bytestrings for performance,
strictness whatsoever reasons.
However how well do they talk to other libraries?
One I've in mind is hslogger right now.
Should hslogger be implemented using Strings or Bytestrings ?
Should there be two versions?
ganesh.sittampalam:
Don Stewart wrote:
GHC doesn't bundle with cabal-install on any system.
What is needed is not for the GHC team to be doing Windows platform
packages, but for the Windows Haskell devs to build their own system,
as happens on all the Unices.
Take GHC's
On Mon, Feb 2, 2009 at 12:01 AM, Duncan Coutts
duncan.cou...@worc.ox.ac.uk wrote:
The solution is to upgrade:
$ cabal install cabal-install
$ cabal --version
cabal-install version 0.6.0
using version 1.6.0.1 of the Cabal library
Yes, this was the problem, despite me upgrading
==
issue 1
That's not the most awkward thing:
When logging to A.B.C hslogger does add 3 loggers to the global
logger Map:
A
A.B
A.B.C
all three inheriting the default priority level of the default
Stephen Tetley stephen.tet...@gmail.com wrote:
Also, Shiva-VG - http://sourceforge.net/projects/shivavg - the
implementation of OpenVG that the Haskell binding works with supports
OpenVG 1.0.1, so it doesn't handle text at all.
You know, if the Haskell bindings are compositable enough, it
Marc Weber wrote:
A lot of people are suggesting using Bytestrings for performance,
strictness whatsoever reasons.
However how well do they talk to other libraries?
One I've in mind is hslogger right now.
Should hslogger be implemented using Strings or Bytestrings ?
Should there be
I haven't had the time to study your question in detail yet, but I would
start by directing you here:
http://www.python.org/doc/current/library/logging.html#module-logging
hslogger is heavily based upon an earlier version of the Python logging
module. I had some experience with it and found
It's not a tutorial but it covers all the relvant portions you asked
about. Download the package, unzip it and you'll find my Haskell
Cheat Sheet PDF inside:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/CheatSheet
On Mon, Feb 2, 2009 at 6:35 AM, Emil Axelsson e...@chalmers.se
On Sun, 2009-02-01 at 19:10 -0800, Valentyn Kamyshenko wrote:
So, in practical terms, you suggest that no new version of the package
that ghc package depends on (directly or indirectly) should ever be
installed?
For example, as soon as process-1.0.1.1 is installed on my computer,
I'll
Andrew Coppin ha scritto:
[...]
Yeah, I just assumed that the bind step was only necessary for
connection-oriented protocols. (Interestingly enough, the matching
send program doesn't bind at all, yet seems to work fine...)
For a client (that is, when you call connect), the kernel chooses
The Haskell function space, A-B, is not uncountable.
There is only a countable number of Haskell functions you can write,
so how could there be more elements in the Haskell function space? :)
The explanation is that the Haskell function space is not the same as
the functions space in set theory.
That's my thought.
On Mon, Feb 2, 2009 at 7:23 AM, Achim Schneider bars...@web.de wrote:
Stephen Tetley stephen.tet...@gmail.com wrote:
Also, Shiva-VG - http://sourceforge.net/projects/shivavg - the
implementation of OpenVG that the Haskell binding works with supports
OpenVG 1.0.1, so it
Duncan Coutts wrote:
Some are trivial and should be done away with. For example the ones that
just check if a C header / lib is present are unnecessary (and typically
do not work correctly). The next point release of Cabal can do these
checks automatically, eg:
Configuring foo-1.0...
On Mon, Feb 2, 2009 at 9:47 AM, Martijn van Steenbergen
mart...@van.steenbergen.nl wrote:
Lennart Augustsson wrote:
The Haskell function space, A-B, is not uncountable.
There is only a countable number of Haskell functions you can write,
so how could there be more elements in the Haskell
On Mon, Feb 2, 2009 at 3:41 PM, Dan Piponi dpip...@gmail.com wrote:
2009/2/2 Luke Palmer lrpal...@gmail.com:
But Nat ~ Bool is computably uncountable, meaning there is no injective
(surjective?)
function Nat ~ (Nat ~ Bool), by the diagonal argument above.
Given that the Haskell functions
On Mon, Feb 02, 2009 at 02:41:36PM -0800, Dan Piponi wrote:
2009/2/2 Luke Palmer lrpal...@gmail.com:
But Nat ~ Bool is computably uncountable, meaning there is no injective
(surjective?)
function Nat ~ (Nat ~ Bool), by the diagonal argument above.
Given that the Haskell functions Nat
On Sun, Feb 1, 2009 at 9:26 PM, John D. Ramsdell ramsde...@gmail.com
wrote:
I have a reduction system in which a rule takes a term and returns a
set of terms.
The reduction system creates a tree that originates at a starting
value called the root.
For most problems, the reduction system
Luke Palmer wrote:
and pick out the ones which denote a total computable function [...]
How important is totality to this argument? If it is important, how do you
decide it?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Mon, Feb 2, 2009 at 10:05 AM, Andrew Butterfield
andrew.butterfi...@cs.tcd.ie wrote:
Martijn van Steenbergen wrote:
To my naive mind this sounds
suspiciously like the set of all sets, so it's too big to be a set.
Here you're probably thinking about the distinction between countable and
Duncan Coutts wrote:
So in the next cabal-install release (which should be pretty soon now)
configure will do the same thing and pick base 3 unless you specify
build-depends base = 4.
Niklas Broberg wrote:
I really really think this is the wrong way to go. Occasional
destruction is
On Mon, Feb 2, 2009 at 4:23 PM, Matthew Brecknell hask...@brecknell.orgwrote:
Luke Palmer wrote:
and pick out the ones which denote a total computable function [...]
How important is totality to this argument? If it is important, how do you
decide it?
It is at the very essence of the
Hi John,
I'm not sure how to interpret your remarks about has no effect and is
best. I guess they're subjective opinions, but maybe I'm missing something
objective in your intent. I can see, for instance, at least one way in
which layout has a direct and enormous effect on interaction
Neil Mitchell wrote:
* Part of it comes down to most developers not being Windows people.
That certainly describes me. I find the platform annoying and stressful
(all the worries about security).
But another issue is: it's proprietary and expensive.
The base OS isn't cheap, and doesn't even
Ah, that's nice! I never actually looked at your Cheat Sheet before
(thought it would be much shorter and not very useful :) ).
I will definitely forward this to the people in our project.
Still on the lookout for a DSEL tutorial though...
/ Emil
Justin Bailey skrev:
It's not a tutorial
Thomas Davie wrote:
This is caused by OS X's libiconv being entirely CPP
macros, the FFI has nothing to get hold of.
IIRC there's a ghc bug report open for it.
Judah Jacobson wrote:
The OS X system libiconv is actually OK; it's the MacPorts libiconv
that has the CPP macros...
Thanks for the
Hi Jeff
Thanks.
OpenVG is an interesting bit of kit, however...
VGU - the higher level layer - would be hard pressed to be less like
Haskell, you draw shapes and lines while passing a path handle around.
Also, Shiva-VG - http://sourceforge.net/projects/shivavg - the
implementation of OpenVG
On Mon, Feb 2, 2009 at 4:18 PM, Reid Barton rwbar...@math.harvard.eduwrote:
So here's a programming challenge: write a total function (expecting
total arguments) toSame :: ((Nat - Bool) - Nat) - (Nat - Bool,Nat
- Bool) that finds a pair that get mapped to the same Nat.
Ie. f a==f b
Ryan Ingram schrieb:
2009/2/2 Luke Palmer lrpal...@gmail.com:
However! If we have a function f : Nat - Nat - Bool, we can construct the
diagonalization g : Nat - Bool as: g n = not (f n n), with g not in the
range of f. That makes Nat - Bool computably uncountable.
This is making my head
On Mon, Feb 2, 2009 at 15:04, Don Stewart d...@galois.com wrote:
pocmatos:
Hi all,
Much is talked that Haskell, since it is purely functional is easier
to be verified. However, most of the research I have seen in software
verification (either through model checking or theorem proving)
dbueno:
On Mon, Feb 2, 2009 at 15:04, Don Stewart d...@galois.com wrote:
pocmatos:
Hi all,
Much is talked that Haskell, since it is purely functional is easier
to be verified. However, most of the research I have seen in software
verification (either through model checking or
On Mon, Feb 2, 2009 at 3:18 PM, Reid Barton rwbar...@math.harvard.edu wrote:
toSame f = (const True, head [ ( k) | k - [1..], f (const True) == f ( k)
])
Nice! I like it because at first look it seems like there's no reason
for this to terminate, but as you correctly argue, it always does.
--
Duncan Coutts duncan.cou...@worc.ox.ac.uk wrote:
That is probably how people are getting into this mess. Using upgrade
is not necessarily such a good idea. It does not distinguish between
the interesting packages you might want to upgrade and the core
packages that your probably do not want
1 - 100 of 126 matches
Mail list logo
