The scope:
-
Looking at the Hugs98 (November release) I found an
interesting extension: dynamic scoped variables.
(for reference, just read the Hugs98 documentation,
that can be found at their site).
http://www.cse.ogi.edu/PacSoft/projects/Hugs/hugsman/exts.html
This extension just come
| - Does other Haskell implementations (ghc, nhc, hbc, ...)
| would provide this extension in next releases? (This way,
| even been an extension, my system would be portable)
Jeff Lewis is well advanced with adding functional dependencies
into GHC; I believe that he plans then to add
Hi all,
John Hughes and I have been working on a Haskell
module called "QuickCheck", which allows one to
express properties about Haskell functions in
a program.
The module also provides functions that can
generate random test cases for these properties,
and perform the testing.
Here is an
José Romildo Malaquias:
One of the algorithms I have to implement is the
addition of symbolic expressions. It should have
two symbolic expressions as arguments and should
produce a symbolic expression as the result. But
how the result is produced is depending on series
of flags that
Hello,
operators with suitable associations defined). So
my symbolic expression type should be an instance
of the Num class so that the (+) operator can
be overloaded for it. But, as the function has
now three arguments, it cannot be a binary operator
anymore.
maybe, an ad-hoc solution is
PRELIMINARY ANNOUNCEMENT AND CALL FOR PAPERS
Haskell Workshop
Montreal, Canada, September 2000
The Haskell Workshop forms part of the PLI 2000
I had just a fast look at the following I found at the
page "http://www.cse.ogi.edu/PacSoft/projects/Hugs/hugsman/exts.html"
for dynamic scoping:
min :: [a] - a
min = least with ?cmp = (=)
Actually, I'm not sure how referential transparency can be established
with these implicit
"Ch. A. Herrmann" wrote:
I had just a fast look at the following I found at the
page "http://www.cse.ogi.edu/PacSoft/projects/Hugs/hugsman/exts.html"
for dynamic scoping:
min :: [a] - a
min = least with ?cmp = (=)
Actually, I'm not sure how referential transparency can be
On Wed, Dec 01, 1999 at 02:05:04PM +, Jerzy Karczmarczuk wrote:
José Romildo Malaquias:
One of the algorithms I have to implement is the
addition of symbolic expressions. It should have
two symbolic expressions as arguments and should
produce a symbolic expression as the result.
Simon Peyton-Jones wrote:
| - Does other Haskell implementations (ghc, nhc, hbc, ...)
| would provide this extension in next releases? (This way,
| even been an extension, my system would be portable)
Jeff Lewis is well advanced with adding functional dependencies
into GHC; I believe
On Wed, Dec 01, 1999 at 08:59:09AM -0800, Jeffrey R. Lewis wrote:
"Ch. A. Herrmann" wrote:
I had just a fast look at the following I found at the
page "http://www.cse.ogi.edu/PacSoft/projects/Hugs/hugsman/exts.html"
for dynamic scoping:
min :: [a] - a
min = least with ?cmp =
On Wed, Dec 01, 1999 at 01:33:01PM +0100, Ch. A. Herrmann wrote:
Hello,
operators with suitable associations defined). So
my symbolic expression type should be an instance
of the Num class so that the (+) operator can
be overloaded for it. But, as the function has
now three
Hi
When compiling the cvs ghc and hslibs from Nov 30 I found the following
problem.
Compiling hslibs/util/Select.lhs failed because it imported posix interface
files.
../../ghc/driver/ghc-inplace -syslib concurrent -syslib
posix -recomp -cpp -fglasgow-exts -fvia-C -Rghc-timing -O -split-objs
When compiling the cvs ghc and hslibs from Nov 30 I found the
following
problem.
Compiling hslibs/util/Select.lhs failed because it imported
posix interface
files.
../../ghc/driver/ghc-inplace -syslib concurrent -syslib
posix -recomp -cpp -fglasgow-exts -fvia-C -Rghc-timing -O
Hi,
it is mentioned in the user's guide,
http://haskell.org/ghc/docs/latest/users_guide/users_guide-5.html#glasgow-fo
reign-headers
Alternatively, you can use -optC-femit-extern-decls to have
ghc emit the proto of the function it assumes you're interfacing
to. (You may need a fairly recent
_After_ you apply the appended patch, -h (aka -hC, ie,
vanilla heap profiling) works in the CVS version of GHC (the
handling of CAFs seems to be weird at times, but maybe I
just don't understand how it works).
There probably are some bugs related to CAF handling the current profiling
Jerzy Karczmarczuk [EMAIL PROTECTED]:
: I don't fully understand the issue. If it is only
: a syntactic problem, and for a given chunk, say,
: a module, your set of flags is fixed, and does not change
: between one expression and another, you can always define
:
: add flagSet x y = ...-- your
Marc van Dongen wrote:
Unless I am missing somthing I think that in general
this is not just a syntactical issue. E.g. consider polynomial
remainder. At run time an order on terms is determined
(A term order is an order on terms. It is a generalisation of a
variable order). The order
I don't see a good reason why hSelect couldn't be changed to take
a TimeVal, as you suggest:
data TimeVal
= TimeVal { tv_sec :: Int
, tv_usec :: Int
}
I would either rely on the fact that the rep. of ClockTime is
exposed or write my own gettimeofday()
Hannah Schroeter [EMAIL PROTECTED] writes:
Hello!
On Wed, Dec 01, 1999 at 03:59:44PM -0800, Sigbjorn Finne wrote:
I don't see a good reason why hSelect couldn't be changed to take
a TimeVal, as you suggest:
data TimeVal
= TimeVal { tv_sec :: Int
,
Hello!
On Wed, Dec 01, 1999 at 03:59:44PM -0800, Sigbjorn Finne wrote:
I don't see a good reason why hSelect couldn't be changed to take
a TimeVal, as you suggest:
data TimeVal
= TimeVal { tv_sec :: Int
, tv_usec :: Int
}
I would either rely on
21 matches
Mail list logo
