Article View: comp.lang.misc
Article #6273Combinator reduction applications?
From: Philip Koopman
Date: Mon, 13 Feb 1989 16:09
Date: Mon, 13 Feb 1989 16:09
31 lines
1638 bytes
1638 bytes
I am studying combinator graph reduction techniques for implementing
functional programming languages. My question is, if very fast
implementations became available, what applications would they find?
Specifically:
-- What applications for functional programming languages
-- What applications for combinator graph reduction in general
If possible, estimate the performance level on a workstation platform
required to make your favorite application run reasonably fast to the
nearest order of magnitude:
-- 10,000 reduction applications per second (MIRANDA speed)
-- 100,000 reduction applications per second (SKIM, NORMA, special-purpose
hardware type speeds)
-- 1,000,000 reduction applications per second
... etc ...
If I get a reasonable response, I will summarize results. By the way,
yes I have read about TIM, so any input on closure reducer applications
as well as graph reducer applications is appreciated.
Thanks,
Phil Koopman koopman@maxwell.ece.cmu.edu Arpanet
5551 Beacon St.
Pittsburgh, PA 15217
PhD student at CMU.
--
Technical Details
Message-ID:
<4263@pt.cs.cmu.edu>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!bloom-beacon!mit-eddie!uw-beaver!cornell!rochester!pt.cs.cmu.edu!a.gp.cs.cmu.edu!koopmanShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!bloom-beacon!mit-eddie!uw-beaver!cornell!rochester!pt.cs.cmu.edu!a.gp.cs.cmu.edu!koopman From: koopman@a.gp.cs.cmu.edu (Philip Koopman) Newsgroups: comp.lang.misc,comp.lang.lisp,comp.lang.scheme Subject: Combinator reduction applications? Keywords: combinator graph reduction functional programming Message-ID: <4263@pt.cs.cmu.edu> Date: 13 Feb 89 16:09:03 GMT Organization: Carnegie-Mellon University, CS/RI Lines: 30