Re: Glasgow haskell vs. Lispworks

On Aug 15, 8:56 am, Jon Harrop <j...@xxxxxxxxxxxxxxxxx> wrote:
...
OCaml has that behavior
# 3l == 3l;;
- : bool = false

Oh dear!

Equality is a special case of an equivalence relation; reflexive,
symmetric and transistive. Other than the (proper) determination of
equality, often it is the case that a module (structure in SML terms)
is needed to compute a desired quitvalence relation. For example,
ignoring the distinction between upper and lower case.

A very good introduction is found in

Daniel J. Velleman
How To Prove It: a structured approach

now, I think, in a second or third edition.

.

Relevant Pages

  • Re: Rich Comparisons Gotcha
    ... From a formal mathematical point of view, equality /is/ an equivalence ... equivalence relation, then it ain't the equality relation, and that's ... I'm talking about domain in the sense of "a particular problem domain". ... The same happens with trees. ...
    (comp.lang.python)
  • Re: An uncountable countable set
    ... Han de Bruijn wrote: ... which is an Equivalence Relation, which in turn is a "generalization" ... that EQUALITY HAS NEVER BEEN DEFINED. ... Consider the equally spaced staircase from to, as the number of steps increases from 1 without bound. ...
    (sci.math)
  • Re: JSH: Logic and paradox
    ... Equality is an equivalence relation. ... No offence, but even in logic you need context, you can't just take notation ... the equality symbol. ...
    (sci.math)
  • Re: More static type fun.
    ... > My original function said something like ... > (assuming that there exists a polytype equality function) ... 'a -> bool. ... val b = ref 5; ...
    (comp.lang.lisp)
  • Re: What is a proof, exactly?
    ... > the formalization of the list of theorems. ... That only the equality of sets may be considered relevant? ... If I have an equivalence relation ... becomes quite subtle now. ...
    (sci.math)