AEPL: An extensible programming languageFootnote†

† Based in part on a thesis submitted by the second author to the Faculty of Electrical Engineering of the TECHNION in partial fulfillment of the requirements for the degree of Doctor of Science in Technology.

References

• Balzer R. M. Dataless Programming Proc. AFIPS 1967 FJCC 535 544
   Google Scholar
• Bell , J. R. 1968 . “ The Design of a Minimal Expandable Computer Language ” . In doctoral dissertation , Stanford University .
   Google Scholar
• Cheatham T. E. Jr. The Introduction of Definitional Facilities into Higher Level sible Language Proc. AFIPS 1966 FJCC 623 637
   Google Scholar
• Cheatham T. E. Jr. Fischer A. Jorrand P. On the Basis for ELF-An Extensible Language Facility Proc. AFIPS 1968. FJCC 937 948
   Google Scholar
• Christensen , C. and Shew , C. J. , eds. 1969 . SIGPLAN Notices . Proceedings of the Extensible Languages Symposium . August 1969 . Vol. 4 , pp. 1 – 62 . 8
   Google Scholar
• Earley , J. 1971 . Toward an Understanding of Data Structures . Comm. ACM , 14 ( 10 ) Oct : 617 – 627 .
   Google Scholar
• Galler , B. A. and Perlis , A. J. 1967 . A Proposal for Definitions in Algol . Comm. ACM , 10 ( 4 ) April : 204 – 219 .
   Google Scholar
• Galler , B. A. and Perlis , A. J. 1970 . A View of Programming Languages , Reading, Mass : Addison-Wesley Publ. Co. .
   Google Scholar
• Harrison M. C. BALM–An Extendable List-Processing Language Proc. AFIPS 1970 SJCC 507 511
   Google Scholar
• Irons , E. T. 1970 . Experience with an Extensible Language . Comm. ACM , 13 ( 1 ) Jan : 31 – 40 .
   Google Scholar
• Katzenelson , J. 1972 . The Markov Algorithm as a Language Parser–Linear Bounds . J. of Systems and Computer Sciences , 6 ( 5 ) October : 465 – 478 .
   Google Scholar
• Katzenelson J. Milgrom E. A Modified Markov Algorithm as a Language Parser , Memorandum ERL-M363 Electronics Research Laboratory College of Engineering,U. of California Berkeley, U.of California
   Google Scholar
• Markov A. A. Theory of Alorithms Academy of Sciences of the USSR 1954 English translation by Istrael Prgram for Scientifiv Translations
   Google Scholar
• McIlroy , M. D. 1960 . Macro Instruction Extension of Compiler Languages . Comm. ACM , 3 ( 4 ) April : 214 – 220 .
   Google Scholar
• Mendelson , E. 1964 . Introduction to Mathematical Logic , Princeton, N.J. : Van Nostrand Co. .
   Google Scholar
• Milgrom , E. 1971 . “ Design of an Extensible Programming Language ” . In doctoral dissertation , Technion-Israel Institute of Technology .
   Google Scholar
• Milgrom E. Katzenelson J. Data Structures in the Extensible Programming Lnguage AEPL Proc. AFIPS 1972 FJCC 1972 515 523
   Google Scholar
• Perlis , A. J. and Iturriaga , R. 1964 . An Extension to Algol for Manipulating Formulae . Comm. ACM , 7 ( 2 ) Feb : 127 – 130 .
   Google Scholar
• Reynolds , J. C. 1970 . GEDANKEN—A Simple Typeless Language Based on the Principle of Completeness and the Reference Concept . Comm. ACM , 13 ( 5 ) May : 308 – 318 .
   Google Scholar
• Sammet , J. E. 1969 . Programming Languages: History and Fundamentals , Englewood Cliffs, N.J. : Prentice-Hall Inc. .
   Google Scholar
• Schuman , S. A. , ed. SIGPLAN Notices . Proceedings of the International Symposium on Extensible Programming Languages . 1971 , Grenoble. Vol. 6 , December . 12
   Google Scholar
• Schwartz , J. T. 1970-71 . Abstract Algorithms and a Set-Theoretic Language for their Expression , New York : New York University . Preliminary draft, Computer Science Dept.,Courant Institute of Mathematical Sciences
   Google Scholar
• Solntseff , N. and Yezersky , A. 1971 . A Survey of Extensible Programming Languages , Hamilton, Ontario : McMaster University . Computer Science Tech. Report No. 71/7
   Google Scholar