[Prev][Next][Index][Thread]
Consel T 7/19, 1200
-
To: colloquia%corwin.ccs.northeastern.edu@RELAY.CS.NET, lieber%corwin.ccs.northeastern.edu@RELAY.CS.NET, abbas%corwin.ccs.northeastern.edu@RELAY.CS.NET, zywang@bleys.LCS.MIT.EDU, woolf@eric.LCS.MIT.EDU, oliva%corwin.ccs.northeastern.edu@RELAY.CS.NET, holland%corwin.ccs.northeastern.edu@RELAY.CS.NET, riel%corwin.ccs.northeastern.edu@RELAY.CS.NET, bwhite%.umb.edu@RELAY.CS.NET, gerald%grn.umb.edu@RELAY.CS.NET, muller@bu-cs.bu.edu, kfoury@bu-cs.bu.edu, raf@bu-cs.bu.edu, dsmith%cs.brandeis.edu@RELAY.CS.NET, jmiller%cs.brandeis.edu@RELAY.CS.NET, mairson%cs.brandeis.edu@RELAY.CS.NET, pw%cs.brown.edu@RELAY.CS.NET, pmo%icad.uucp@THINK.COM, attend-types@THEORY.LCS.MIT.EDU, attend-logic@THEORY.LCS.MIT.EDU
-
Subject: Consel T 7/19, 1200
-
From: Mitchell Wand <wand%corwin.ccs.northeastern.edu@RELAY.CS.NET>
-
Date: Mon, 11 Jul 88 10:12:47 EDT
Colloquium
Charles Consel
LITP-University of Paris 6/8
Tues, Jul 19, 1200 noon
107 Cullinane
New Insights into Partial Evaluation: the SCHISM Experiment
This paper describes SCHISM: a self-applicable partial evaluator for a
first-order subset of Scheme. SCHISM takes place in the framework of mixed
computation, and is situated along the line of the MIX project at the
University of Copenhagen. The goal is automatically to generate compilers
>from interpreters by self-application and we have done this with an
extensible and directly executable first order subset of Scheme.
We use annotation for driving SCHISM to eliminate a call (unfold it) or to
keep it residual (specialize it). These annotations are local to each
function rather than to each function call. The usual pitfalls of such an
approach are avoided by associating a filter expression with each function.
Host: M. Wand