|
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: "Christopher Diggins" <cdigg...@gmail.com>
Date: 21 Dec 2006 16:59:18 -0800
Local: Thurs, Dec 21 2006 7:59 pm
Subject: Inferring Recursive Types
In Combinator theory the combinator SII (a.k.a. M or Mockingbird)
applies a function to itself. \a.aa I notice that SML 98 and F# can't infer the type (e.g. let M a = a a ). Why don't the type systems to those languages simply output something M : 'a.('a -> 'b) -> 'b Thanks in advance, 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.
| |||||||||||||