Abstract
No abstract available.
Cited By
- Rosenblueth D (2019). A Multiple-Clause Folding Rule Using Instantiation and Generalization, Fundamenta Informaticae, 69:1-2, (219-249), Online publication date: 1-Jan-2006.
- Rosenblueth D (2019). A Multiple-Clause Folding Rule Using Instantiation and Generalization, Fundamenta Informaticae, 69:1-2, (219-249), Online publication date: 1-Jan-2006.
- Ager M, Danvy O and Goldberg M A symmetric approach to compilation and decompilation The essence of computation, (296-331)
- Hamlet D (1998). What can we learn by testing a program?, ACM SIGSOFT Software Engineering Notes, 23:2, (50-52), Online publication date: 1-Mar-1998.
- Hamlet D What can we learn by testing a program? Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis, (50-52)
- Schneider V (1990). Compiler textbook bibliographies considered harmful, ACM SIGPLAN Notices, 25:8, (72-74), Online publication date: 1-Aug-1990.
- Hamlet R (1988). Introduction to special section on software testing, Communications of the ACM, 31:6, (662-667), Online publication date: 1-Jun-1988.
- Scheider V (1988). A reply to “A note on metrics of Pascal programs", ACM SIGPLAN Notices, 23:1, (38-39), Online publication date: 3-Jan-1988.
- Besel H (1974). After the goto debate, ACM SIGPLAN Notices, 9:6, (13-16), Online publication date: 1-Jun-1974.
- Bauer F, De Remer F, Griffiths M, Hill U, Horning J, Koster C, McKeeman W, Poole P, Waite W, Eickel J, Goos G and Hartmanis J (1974). Compiler construction, 10.5555/1102008, Online publication date: 1-Jan-1974.
- Housel B and Halstead M A methodology for machine language decompilation Proceedings of the 1974 annual conference - Volume 1, (254-260)
- Halstead M (1972). Natural laws controlling algorithm structure?, ACM SIGPLAN Notices, 7:2, (19-26), Online publication date: 1-Feb-1972.
- Lincoln N (1970). Parallel programming techniques for compilers, ACM SIGPLAN Notices, 5:10, (18-31), Online publication date: 1-Oct-1970.
- Glass R (2018). An Elementary Discussion of Compiler/Interpreter Writing, ACM Computing Surveys (CSUR), 1:1, (55-77), Online publication date: 1-Mar-1969.
- Atchison W, Conte S, Hamblen J, Hull T, Keenan T, Kehl W, McCluskey E, Navarro S, Rheinboldt W, Schweppe E, Viavant W and Young D (1968). Curriculum 68: Recommendations for academic programs in computer science, Communications of the ACM, 11:3, (151-197), Online publication date: 1-Mar-1968.
- Feldman J and Gries D (1968). Translator writing systems, Communications of the ACM, 11:2, (77-113), Online publication date: 1-Feb-1968.
- Halstead M Machine-independence and third-generation computers Proceedings of the November 14-16, 1967, fall joint computer conference, (587-592)
- Schorr H and Waite W (1967). An efficient machine-independent procedure for garbage collection in various list structures, Communications of the ACM, 10:8, (501-506), Online publication date: 1-Aug-1967.
- Halstead M, Uber G and Gielow K An algorithmic search procedure for program generation Proceedings of the April 18-20, 1967, spring joint computer conference, (657-662)
- Cramer M and Strauss J A hybrid oriented interactive language Proceedings of the 1966 21st national conference, (479-488)
- Halpern M (1965). Machine independence, Communications of the ACM, 8:12, (782-785), Online publication date: 1-Dec-1965.
- Burkhardt W Universal programming languages and processors Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I, (1-21)
- Naur P (1964). References, ALGOL Bulletin:16, (33-34), Online publication date: 1-May-1964.
- Daniels A Some observations concerning large programming efforts Proceedings of the April 21-23, 1964, spring joint computer conference, (231-238)
- Rosen S Programming systems and languages Proceedings of the April 21-23, 1964, spring joint computer conference, (1-15)
- Halstead M (1963). NELIAC, Communications of the ACM, 6:3, (91-92), Online publication date: 1-Mar-1963.
- Landen W and Wattenburg W Automatic programming and compilers III Proceedings of the 1962 ACM national conference on Digest of technical papers
Index Terms
- Machine-independent computer programming
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
A machine-independent APL interpreter
The problem of writing machine-independent APL interpreters is solved by means of a systems programming approach making use of an intermediate level language specially designed for that purpose. This paper describes the language, as well as the ...
A machine and configuration independent Fortran: Portable Fortran {PFortran}
This paper describes the design of a programming language suitable for writing portable, machine independent programs. Based on Fortran, and implemented at the lowest level by means of subprograms, this language (PFortran) provides features which allow ...