The project NoName - a functional programming language with its development environment

Complex problems can often be described and solved in an easy and elegant way with functional programs Well known functional programming languages are e g LISP McC ML Mil Miranda Tur and Gofer Jon also cf Hud for a survey In this paper we present a further functional programming language called NoName and its programming environment The reason for this development is to be able to test evaluation strategies and transformation strategies in the eld of di erent recursive program schemes NoName has some helpful features which cannot be found in other languages in this composition

[1]  Joost Engelfriet,et al.  Macro Tree Transducers , 1985, J. Comput. Syst. Sci..

[2]  Joost Engelfriet,et al.  High level tree transducers and iterated pushdown tree transducers , 2008, Acta Informatica.

[3]  Joost Engelfriet,et al.  SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES , 1980 .

[4]  George Angelos Papadopoulos,et al.  Dactl: an experimental graph rewriting language , 1990, J. Program. Lang..

[5]  John McCarthy,et al.  Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.

[6]  Sándor Vágvölgyi,et al.  Tree Transducers with External Functions , 1993, Theor. Comput. Sci..

[7]  James W. Thatcher,et al.  Generalized Sequential Machine Maps , 1970, J. Comput. Syst. Sci..

[8]  Paul Hudak,et al.  Conception, evolution, and application of functional programming languages , 1989, CSUR.

[9]  Joost Engelfriet,et al.  Pushdown Machines for the Macro Tree Transducer , 1986, Theor. Comput. Sci..

[10]  William C. Rounds,et al.  Mappings and grammars on trees , 1970, Mathematical systems theory.

[11]  Philip Wadler,et al.  Deforestation: Transforming Programs to Eliminate Trees , 1988, Theoretical Computer Science.

[12]  Joost Engelfriet,et al.  Bottom-up and top-down tree transformations— a comparison , 1975, Mathematical systems theory.

[13]  J. Engelfriet.  Top-down tree transducers with regular look-ahead , 1975 .

[14]  Bruno Courcelle,et al.  Attribute Grammars and Recursive Program Schemes I , 1982, Theoretical Computer Science.

[15]  Robin Milner,et al.  A proposal for standard ML , 1984, LFP '84.

[16]  Zoltán Fülöp.  On attributed tree transducers , 1981, Acta Cybern..

[17]  Thomas W. Reps,et al.  The synthesizer generator , 1984, SDE 1.

[18]  Heiko Vogler,et al.  Synthesized and inherited functions - a new computational model for syntax-directed semantics , 1994 .

[19]  Joost Engelfriet,et al.  Modular Tree Transducers , 1991, Theor. Comput. Sci..