[plt-scheme] type of language

From: Matthias Felleisen (matthias at ccs.neu.edu)
Date: Thu Dec 10 08:02:08 EST 2009

On Dec 10, 2009, at 2:43 AM, YC wrote:

> Having a static type system means that the compiler knows the type of every value and expression at compile time, before any code is executed.

This is of course true for Scheme programs. 

TST (The Scheme Type) is one of: 
 -- Number 
 -- Char 
 -- Symbol 
 -- TST -> TST 
 -- TST TST -> TST 

Then fact is that each expression has type TST. 

RealWorldHaskell is probably good at explaining how to use the language to count sheep. 
Your quotes suggest that these people haven't studied PL. 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20091210/a816f3bd/attachment.html>

Posted on the users mailing list.