DAVID@PENNDRLS.BITNET (09/03/88)
Beat me to the punch. I was going to post a quote from Backus on a similar subject. I'm sort of wandering around in the Functional Programming literature right now. Interesting questions, but I'd like to see more work relating it to the *real* world of programming. Anyone have any references to papers or whatnot dealing with FORTH and functional programming? Re: FORTH and type checking. Has anyone done any work on an analog of LINT for FORTH? Such a beast ought to be writable in such a way as to be extensible in close conjunction with extensions to the FORTH compiler, and therefore lose none of the flexability a pre-processor approach would lose. Something along the lines of giving the stack effect comments real meaning, perhaps. Anyway, just a thought, and not one I've devoted much brain power to. By the way, to the poster who facetiously made the comment that the compile time checking of proper nesting of BEGIN/WHILE etc. was restricting him: yes, it is. I remember an example somewhere of a very useful compile time operation that could not be used if the block structure words demanded strict closure. I forget exactly how it worked; I'll see if I can find it. -- R. David Murray (DAVID@PENNDRLS.BITNET, DAVID@PENNDRLS.UPENN.EDU) P.S.: Fraser, what language *do* you like? No, don't anwer that. We'd just start bashing *it*. :-)
kdw1@sphinx.uchicago.edu (Keith Waclena) (09/06/88)
[ ." Line eater?" ] In article <8809021715.AA19311@jade.berkeley.edu> you write: >Beat me to the punch. I was going to post a quote from Backus on >a similar subject. I'm sort of wandering around in the Functional >Programming literature right now. Interesting questions, but I'd >like to see more work relating it to the *real* world of programming. >Anyone have any references to papers or whatnot dealing with >FORTH and functional programming? > Hmm.. I'm afraid none of these has much to do with the *real* world, but you asked for Forth+Functional, so here you are. Note that I'm not *recommending* any of these articles exactly; they are simply the result of a <25 character grep command on my bibliographic database. Oops.. ``grep''.. that's a Unix utility.. I guess I should have fired up F83 and coded up a Boyer-Moore grep in Forth for this search.. maybe next time :-) Anyway, enjoy! Keith -- Keith Waclena University of Chicago Graduate Library School 1100 E. 57th Street, Chicago, Illinois 60637 ...uunet!cerberus.uchicago.edu!keith keith%cerberus@uchimvs1.BITNET #include <disclaimer.h> keith@cerberus.UChicago.{EDU,MAILNET,CSNET} ---- Cut Here ---- Cut Here ---- Cut Here ---- Cut Here ---- Cut Here %L Glas83 %A Harvey Glass %T Forth as the Kernel of a Functional Programming System %D 1983 %K applicative programming %B Proceedings 1983 Rochester Forth Applications Conference %L Glas83b %A Harvey Glass %T Forth and Functional Programming Systems %B Proceedings 1983 FORML Conference %I FORML %C Palo Alto, CA %D 1983 %K applicative programming %L Dixo83 %A R. D. Dixon %A W. M. Edmindson %A R. D. Franklin %A J. L. Sloan %T Extensions of FORTH for Functional Programming %B Proceedings 1983 Rochester Forth Applications Conference %I Institute for Applied Forth Research %D 1984 %K applicative programming %L Glas85 %A Harvey Glass %T Threaded Interpretive Systems and Functional Programming Environments %J SIGPLAN Notices %V 20 %N 4 %D April 1985 %P 24-32 %K FORTH; applicative programming %A Johan G. F. Belinfante %T S/K/ID: Combinators inn Forth %J Journal of Forth Application and Research %V 4 %N 4 %A L. L. Odette %D 1987 %T Compiling Prolog to Forth %J Journal of Forth Application and Research %V 4 %N 4 %P 487-533