The support languages for the "Programming Languages: Application and Interpretation" textbook by Shriram Krishnamurthi are now part of PLT Scheme. In addition, a random mutator generator for testing garbage collectors and a new heap visualizer GUI were added by Robby Findler.
On Thu, Apr 1, 2010 at 8:29 AM, Robby Findler <[email protected]> wrote: > I don't think you need to mention me. :) but you could also mention the new > GUI? > > Robby > > On Thursday, April 1, 2010, Jay McCarthy <[email protected]> wrote: >> On Thu, Apr 1, 2010 at 2:56 AM, Eli Barzilay <[email protected]> wrote: >>> Possible items (dug up from log messages): >>> >>> Robby: >>> - New language dialog layout >>> >>> Matthew: >>> - Futures are on by default >>> - wrap each top-level form in a module with a prompt (if visible >>> enough) >>> - basic set library >>> - things from r18375, if visible enough >>> - scribble/jfp >>> >>> * Noel, Ryan: >>> - schemeunit is now included (gui revived?) >>> >>> * Sam: >>> - Add `define-predicate'; add `with-type' for defintions; New TS >>> guide. (Maybe more?) >>> >>> * Casey: >>> - redex extensions? random testing? >>> >>> * Matthias: >>> - release events? other universe stuffs? >>> >>> * Jay: >>> - Adding PLAI software to the core >>> - r18130, if there's anything visible >> >> The support languages for the "Programming Languages: Application and >> Interpretation" textbook by Shriram Krishnamurthi are now part of PLT >> Scheme. In addition, a random mutator generator for testing garbage >> collectors was added by Robby Findler. >> >> The Scheme-implemented bytecode reader, writer, and decompiler is now >> more compatible with >> the C-implemented bytecode reader and writer. >> >>> >>> * Ryan: >>> - misc syntax-parse additions (r17937, and probably more) >>> >>> * Carl: >>> - contract stuff (r18009 and probably more) >>> >>> * Stevie: >>> - class contracts? >>> >>> Sketch items: >>> >>> * New Russian and Ukranian translations, thanks to Sergey Semerikov >>> >>> * Generators now support producing multiple values (by giving >>> sending multiple input values to `yield') and consuming multiple >>> values (by sending values to the generator function) which turn to >>> the results of `yield' in the generator. The `generator' form has >>> changed and requires to have a (generator () body ...) form, and >>> in the future this will be used for bindings to initial values >>> when the generator is first invoked. >>> >>> -- >>> ((lambda (x) (x x)) (lambda (x) (x x))) Eli Barzilay: >>> http://barzilay.org/ Maze is Life! >>> _________________________________________________ >>> For list-related administrative tasks: >>> http://list.cs.brown.edu/mailman/listinfo/plt-dev >>> >> >> >> >> -- >> Jay McCarthy <[email protected]> >> Assistant Professor / Brigham Young University >> http://teammccarthy.org/jay >> >> "The glory of God is Intelligence" - D&C 93 >> _________________________________________________ >> For list-related administrative tasks: >> http://list.cs.brown.edu/mailman/listinfo/plt-dev >> > -- Jay McCarthy <[email protected]> Assistant Professor / Brigham Young University http://teammccarthy.org/jay "The glory of God is Intelligence" - D&C 93 _________________________________________________ For list-related administrative tasks: http://list.cs.brown.edu/mailman/listinfo/plt-dev
