Re: Bitcoin scripting language extensions, collaboration requested

On 02/05/2014 04:43 PM, Jon Purdy wrote:

> First-order applicative languages are easy to give exact resource bounds
> for if you disallow recursion and dynamic allocation. This has been done
> quite successfully already (e.g. SPARK Ada).
>
> In a total higher-order language, you sacrifice less but can still get a
> tight upper bound.

First-order languages without recursion are trivial in this regard 
because you just go through the call tree and total up the amount of 
memory required for the stack at its highest point. You cannot get the 
same thing so easily with a higher-order language, and I'm not aware of 
any existing or proposed higher-order language that offers it. If you 
know of one, please share.

> A stack model is largely a convenience. Keep in mind that this is a
> bytecode, not a surface language.

If it is, I think I missed something: I thought this was for a contract 
scripting language as per the title. My impression was that people would 
be writing these contracts by hand -- or, if they're generated with some 
tool, reading them at the very least -- hence my tentative preference 
for a simple and readable applicative language.

- jn


------------------------------------

Yahoo Groups Links

<*> To visit your group on the web, go to:
    http://groups.yahoo.com/group/concatenative/

<*> Your email settings:
    Individual Email | Traditional

<*> To change settings online go to:
    http://groups.yahoo.com/group/concatenative/join
    (Yahoo! ID required)

<*> To change settings via email:
    [email protected] 
    [email protected]

<*> To unsubscribe from this group, send an email to:
    [email protected]

<*> Your use of Yahoo Groups is subject to:
    http://info.yahoo.com/legal/us/yahoo/utos/terms/