H ?
«
‹
←
→
›
»
Language peer sets for Mem-theory: United States↑ United States/1961↑ Designed 1961 ↑ 1960s languages ↑ Second generation↑ Early Cold War↑ Genus Generalised programming ↑ Generalised programming↑ US historic algorithmic systems↑ Historic algorithmic languages ↑ Generalised programming/1961↑ US historic algorithmic systems/1961↑ Historic algorithmic languages/1961↑ Generalised programming/United States↑ US historic algorithmic systems/United States↑ Historic algorithmic languages/United States↑ Mem-theory(ID:6725/mem001)Graph-based universal languagealternate simple viewCountry: United States Designed 1961 Published: 1962 Genus: Generalised programming Language based on general theory of elements in relation and changes of relation. This in contrast to the "pure" algorithmic and functional approaches which see memory access as a "necessary evil" - hence memory-theory - the theory designed to investigate the relations between the meaning and acts of memory accss. Influenced also by the IPL and the LT machine. The research grew out of the GP and ACT projects at Univac and ADR, and Holt's subsequent PhD in Applied Linguistics at Pennsylvania U. and the Information Theory project at Computer Associates Mass. Described by Earley as originating graph-theory in programming languages from Austin "First, we must specify the effect of any event; i.e., the change in binding to be effected. The syntactic specification is borrowed from the mem-theory of Holt et al, which is a general theory of elements in relation and changes of relation. Briefly, the state of binding is represented by a graph whose (labelled) nodes represent system resources and whose edges represent relations (bonds) among them. Edges might be uniquely differentiated by their endpoints{ if not, they may be labelled or directed. The distinct labels on nodes or edges identify particular resources or classes of resources (or bonds). The change of binding to be effected is specified by a second graph depicting the final binding state in a similar manner. Special conventions are provided to indicate insertion or deletion of items in ordered sets. (The order relation on the set must be specified outside the graphic syntax.)" People: Related languages
References: in [ACM] CACM 4(10) (October 1961) (1961) [ACM] CACM 4(10) (October 1961) "Proceedings of a Symposium on Storage Allocation" in Popplewell, Cicely M. (1962) Popplewell, Cicely M. (Ed.) Information Processing 62, Proceedings of the 2nd IFIP Congress, Munich, Aug. 1962. North Holland Publ. Co., 1963. in Information Processing Machines: Proceedings of th (1965) Information Processing Machines: Proceedings of the Symposium held in Prague on September 7th-9th, 1964. Czechislovak Academy of Sciences (Prague) and Iliffe Books, Ltd. (London) 1965 in Information Processing Machines: Proceedings of th (1965) Information Processing Machines: Proceedings of the Symposium held in Prague on September 7th-9th, 1964. Czechislovak Academy of Sciences (Prague) and Iliffe Books, Ltd. (London) 1965 in Information Processing Machines: Proceedings of th (1965) Information Processing Machines: Proceedings of the Symposium held in Prague on September 7th-9th, 1964. Czechislovak Academy of Sciences (Prague) and Iliffe Books, Ltd. (London) 1965 in Information Processing Machines: Proceedings of th (1965) Information Processing Machines: Proceedings of the Symposium held in Prague on September 7th-9th, 1964. Czechislovak Academy of Sciences (Prague) and Iliffe Books, Ltd. (London) 1965 in Information Processing Machines: Proceedings of th (1965) Information Processing Machines: Proceedings of the Symposium held in Prague on September 7th-9th, 1964. Czechislovak Academy of Sciences (Prague) and Iliffe Books, Ltd. (London) 1965 in [ACM] (1971) [ACM] CACM 14(10) October 1971 in [SIGPLAN] (1973) SIGPLAN Notices 8(09) June 1973 Proceedings of ACM SIGPLAN - SIGOPS interface meeting on Architectural Support for Programming Languages and Operating Systems, Savannah, Georgia, 1973 in [Proceedings] (1975) Proceedings of the International Conference on Reliable software Los Angeles, California 1975 Search in: Google Google scholar World Cat Yahoo Overture DBLP Monash bib NZ IEEE  ACM portal CiteSeer CSB ncstrl jstor Bookfinder |