Show instance for functions

(Difference between revisions)
 Revision as of 21:30, 18 December 2007 (edit) (give the lambda expression the fixed type Int -> Int in order to avoid effects of strange Num instance)← Previous diff Current revision (11:21, 5 February 2010) (edit) (undo)m (Statement that 2*x is faster than x+x is doubtful because generally (*) is slower than (+), but (*) by power of 2 may be optimized by shifts... New example is more clear I think.) Line 6: Line 6: Why is there a Show instance, but it only prints the type? Why is there a Show instance, but it only prints the type? - Text.Show.FunctPrelude> :m + Text.Show.Functions + Prelude> :m + Text.Show.Functions Prelude Text.Show.Functions> show Char.ord Prelude Text.Show.Functions> show Char.ord "" "" Line 20: Line 20: The Haskell compiler doesn't maintain the expressions as they are, but translates them to machine code or some other low-level representation. The Haskell compiler doesn't maintain the expressions as they are, but translates them to machine code or some other low-level representation. - The function \x -> x+x :: Int -> Int might have been optimized to \x -> 2*x :: Int -> Int. + The function \x -> x - x + x :: Int -> Int might have been optimized to \x -> x :: Int -> Int. The variable name x is not stored anywhere. The variable name x is not stored anywhere. You might have thought, that Haskell is like a scripting language, maintaining expressions at runtime. You might have thought, that Haskell is like a scripting language, maintaining expressions at runtime.

1 Question

Why is there no
Show
instance for functions for showable argument and value types? Why can't I enter
\x -> x+x
into GHCi or Hugs and get the same expression as answer?

Why is there a Show instance, but it only prints the type?

   Prelude> :m + Text.Show.Functions
Prelude Text.Show.Functions> show Char.ord
"<function>"


How can lambdabot display this:

   dons > ord
lambdabot>  <Char -> Int>


The Haskell compiler doesn't maintain the expressions as they are, but translates them to machine code or some other low-level representation.

The function
\x -> x - x + x :: Int -> Int
might have been optimized to
\x -> x :: Int -> Int
. The variable name
x
is not stored anywhere.

You might have thought, that Haskell is like a scripting language, maintaining expressions at runtime. This is not the case. Lambda expressions are just anonymous functions. You will not find a possibility to request the name of a variable at runtime, or inspect the structure of a function definition. You can also not receive an expression from the program user, which invokes variables of your program, and evaluate it accordingly. That is, Haskell is not reflexive. Everything can be compiled. A slight exception is hs-plugins.

Functional programming is about functions. A mathematical function is entirely defined by its graph, that is by pairs of objects (argument, value). E.g.

• $\sqrt{\ } = \{(0,0), (1,1), (4,2), (9,3), \dots \}$
• $(\lambda x.\ x+x) = \{(0,0), (1,2), (2,4), (3,6), \dots \}$

Since the graphs of $\lambda x.\ x+x$ and $\lambda x.\ 2\cdot x$ are equal these both expressions denote the same function. Now imagine both terms would be echoed by Hugs or GHCi as they are. This would mean that equal functions lead to different output.

The interactive Haskell environments use the regular
show
function,

and thus it would mean $\mathrm{show}(\lambda x.\ x+x) \ne \mathrm{show}(\lambda x.\ 2\cdot x)$. This would break referential transparency.

It follows that the only sensible way to show functions is to show their graph.

Prelude> \x -> x+x
functionFromGraph [(0,0), (1,2), (2,4), (3,6),
Interrupted.

One could do this for enumerable argument types, but it is not in the standard libraries.