Re: [stack] Parameters: ordered versus named

On Sep 9, 2007, at 19:12 , Christopher Diggins wrote:

> On 9/8/07, Don Groves <[email protected]> wrote:
>> On Sep 8, 2007, at 19:44 , Christopher Diggins wrote:
>>
>>>> Just before falling asleep last night, it hit me what has caused my
>>>> confusion
>>>> about all this: I've been thinking of the interactive user, not
>>>> running an already
>>>> compiled program. Of course, when a program has been fed through  
>>>> the
>>>> interpreter without errors, stack- and type checking is no longer
>>>> necessary.
>>>> Thanks for you help!
>>>
>>> An interpreter can still be statically typed. Each expression fed  
>>> into
>>> the interpreter can be type-checked before it is run, and compared
>>> with the current stack configuration. AFAIK this is a property
>>> particular to languages with compositional type systems (e.g.
>>> statically typed concatenative languages!)
>>>
>>> -D
>>
>> Thanks for the info. In what ways does Cat's inferred type system
>> differ?
>> --
>
> From what?
>
> -Christopher

 From an "uninferred" one. I'm thinking a large part of my problem is
lack of vocabulary. I tried to find a definition of an "inferred" type
system via Google but was unsuccessful.
--
Don