and hire Haskell programmers.
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
instance
AddressOf hdr addr. Hence, the type checker cannot use that information
either. Do you have a way to remedy that?
Cheers,
Tom
On Sat, Jan 3, 2009 at 8:35 PM, Thomas DuBuisson
thomas.dubuis...@gmail.com wrote:
Thank you all for the responses. I find the solution that omits type
families
meant to satisfy 'Heap h =', but this is ensured by putting
the context at all the points where a BootstrapHeap is created, and not
exporting BootstrapHeap's data constructors.
Regards,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
but not
functional dependencies.
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL PROTECTED]
url: http://www.cs.kuleuven.be/~toms/
___
Haskell-Cafe mailing list
Haskell-Cafe
]
both of them compile but the first is ugly and the second is
inefficient (Tags a new T for every hit).
Tom
2008/11/12 Paul Keir [EMAIL PROTECTED]:
Hi All,
If I have an ADT, say
data T
= A String Integer
| B Double
| C
deriving(Eq)
and I want to find if a list (ts) of type T
and FPGA design.
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of GHC 6.8.3 does not have a
driver/package.conf.inplace in ghc-6.8.3/lib. Any ideas?
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Don thinking that compiler developer fragmentation doesn't help now the language
research is 'done'
Language researchers should move to a new language?
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail
Thanks for all the input. It helped me arrive at the following
solution. I took the strategy of converting the parameterized type
into an unparameterized type which can be easily compared for Eq and
Ord. The unparameterized type enumerates the possible Const types
with help from an auxiliary
:: a - Term a
Equal :: Term a - Term a - Term Bool
How would you then define:
Const a === Const b = ...
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Maybe you want something like
curryWithList :: ([a]-b)-[a]-([a]-b)
curryWithList f lst1= \lst2 -f (lst1++lst2)
addThemUp = sum
curried = curryWithList addThemUp [1,2,3,4]
curried [5] =15
On Thu, Aug 7, 2008 at 8:35 PM, Henning Thielemann
[EMAIL PROTECTED] wrote:
On Thu, 7 Aug 2008, Sukit
a memcpy-like function where I could copy the entire
array into the new one instead of copying it one value at a time? Is
there another solution that I'm missing?
--
Tom Harper
MSc Computer Science '08
University of Oxford
Mobile: +44 (0)7533 998 591
Skype: +1 949 273 4627 (harpertom
Why not just read it into a lazy ByteString? Are you looking to use an
array with elements of a different type? You could then convert it to a
strict ByteString.
b
Because I'm writing the Unicode-friendly ByteString =p
--
Tom Harper
MSc Computer Science '08
University of Oxford
looking for something like QuickCheck, but that
helps with generating repeatable tests to measure performance. Is
there anything out there that anyone would recommend?
--
Tom Harper
MSc Computer Science '08
University of Oxford
Mobile: +44 (0)7533 998 591
Skype: +1 949 273 4627 (harpertom
drivers or the
open-source COMEDI project, or similar hardware? Would anyone be
interested in helping out with this driver binding?
Regards
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Yes. I guess I have to wait for chapter 19, then?
Tom
On Tue, May 13, 2008 at 7:35 PM, Don Stewart [EMAIL PROTECTED] wrote:
tanielsen:
Hello,
I would like to use a lazy, purely functional language to create an
experiement description (and execution!) language for cellular
of a closed world. That's contrary to
the open world view of regular type classes. So these aren't the intended
semantics.
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL PROTECTED]
url: http
On Fri, 25 Apr 2008, Hans Aberg wrote:
On 25 Apr 2008, at 14:20, Tom Schrijvers wrote:
Prolog works under the assumption of a closed world. That's contrary to the
open world view of regular type classes. So these aren't the intended
semantics.
By which I gather you mean the interpretation
hackageDB has a substantial sample of code these days, which is handy
for questions like this.
Thanks, Ross. These examples are perfect!
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL
strange, because there is no alternative for
y (except if you allow overlapping instances and add e.g. an instance C
[a] [b] [Int]).
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL
| a - b
has a non-full functional dependency a - b which does not involve c.
Thanks,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL PROTECTED]
url: http://www.cs.kuleuven.be/~toms
String = ..
type instance Id Int= ..
..
But in a degenerate case there could be just this one instance:
type instance Id x = GADT x
which then reduces this example to the GADT case of which you said that is
was clearly parametric.
Tom
--
Tom Schrijvers
Department of Computer
Hi Tom,
It seems we are thinking of different things. I was referring to
the characterization of a type of the form P = t as being ambiguous
if there is a type variable in P that is not determined by the
variables in t; this condition is used in Haskell to establish
coherence (i.e., to show
in the design space.
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL PROTECTED]
url: http://www.cs.kuleuven.be/~toms/
___
Haskell-Cafe mailing
you get
(Id a - Id a) ~ (Id alpha - Id alhpa)
This equation reduces to Id a ~ Id alpha. Our algorithm stops here. There
is in general no single solution for alpha (*) in such an equation, as
opposed to the above case.
I hope this clarifies our algorithm.
Cheers,
Tom
All the best
not the fastest, just like GCC doesn't generates the fastest code.
Who cares?
If you want speed, then Yap is the best open Prolog system.
http://www.ncc.up.pt/~vsc/Yap/
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
can properly focus on this issue and consider different design choices.
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL PROTECTED]
url: http://www.cs.kuleuven.be/~toms
.
Tom
I have my suspicions about your mentioning of both Functor (F d) and
Functor (F a) in the signature. Which implementation of fmap do you want?
Or should they be both the same (i.e. F d ~ F a)?
This is an hard question to which the answer is both.
In the definition of an hylomorphism I
? Are they such that F d c ~ F a (c,a) can
hold?
By the way, for your function, you don't need equations in your type
signature. This will do:
hyloPara ::
Functor (F d)
= d
- (F d c - c)
- (a - F d a)
- a
- c
Cheers,
Tom
--
Tom Schrijvers
d) and
Functor (F a) in the signature. Which implementation of fmap do you want?
Or should they be both the same (i.e. F d ~ F a)?
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL PROTECTED
. We
can't have that in a deterministic functional language. Hence the error.
Adding a type signature doesn't change the matter.
Providing an additional argument, as you propose, resolves the ambiguity.
I hope this helps.
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U
another point in the design space
here.
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL PROTECTED]
url: http://www.cs.kuleuven.be/~toms/
___
Haskell-Cafe
:
forall a b . T a = T b = a = b
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL PROTECTED]
url: http://www.cs.kuleuven.be/~toms/
___
Haskell
for simulation regression
suites -- maybe QuickCheck in combination with a system modeling and
verification DSL.
If interested, send a resume.
Thanks!
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Are there generally accepted English language names for the arrow combinators?
compose?
pair?
etc...
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
not think of this. Of course, now that you have
me reading up on Yhc.Core, option #5 is looking considerably more fun.
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
a clean cut-point, from which I
can start from a fully type-checked, type-annotated intermediate
representation?
And thanks for the link to John's paper describing Hydra's use of
Template Haskell. I will definiately consider TH.
-Tom
___
Haskell-Cafe
approach I can take to extract
common subexpressions? I should point out I have an opportunity to
get Haskell on a real industrial application. But if I can't solve
this problem, I may have to resort to far less eloquent languages.
:-(
Thanks for any and all help.
-Tom
On Jan 13, 2008 7:55 AM, Fernando Rodriguez [EMAIL PROTECTED] wrote:
If I define the follwoing functions:
car (x:_) = x
car [] = []
What's the type signature for that function?
Cheers!
--Tom Phoenix
___
Haskell-Cafe mailing list
Haskell-Cafe
I had been subscribed to, but I didn't think
too much about it.
http://www.unicom.com/pw/reply-to-harmful.html
Cheers!
--Tom Phoenix
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
is a comment by Luis Cabellos. Does that
comment bring you any closer to enlightenment?
Cheers!
--Tom Phoenix
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
for you out of the box, but it's
open
source so you might be able to adapt it.
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
. At the backend, atom generates C and
Simulink models. The Verilog and VHDL generators have been dropped,
but they may reappear in the future.
Enjoy!
http://funhdl.org/
darcs get http://funhdl.org/darcs/atom
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe
We're pleased to invite you to SingHaskell:
What is SingHaskell?
Sing(apore)Haskell is a Haskell (and related languages) meeting in
Singapore. The meeting is organized by Tom Schrijvers and Martin Sulzmann
and will be hosted by the National University of Singapore.
Date and location
Sing
/stream-fusion-0.1.1
As described in the recent paper:
Stream Fusion: From Lists to Streams to Nothing at All
Duncan Coutts, Roman Leshchinskiy and Don Stewart. ICFP 2007
This is a drop-in replacement for Data.List.
Will it eventually replace Data.List in GHC?
Tom
--
Tom Schrijvers
:
- Control theory.
- Real-time, embedded programming.
- Automotive and industrial systems.
- Hydraulics and fluid power.
If interested, send me a resume.
Thanks!
-Tom Hawkins
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
Newbie question:
I was wondering the other day if type synonyms might be more useful
if they were more restricted, that is, with the definitions:
type Foo = String
type Bar = String
foo :: Foo
foo = a foo
bar :: Bar
bar = a bar
x :: Foo - ...
x f b = ...only valid for Foo Strings...
both 'x
Andrew Wagner wagner.andrew at gmail.com writes:
If you change your type declarations to 'newtype' declarations, I
believe you would get the effect that you want, depending on what you
mean by 'equivalent'. In that case, Foo and Bar would essentially be
strings, but you could not use either
Hi Paul --
The function you want is called fromIntegral, and works for all Integral types.
Using it, you can add a type signature to specify what you want to
change the number to (Float, Double, other Integral type, etc.
Example:
fromIntegral (4 :: Int) :: Double
4.0
Hope this helps!
--
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Tom Harper
[EMAIL PROTECTED]
+1 949 235 0185
Public Key: http://aftereternity.co.uk/rth.asc
___
Haskell-Cafe mailing
enjoyed very much the story). From the
response below I think my thickness is showing too much and I'll try a
little harder on my own first.
Thanks again,
Chris Saunders
-Original Message-
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Tom Harper
Sent: September-06
of findIndex and
splitAt.
Instead of translating Nothing to -1 and Just i to i, you could use
the result of findIndex directly in a case expression.
Correctness
*Main period 8 70 10
(6,([0],[5,7,1,4,2,8]))
That should be (6,([1],[1,4,2,8,5,7])).
Regards,
Tom
to get to each partial sum. I coded one using
Data.Map, but it's a bit long-winded and ugly. Perhaps a
purpose-built heap monad would make it more elegant... as long as it
could be reused elsewhere. Just musing. :-)
- Tom
___
Haskell-Cafe
| I think the implementation is some 90% complete though, in GHC head.
| Certainly you can write many associated types programs already -- the
| missing part is finishing off associated type synonyms, iirc.
...and we have a working implementation of that too, thanks to Tom
Schrijvers. It's
with an equivalent
expression.
Tom
Having serialize in the IO monad would do no harm as usually one serialise
precisely to output a value :-)
So, is it correct to conclude that there is no theoretical reason why Haskell
cannot have a built-in reification/serialisation facility?
titto
On Wednesday 20
On Thu, 21 Jun 2007, Pasqualino 'Titto' Assini wrote:
Hi Tom,
On Thursday 21 June 2007 08:59:42 Tom Schrijvers wrote:
On Thu, 21 Jun 2007, Pasqualino 'Titto' Assini wrote:
Thanks for the explanation.
But, doesn't this simply mean that the correct signature would be:
serialize :: (Int - Int
Tom Schrijvers wrote:
I understand that, depending on what the compiler does the result of :
do
let f = (*) 2
print $ serialise f
might differ as, for example, the compiler might have rewritten f as
\n -
n+n.
But, why would that make equational reasoning on serialise not valid?
Isn't
On Thursday 21 June 2007, Tom Schrijvers wrote:
That wouldn't make a difference. If, from the pure Haskell point of view
we can't tell the difference between two expressions that denote the same
function, then operations in the IO monad should not be able to do so
either.
This doesn't make
thought I would throw the idea out there and see if
anyone knows of anything similar that has already been done before
Do you know about Pugs?
http://www.pugscode.org/
Hope this helps!
--Tom Phoenix
___
Haskell-Cafe mailing list
Haskell-Cafe
-- [(ab,),(b,a),(a,b),(,ab)]
then you can use it both for dividing the initial list into kept and
discarded elements, and for dividing a list between a left subtree and a
right subtree.
Regards,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
{}{{}}2 {=}{{=}}2
{|}{{$\mid$}}1
}
That replaces various strings (including ++) with their symbol
equivalents and generally makes things quite pretty.
Tom
[1]: http://haskell.org/hawiki/LiterateProgramming
On 6/8/07, Andrew Coppin [EMAIL PROTECTED] wrote:
Does
somewhere than ascribing
a Hebrew origin for his name.
I found this:
HASKEL: Hebrew name meaning intellect. Variant, Haskell, exists.
in a list name explanations:
http://www.smcm.edu/users/saquade/names.html
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
optimization setting. Hackers are always appreciated!
Such a GHC hack may have to be limited to some known, standard numeric
types. User-defined numeric types may not provide anything that you
can use to look up a jump table.
How would an array go, as a user-level optimisation?
Regards,
Tom
-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Tom Harper
Computer Science Major '07
Syracuse University
+1 949 235 0185
Public Key: http://aftereternity.co.uk/rth.asc
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
a, OneStep (OS a)) = TwoStep a
type TS a = OS (OS a)
which are currently under development.
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL PROTECTED
haskell.org or Mac Ports?
Which emacs build? etc
Johan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Tom Harper
Computer Science Major '07
Syracuse University
+1 949 235 0185
Public Key
-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Tom Harper
Computer Science Major '07
Syracuse University
+1 949 235 0185
Public Key: http://aftereternity.co.uk/rth.asc
___
Haskell-Cafe mailing list
a for which the instance C a b is
completely independent of b. There is no ambiguity.
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL PROTECTED]
___
Haskell-Cafe
...
Another solution would be loop fusion:
do l - readFile foo
len - writeFileAndComputeLength bar l
...
A compiler might be able to do that for you.
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16
with a Scottish
accent? :)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Tom Harper
Computer Science Major '07
Syracuse University
+1 949 235 0185
Public Key: http://aftereternity.co.uk/rth.asc
for it.
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
the polymorphism get destroyed?
Here fn is bound by a lambda abstraction, and is therefore
monomorphic. I can't find anything in the Report about that,
This won't be in the Haskell 98 report. I have to enable -fglasgow-exts in
GHCi to get this even parsed.
Tom
--
Tom Schrijvers
Department
and I can't really see a downside. If you're interested the
Darcs repository is at:
http://www.almostobsolete.net/bloom/
Tom
On 5/1/07, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
G'day.
Quoting tom [EMAIL PROTECTED]:
I'm pretty new to Haskell, I've been working on a Bloom filter[1
the Haddock docs for it online at:
http://www.almostobsolete.net/doc/html/Data-yBloom.html
All comments will be very much appreciated :p
Thanks
Tom
[1] There's a nice description of what a Bloom filter is here:
http://www.cs.wisc.edu/~cao/papers/summary-cache/node8.html
On 4/29/07, Georg Sauthoff [EMAIL PROTECTED] wrote:
On 2007-04-29, Tom Hawkins [EMAIL PROTECTED] wrote:
Hi,
[..]
I haven't done this before in any language, so any tips would be
appreciated. From what I gather, a call to posix_openpt or openpty
returns a master and a slave
opening /dev/ptmx
followed by calls to grantpt and unlockpt.
I'm building a load balancing and sharing system similar to Platform's
LSF. The pseudo terminal is for interactive jobs running on a remote
machine.
Thanks for any help!
-Tom
___
Haskell-Cafe
whether there's already a solution
for that in the repository?
Tom
Cheers,
Monique
On 4/24/07, Simon Marlow [EMAIL PROTECTED] wrote:
Tom Schrijvers wrote:
Here's the more complete error message:
configure:3321: checking for C compiler default output file name
configure:3348: c:/MinGW/bin
on a simple C
program?
I had a similar error, cause by the fact that gcc.exe cannot find cc1.exe,
which is in MingW/libexec/gcc/mingw32/3.4.2/. I had to add it to my PATH.
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel
On Mon, 23 Apr 2007, Monique Monteiro wrote:
Tom,
On 4/23/07, Tom Schrijvers [EMAIL PROTECTED] wrote:
What does the config.log say?
Are you able to run the MingW's gcc compiler yourself on a simple C
program?
I had a similar error, cause by the fact that gcc.exe cannot find cc1.exe
/
-Tom
A few details: The Atom compiler attempts to maximize the number of
rules that can execute in a given clock cycle without breaking the
semantics of one-rule-at-a-time. For simplicity, rules are assigned
a global, linear priority. Data dependencies between rules form a
graph. A acyclic
, all references could be automatically updated. When an
expression is either moved or copied into a new lexical scope, the
variable references could be automatically rebound to variable
definitions in the new scope. Unmatched referenced names and
ambiguous names would be highlighted in red.
-Tom
)
In my case, many of the branches in the tree are the same. I suspect
the fixed point operation mentioned in the thread speeding up
fibonacci with memoizing is applicable, but I'm having a tough time
making the connection.
-Tom
___
Haskell-Cafe mailing list
On 2/21/07, Chad Scherrer [EMAIL PROTECTED] wrote:
Tom,
I think inserting elements would be a lot faster than multiple unions.
I would try:
leafList :: Tree - [Int]
leafList (Leaf n) = [n]
leafList (Branch left right) = leafList left ++ leafList right
leaves = fromList . leafList
If you're
1972)(Con 2))(Con 23))
error = (Div(Con 1)(Con 0))
I get the ERROR message when I type eval answer at the Hugs prompt.
Thanks!
Tom Titchener
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 11/1/06, Farida Mishra [EMAIL PROTECTED] wrote:
i would like to post mesg this list
Your wish has been granted.
Cheers!
--Tom Phoenix
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
the
compiler does, because I've searched the web before and i found very little
on this topic.
You need to search for the word memoize (or memoise). Here's a
page about a memo function for GHC.
http://www.haskell.org/ghc/docs/6.4.2/html/hslibs/memo-library.html
Hope this helps!
--Tom Phoenix
/WORDS1/
Of course, you don't have access to these other programs for
comparison; but I hope that this gives you a better idea of the size
(and manageability) of the task.
Good luck with it!
--Tom Phoenix
___
Haskell-Cafe mailing list
Haskell-Cafe
On 9/9/06, Ashley Yakeley [EMAIL PROTECTED] wrote:
Is it possible to write nondet?
Yes; it (or something very similar) is discussed here:
http://www.haskell.org/haskellwiki/Timing_out_computations
Hope this helps!
--Tom Phoenix
___
Haskell
, from the Numeric module. There's also
the Text.Printf module. Or you could write your own display code; but
it's tricky to get it right for every possible case.
http://haskell.org/ghc/docs/latest/html/libraries/base/Numeric.html#v%3AshowFFloat
Hope this helps!
--Tom Phoenix
to answer no more matches rather than infinitely many
matches once the body fails to consume any characters.
Hope this helps!
--Tom Phoenix
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
this cause a conflict with specialized knowledge the compiler has
about if-then-else, e.g. for optimizations?
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL PROTECTED
.
It's probably good to read a bit about it in a proper reference.
Wikipedia's Prolog entry lists a number of tutorials.
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL PROTECTED
deriving Show
-- This is identical to what Tom Schrijvers wrote
class Commutable a b c d |
a b c - d, -- 2.
a d c - b -- based on 1. + 2.
-- But how do we make sure that Commutable a d c b exists whenever
-- Commutable a b c d does? very easily: with the help
instances of CommutativePartners can be declared.
Support for closed type classes is needed to prevent this.
I'm not sure whether there is a way to fully realise requirement 1.
AFAIK associated types are no more expressive than FDs.
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U
comparing a number of all_different algorithms and additional
tricks:
http://www.computational-logic.org/iccl/master/lectures/winter05/fcp/fcp/sudoku.pdf
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e
a strategy language though.
Cheers,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: [EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
Tom Davies tomdavies at exemail.com.au writes:
[snip]
Apologies for the complete misinformation! I don't know what I was thinking!
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
)
the error reads thus
ERROR file:.\VicotriaLine.txt:107 - Type error in final generator
*** Term : newLine !! 0
*** Type : (Int,Int)
*** Does not match : IO a
newLine is already defined -- call it 'x' instead and !! will do what you
expect.
Tom
It appears runCommand uses /bin/sh by default, but our environment
needs tcsh. Is there any way to set an alternative shell?
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
function:
data F a = F (a - (F a ,a))
call :: F a - a - (F a, a)
call (F f) a = f a
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
501 - 600 of 681 matches
Mail list logo