ange@otter.HP.COM (Andy Norman) (01/12/88)
If anyone knows what work is being / has been done with _Scheme_ in the following areas, could they please _MAIL_ me, and I will summarise to the net. Modules. Formal definitions of both data types and language semantics. Type checking. Frames, OOPS, Active Values and Daemons. Thanks in advance. ange ------------------------------------------------------------------ ange%anorman@hplabs.HP.COM | Andy Norman (ange) | ange@hplb.csnet | Hewlett-Packard Labs, --+-- ange%hplb.csnet@csnet-relay.arpa | Bristol, U.K., | ...!mcvax!ukc!hplb!ange | England. BS12 6QZ |
ange@otter.hple.hp.com (Andy Norman) (02/25/88)
ange@otter.HP.COM (Andy Norman) writes: >If anyone knows what work is being / has been done with _Scheme_ in the >following areas, could they please _MAIL_ me, and I will summarise to the >net. >Modules. >Formal definitions of both data types and language semantics. >Type checking. >Frames, OOPS, Active Values and Daemons. Here is a summary of the replies that I have received: -------------------------------------------------------------------------------- From: Will Clinger <willc%tekchips.CRL%tektronix.tek.com@RELAY.CS.NET> Mitch Wand has done a lot of work with denotational semantics expressed in Scheme. I've done a little -- I wrote the semantics of Scheme itself in Scheme in order to test it. I think Mitch is now working with formal semantics of data types, objects, and inheritance. ML would undoubtedly be a better language for this sort of thing than Scheme, but Scheme is more widely available and the implementations are often better. Mitch built an ML-style type checker for use with Scheme 311. It was buggy and crude but useful because Scheme 311 had no debugger. David Gifford and his students are currently working on FX, which is a statically typed language with type inference that can be thought of as a dialect of Scheme. TI built an object-oriented system called SCOOPS for their PC Scheme that was used in their Personal Consultant series of expert system shells. They made the source code available, and there is at least one independent implementation of SCOOPS for MacScheme. The T object system came earlier, though, and is a more elegant system. Norman Adams of Tektronix has recently been working on a system similar to the T object system. There's someone at Carnegie Mellon who's applying flow analysis to the type inference problem for Scheme. That's about it for my knowledge, but I'm sure lots of other stuff has been done. -------------------------------------------------------------------------------- From: willc%tekchips.CRL%tektronix.tek.com@RELAY.CS.NET Uwe Pleban's MESS system for building compilers from denotational specifications uses Scheme as well as Turbo Prolog (for the code generator) and an ML-like language (for the semantics; the ML-like language is implemented in Scheme). -------------------------------------------------------------------------------- Many thanks to Will for taking the time to reply. ange ------------------------------------------------------------------ ange%anorman@hplabs.HP.COM | Andy Norman (ange) | ange@hplb.csnet | Hewlett-Packard Labs, --+-- ange%hplb.csnet@csnet-relay.arpa | Bristol, U.K., | ...!mcvax!ukc!hplb!ange | England. BS12 6QZ |
mhs@HT.AI.MIT.EDU (Mark Shirley) (02/29/88)
Quoting "From: otter!ange@hplabs.hp.com (Andy Norman)"
From: Will Clinger <willc%tekchips.CRL%tektronix.tek.com@RELAY.CS.NET>
======================================================================
There's someone at Carnegie Mellon who's applying flow analysis to the
type inference problem for Scheme.
Will, do you mean Olin Shivers at CMU? Or is there someone else working on
flow analysis?
In a vein similar to Andy's question, What is the state-of-the-art in
optimizing compilers for Lisp / Scheme? If people would send references to
papers, e.g. something on Orbit, I'll collect and summarize the responses.
(Apologies to everybody if this question has been asked recently. I'm new to
this list and looking through the archives available to me didn't turn up
anything.)
- Mark Shirleyange@otter.hple.hp.com (Andy Norman) (03/23/88)
ange@otter.HP.COM (Andy Norman) writes: >If anyone knows what work is being / has been done with _Scheme_ in the >following areas, could they please _MAIL_ me, and I will summarise to the >net. >Modules. >Formal definitions of both data types and language semantics. >Type checking. >Frames, OOPS, Active Values and Daemons. Here is a summary of the recent replies that I have received: -------------------------------------------------------------------------------- From: hal@MURREN.AI.MIT.EDU (Hal Abelson) Here are some pointers to Scheme research: Pierre Bonzon, University of Lausanne -- pbonzon@clsun51.bitnet combining scheme and logic programming Alan Bawden, MIT -- alan@ai.ai.mit.edu self-refeence a la Brian Smith Alan Bawden, Jonathan Rees, MIT jar@ai.ai.mit.edu a coherent framework for macros Kent Dybvig, Robert Hieb, Indiana University semantic of parallelism based on engines Matthias Felleisen, Rice University semantics for Scheme based on lambda calculus Felleisen, Mitch Wand (Northeastern), Dan Friedman and Bruce Duba (Indiana) semantics of continuations Norman Adams (Tektronix) and Jonathan Rees (MIT object-oriented programming Bill Rozas and Chris Hansen (MIT) using environments to implement modules Dave Gifford (MIT) type checking ------------------------------------------------------------------------------- -- ange -- ange%anorman@hplabs.hp.com ange@hplb.csnet