|
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 |
Newsgroups: comp.lang.functional
From: Mark.Carr...@Aetion.com (Mark T.B. Carroll)
Date: Thu, 21 Dec 2006 20:45:07 -0500
Local: Thurs, Dec 21 2006 8:45 pm
Subject: Re: Inferring Recursive Types
"Christopher Diggins" <cdigg...@gmail.com> writes: Well, it's not that simple. The function a doesn't take an 'a as first > let M a = a a > Why don't the type systems to those languages simply output something > like: > M : 'a.('a -> 'b) -> 'b argument, it takes a function that takes, er, something with the same signature as the function a, and outputs a b. The something is the tricky bit - you get a sort of infinitely recursive type if you follow the reasoning. Whether the languages' difficulty with this is a bug or a feature, I don't know. Mark. -- You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
| |||||||||||||