Newsgroups: comp.lang.scheme
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!gatech!newsfeed.internetmci.com!swrinde!sdd.hp.com!hplabs!hplntx!hplntx.hpl.hp.com!gjr
From: gjr@hplgr2.hpl.hp.com (Guillermo (Bill) J. Rozas)
Subject: Re: expressiveness and strong type system?
Sender: news@hpl.hp.com (HPLabs Usenet Login)
Message-ID: <GJR.96Mar20105605@hplgr2.hpl.hp.com>
In-Reply-To: blume@zayin.cs.princeton.edu's message of 14 Mar 1996 22:41:51 GMT
Date: Wed, 20 Mar 1996 18:56:05 GMT
Reply-To: gjr@hpl.hp.com
References: <OZ.96Mar14014447@nexus.yorku.ca> <hbaker-1403961017520001@10.0.2.15>
	<BLUME.96Mar14174151@zayin.cs.princeton.edu>
Nntp-Posting-Host: hplgr2.hpl.hp.com
Organization: Hewlett-Packard Laboratories, Palo Alto, CA
Lines: 17

In article <BLUME.96Mar14174151@zayin.cs.princeton.edu> blume@zayin.cs.princeton.edu (Matthias Blume) writes:

|   In article <hbaker-1403961017520001@10.0.2.15> hbaker@netcom.com (Henry Baker) writes:
|
|      A concrete example --
|      I contend that a type system that cannot type implementations of the Y
|      combinator restrict the expressiveness of the language.
|
|   I assume you refer to type systems that cannot type self-application...
|
|   Anyway, I am perfectly happy with a language and a decidable type
|   system, if it comes with a built-in Y combinator.

In my case I am more concerned with type systems that disallow
heterogenous lists, vectors, and other arbitrarily-sized "indexed"
data structures (not records) where the elements are of different
types.
