AEPL: An extensible programming language†

DOI10.1080/00207167508803100zbMATH Open0334.68010OpenAlexW2042830059WikidataQ126246105 ScholiaQ126246105MaRDI QIDQ4101413FDOQ4101413

Authors: Jacob Katzenelson, Elie Milgrom 

Publication date: 1975

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167508803100

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• An extension to ALGOL for manipulating formulae
• GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
• Toward an understanding of data structures
• The Markov algorithm as a language parser-linear bounds
• Macro instruction extensions of compiler languages
• Title not available (Why is that?)
• Experience with an extensible language
• Title not available (Why is that?)
• A proposal for definitions in ALGOL
• AEPL: An extensible programming language†

Cited In (1)

• AEPL: An extensible programming language†

Uses Software

• FORMAC

This page was built for publication: AEPL: An extensible programming language†

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4101413)