* RE: [Caml-list] Why type infenere enter infinte loop here?
@ 2004-07-06 23:41 Kevin S. Millikin
0 siblings, 0 replies; 2+ messages in thread
From: Kevin S. Millikin @ 2004-07-06 23:41 UTC (permalink / raw)
To: 'Andy Yang', caml-list
On Tuesday, July 06, 2004 5:25 PM, Andy Yang [SMTP:yyu08@yahoo.com] wrote:
> Hi, all
>
> I am relatively new in Ocaml. Perhaps this problem is
> trivial. With the following interactive process, ocaml
> cannot give out f2's type. Could you tell me why it
> cannot?
>
>
> # let rec y f = f (fun x ->(y f) x);;
> val y : (('a -> 'b) -> 'a -> 'b) -> 'a -> 'b = <fun>
> # let g h x = h x;;
> val g : ('a -> 'b) -> 'a -> 'b = <fun>
> # let f1 = y g;;
> val f1 : '_a -> 'b = <fun>
> # let k x = x * x + 1;;
> val k : int -> int = <fun>
> # let f2 = f1 k;;
>
For the same reason that it does not print the type of
# while true do () done;;
y is a fixpoint combinator. g is the application combinator (Curry's B
combinator). f1 is the fixpoint of application, which does not
terminating. Your definition of f1 is the same as
# let f1 = y (fun h x -> h x);;
which is the same as
# let rec f1 = fun x -> f1 x;;
An application of f1 will not terminate. The typechecker is perfectly h
appy to determine that your f2 has type 'a -> 'b, but it won't print that
type until it finishes computing the value.
-- Kevin
-------------------
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
^ permalink raw reply [flat|nested] 2+ messages in thread
* [Caml-list] Why type infenere enter infinte loop here?
2004-07-02 17:54 [Caml-list] Y combinator and type-checking Brian Hurt
@ 2004-07-06 23:24 ` Andy Yang
0 siblings, 0 replies; 2+ messages in thread
From: Andy Yang @ 2004-07-06 23:24 UTC (permalink / raw)
To: caml-list
Hi, all
I am relatively new in Ocaml. Perhaps this problem is
trivial. With the following interactive process, ocaml
cannot give out f2's type. Could you tell me why it
cannot?
# let rec y f = f (fun x ->(y f) x);;
val y : (('a -> 'b) -> 'a -> 'b) -> 'a -> 'b = <fun>
# let g h x = h x;;
val g : ('a -> 'b) -> 'a -> 'b = <fun>
# let f1 = y g;;
val f1 : '_a -> 'b = <fun>
# let k x = x * x + 1;;
val k : int -> int = <fun>
# let f2 = f1 k;;
Thanks a lot!
Andy
__________________________________
Do you Yahoo!?
Yahoo! Mail - 50x more storage than other providers!
http://promotions.yahoo.com/new_mail
-------------------
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
^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~2004-07-06 23:42 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2004-07-06 23:41 [Caml-list] Why type infenere enter infinte loop here? Kevin S. Millikin
-- strict thread matches above, loose matches on Subject: below --
2004-07-02 17:54 [Caml-list] Y combinator and type-checking Brian Hurt
2004-07-06 23:24 ` [Caml-list] Why type infenere enter infinte loop here? Andy Yang
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox