Racket, the system formerly known as PLT Scheme, has just been released.
PLT is happy to announce the release of Racket, available from
http://racket-lang.org/
With Racket, you can script command shells and web servers; you can quickly prototype animations and complex GUIs; regexps and threads are here to serve you. To organize your systems, you can mix [...]
New paper from Stephen Chang, David Van Horn, and Matthias Felleisen, appearing at Trends in Functional Programming 2010: Evaluating Call By Need on the Control Stack.
Abstract:
Ariola and Felleisen’s call-by-need λ-calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substitution, function applications—once established—are never discharged. In [...]
Sunday, February 28, 2010
This should keep you busy.
NJPLS:
The next NJPLS will be on Friday April 9 at Stevens Institute of
Technology. If you would like to present a cool idea to the NJPLS
community, please send me your talk request by March 17. Please send me
an email with your talk title and abstract. All topics in programming
languages and [...]
University of Oregon is hosting another Oregon Programming Languages Summer School this June. This year’s topic is Logic, Languages, Compilation, and Verification:
Everyday life and critical aspects of our economy, defense, and government depend on software, and software, in turn, depends on high-level programming languages and their efficient implementations. Ever since Fortran and its automatic [...]
The Fortress folks have announced a new blog:
The Fortress team has started a blog, to post a series of
announcements and news items about Fortress. Our goal is to let
people know about ongoing technical discussions and decisions, as well
as the current status of the implementation. We will also post
interesting examples of Fortress code. [...]
The Higher-Order Flow Analysis Forum has just been set up:
The HOFA forum is an email forum for the discussion and dissemination of research results in the area of higher-order flow analysis, broadly construed, within computer science and related disciplines. Flow analysis and related static analyses are a fundamental tool for program verification, bug detection, compiler [...]
Wednesday, September 23, 2009
A new SRFI for inspecting the arity of procedures:
Many Scheme systems provide mechanisms for inspecting the arity of a procedural value, making it a common feature, however there is no standard interface. As a result there is no portable way to observe the arity of a procedure without actually applying it. This SRFI proposes a [...]
Thursday, September 17, 2009
A new SRFI for purely functional random-access lists:
Functional programming and list hacking go together like peanut butter and jelly, eval and apply, syntax and semantics, or cursing and recursing. But the traditional approach to implementing pairs and lists results in index-based access (list-ref) requiring time proportional the index being accessed. Moreover, indexed-based functional update [...]
Tuesday, September 15, 2009
A new blog has been created for the Wand Symposium and Festschrift:
In the coming months, presenters and editors will be working on a Festschrift in honor of Mitch, as a special issue (or issues) or Higher-Order and Symbolic Computation. We’ll also be adding links to the presentation slides and videos as they become available. We’ll [...]
The Complexity of Flow Analysis in Higher-Order Languages: Abstract, Dissertation, Slides.