Version française
Home     About     Download     Resources     Contact us    
Browse thread
[Caml-list] simple typing question
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Pierre Weis <pierre.weis@i...>
Subject: Re: [Caml-list] simple typing question
> what about changing the semantic of partial application, restoring
> eta-equivalence: a function is not evaluated unless every arguments
> are given:

Could you precisely state this notion ? In the presence of higher
order functions and imperative features, this does not appear to be
simple and evident to me...

(Let alone recursive functions and types as in
$ ocaml -rectypes
        Objective Caml version 3.04+15 (2002-06-18)

# let rec print x = print_int x; print;;
val print : int -> 'a as 'a = <fun>
# print 1 2 3;;
123- : int -> 'a as 'a = <fun>
)

Best regards,

Pierre Weis

INRIA, Projet Cristal, Pierre.Weis@inria.fr, http://pauillac.inria.fr/~weis/


-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners