Reginald Meeson <[EMAIL PROTECTED]> asks:
| This issue isn't really one of language definition, though. It seems
| to me it's an issue for programming support environments. I don't
| know of any language standard that includes requirements for
| debugging tools. Any implementers willing to gi
Reply to: RE>Function denotations
I'm sure many people would find printable function representations
useful. There are at least three versions of every function I've ever
written: the function I meant (fm), the function I wrote (fw), and
the function the compiler/interpr
Greg argument's about function denotations is valid up to a point. However,
when optimising functional programs we rely on *denotational* equivalence
to justify substitution, not just beta equivalence. So for example, we
can prove that
foldr (:) [] = id :: [a]->[a]
in the sense th
John Launchbury writes:
Greg argument's about function denotations is valid up to a point. However,
when optimising functional programs we rely on *denotational* equivalence
to justify substitution, not just beta equivalence. So for example, we
can prove that
foldr (:) []
I would like to see function value representations in Haskell. I am
familiar with, though do not fully understand, David Lester's argument
about full abstraction. Getting into this in any detail involves
talking about the relative merits of operational and denotational
semantics. The debate certa
Greg,
Full abstraction: there is junk in the standard denotational domains,
in particular a parallel or function (por). We can write two new
functions f1 and f2, such that f1 por = 1 and f2 por = 2, (and both
give bottom for other boolean functions of the correct type).
So: does f1 = f2? Using
> It would be nice if future Haskell implementations were able to display
> function values in some standard form. In particular, closures might
> be represented as local definitions binding free variables in a
> final function value representation.
I'm not so sure that this would be very nice.
It would be nice if future Haskell implementations were able to display
function values in some standard form. In particular, closures might
be represented as local definitions binding free variables in a
final function value representation.
There are two arguments against this. The first is phi
