Skip header Section
Skip Bibliometrics Section
Programming languages and their compilers: Preliminary notesJanuary 1969
- Author:
- John Cocke
Abstract
No abstract available.
Cited By
Jia X, Kumar A and Tan G (2023). A Derivative-based Parser Generator for Visibly Pushdown Grammars, ACM Transactions on Programming Languages and Systems, 45:2, (1-68), Online publication date: 30-Jun-2023.- Johnston M Multimodal integration for interactive conversational systems The Handbook of Multimodal-Multisensor Interfaces, (21-76)
- Eidelman V and Grom B Argument Identification in Public Comments from eRulemaking Proceedings of the Seventeenth International Conference on Artificial Intelligence and Law, (199-203)
- Phan K, Le A, Indurkhya B and Nakagawa M (2018). Augmented incremental recognition of online handwritten mathematical expressions, International Journal on Document Analysis and Recognition, 21:4, (253-268), Online publication date: 1-Dec-2018.
- Henglein F and Rasmussen U PEG parsing in less space using progressive tabling and dynamic analysis Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, (35-46)
- Chien P and Cheng P Semantic Tagging of Mathematical Expressions Proceedings of the 24th International Conference on World Wide Web, (195-204)
- Schüller P Flexible Combinatory Categorial Grammar Parsing Using the CYK Algorithm and Answer Set Programming Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning - Volume 8148, (499-511)
- Saers M, Addanki K and Wu D Iterative rule segmentation under minimum description length for unsupervised transduction grammar induction Proceedings of the First international conference on Statistical Language and Speech Processing, (224-235)
- Han Y, Ko S and Salomaa K Approximate matching between a context-free grammar and a finite-state automaton Proceedings of the 18th international conference on Implementation and Application of Automata, (146-157)
- Braun M, Buchwald S, Hack S, Leißa R, Mallon C and Zwinkau A Simple and efficient construction of static single assignment form Proceedings of the 22nd international conference on Compiler Construction, (102-122)
- Bernardy J and Claessen K (2013). Efficient divide-and-conquer parsing of practical context-free languages, ACM SIGPLAN Notices, 48:9, (111-122), Online publication date: 12-Nov-2013.
- Bernardy J and Claessen K Efficient divide-and-conquer parsing of practical context-free languages Proceedings of the 18th ACM SIGPLAN international conference on Functional programming, (111-122)
- Costa C, Moreira J, Januário G and Barreto P Dynamic method to evaluate code optimization effectiveness Proceedings of the 15th International Workshop on Software and Compilers for Embedded Systems, (62-71)
- Higa D and Stefanes M A coarse-grained parallel algorithm for the matrix chain order problem Proceedings of the 2012 Symposium on High Performance Computing, (1-8)
- Saers M and Wu D Reestimation of reified rules in semiring parsing and biparsing Proceedings of the Fifth Workshop on Syntax, Semantics and Structure in Statistical Translation, (70-78)
- Schwartz L, Callison-Burch C, Schuler W and Wu S Incremental syntactic language models for phrase-based translation Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1, (620-631)
- Kats L, Visser E and Wachsmuth G (2010). Pure and declarative syntax definition, ACM SIGPLAN Notices, 45:10, (918-932), Online publication date: 17-Oct-2010.
- Kats L, Visser E and Wachsmuth G Pure and declarative syntax definition Proceedings of the ACM international conference on Object oriented programming systems languages and applications, (918-932)
- Moscola J, Cytron R and Cho Y (2010). Hardware-Accelerated RNA Secondary-Structure Alignment, ACM Transactions on Reconfigurable Technology and Systems, 3:3, (1-44), Online publication date: 1-Sep-2010.
- Zakov S, Tsur D and Ziv-Ukelson M Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach Proceedings of the 10th international conference on Algorithms in bioinformatics, (65-77)
- Cohn T, Goldwater S and Blunsom P Inducing compact but accurate tree-substitution grammars Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, (548-556)
- Cooper K, Eckhardt J and Kennedy K Redundancy elimination revisited Proceedings of the 17th international conference on Parallel architectures and compilation techniques, (12-21)
- Bravenboer M, van Dam A, Olmos K and Visser E (2006). Program Transformation with Scoped Dynamic Rewrite Rules, Fundamenta Informaticae, 69:1-2, (123-178), Online publication date: 1-Jan-2006.
- Bravenboer M, van Dam A, Olmos K and Visser E (2005). Program Transformation with Scoped Dynamic Rewrite Rules, Fundamenta Informaticae, 69:1-2, (123-178), Online publication date: 1-Jan-2006.
- Müller-Olm M, Rüthing O and Seidl H Checking herbrand equalities and beyond Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation, (79-96)
- Müller-Olm M, Seidl H and Steffen B Interprocedural herbrand equalities Proceedings of the 14th European conference on Programming Languages and Systems, (31-45)
- Knoop J, Rüthing O and Steffen B (2004). Lazy code motion, ACM SIGPLAN Notices, 39:4, (460-472), Online publication date: 1-Apr-2004.
- Song L and Kavi K (2004). What can we gain by unfolding loops?, ACM SIGPLAN Notices, 39:2, (26-33), Online publication date: 1-Feb-2004.
- Reps T and Rall L (2003). Computational Divided Differencing and Divided-Difference Arithmetics, Higher-Order and Symbolic Computation, 16:1-2, (93-149), Online publication date: 1-Mar-2003.
- Niwa J, Matsumoto T and Hiraki K Comparative study of page-based and segment-based software DSM through compiler optimization Proceedings of the 14th international conference on Supercomputing, (284-295)
- Begel A, McCanne S and Graham S (1999). BPF+, ACM SIGCOMM Computer Communication Review, 29:4, (123-134), Online publication date: 1-Oct-1999.
- Begel A, McCanne S and Graham S BPF+ Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, (123-134)
- Kistler T and Franz M (1999). A Tree-Based Alternative to Java Byte-Codes, International Journal of Parallel Programming, 27:1, (21-33), Online publication date: 1-Feb-1999.
- Backus J (1998). The History of Fortran I, II, and III, IEEE Annals of the History of Computing, 20:4, (68-78), Online publication date: 1-Oct-1998.
- Shuler J and Bauer H Look-ahead allocation in the presence of branches Proceedings of the 1997 ACM symposium on Applied computing, (504-508)
- Click C (1995). Global code motion/global value numbering, ACM SIGPLAN Notices, 30:6, (246-257), Online publication date: 1-Jun-1995.
- Click C Global code motion/global value numbering Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation, (246-257)
- Weise D, Crew R, Ernst M and Steensgaard B Value dependence graphs Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (297-310)
- van den Bosch P (1992). A bibliography on syntax error handling in context free languages, ACM SIGPLAN Notices, 27:4, (77-86), Online publication date: 1-Apr-1992.
- Hsieh B, Hind M and Cytron R Loop distribution with multiple exits Proceedings of the 1992 ACM/IEEE conference on Supercomputing, (204-213)
- Cai J and Paige R Look ma, no hashing, and no arrays neither Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (143-154)
- Hsu W, Fisher C and Goodman J (1989). On the Minimization of Loads/Stores in Local Register Allocation, IEEE Transactions on Software Engineering, 15:10, (1252-1260), Online publication date: 1-Oct-1989.
- Billot S and Lang B The structure of shared forests in ambiguous parsing Proceedings of the 27th annual meeting on Association for Computational Linguistics, (143-151)
- Rosen B, Wegman M and Zadeck F Global value numbers and redundant computations Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (12-27)
- Alpern B, Wegman M and Zadeck F Detecting equality of variables in programs Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (1-11)
- Lang B Parsing incomplete sentences Proceedings of the 12th conference on Computational linguistics - Volume 1, (365-371)
- Kessler P (1986). Discovering machine-specific code improvements, ACM SIGPLAN Notices, 21:7, (249-254), Online publication date: 1-Jul-1986.
- Johnson H (1986). Data flow analysis for `intractable' system software, ACM SIGPLAN Notices, 21:7, (109-117), Online publication date: 1-Jul-1986.
- Kessler P Discovering machine-specific code improvements Proceedings of the 1986 SIGPLAN symposium on Compiler construction, (249-254)
- Johnson H Data flow analysis for `intractable' system software Proceedings of the 1986 SIGPLAN symposium on Compiler construction, (109-117)
- Taffs D, Taffs M, Rienzo J and Hampson T The ALS Ada compiler global optimizer Proceedings of the 1985 annual ACM SIGAda international conference on Ada, (355-366)
- Taffs D, Taffs M, Rienzo J and Hampson T (1985). The ALS Ada compiler global optimizer, ACM SIGAda Ada Letters, V:2, (355-366), Online publication date: 1-Sep-1985.
- Rowen C and Hennessey J SWAMI Proceedings of the 22nd ACM/IEEE Design Automation Conference, (169-175)
- Tomita M An efficient context-free parsing algorithm for natural languages Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2, (756-764)
- Ottenstein K (1984). Intermediate program representations in compiler construction, ACM SIGPLAN Notices, 19:7, (25-27), Online publication date: 1-Jul-1984.
- Ferrante J and Ottenstein K A program form based on data dependency in predicate regions Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (217-236)
- Paige R Transformational programming Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (73-87)
- Pearce P and Hicks R The optimization of user programs for an Algebraic Manipulation System Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, (131-136)
- Graham S, Harrison M and Ruzzo W (1980). An Improved Context-Free Recognizer, ACM Transactions on Programming Languages and Systems, 2:3, (415-462), Online publication date: 1-Jul-1980.
- Samet H (1980). Efficient On-Line Proofs of Equalities and Inequalities of Formulas, IEEE Transactions on Computers, 29:1, (28-32), Online publication date: 1-Jan-1980.
- Fong A Inductively computable constructs in very high level languages Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (21-28)
- Frailey D (1979). An intermediate language for source and target independent code optimization, ACM SIGPLAN Notices, 14:8, (188-200), Online publication date: 1-Aug-1979.
- Frailey D An intermediate language for source and target independent code optimization Proceedings of the 1979 SIGPLAN symposium on Compiler construction, (188-200)
- Backus J (1978). The history of FORTRAN I, II, and III, ACM SIGPLAN Notices, 13:8, (165-180), Online publication date: 1-Aug-1978.
- Sedgewick R (1978). Implementing Quicksort programs, Communications of the ACM, 21:10, (847-857), Online publication date: 1-Oct-1978.
- Backus J The history of Fortran I, II, and III History of programming languages, (25-74)
- Lindstrom G Control structure aptness Proceedings of the 3rd international conference on Software engineering, (5-12)
- Kennedy K and Zucconi L Applications of a graph grammar for program control flow analysis Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (72-85)
- Paige B and Schwartz J Expression continuity and the formal differentiation of algorithms Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (58-71)
- Fong A Generalized common subexpressions in very high level languages Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (48-57)
- Cocke J and Kennedy K (1977). An algorithm for reduction of operator strength, Communications of the ACM, 20:11, (850-856), Online publication date: 1-Nov-1977.
- Scheifler R (1977). An analysis of inline substitution for a structured programming language, Communications of the ACM, 20:9, (647-654), Online publication date: 1-Sep-1977.
- Jazayeri M Programmer productivity Proceedings of the 15th annual Southeast regional conference, (73-79)
- Minker J (1977). Information storage and retrieval, ACM SIGIR Forum, 12:2, (12-108), Online publication date: 1-Sep-1977.
- Graham S and Wegman M (1976). A Fast and Usually Linear Algorithm for Global Flow Analysis, Journal of the ACM, 23:1, (172-202), Online publication date: 1-Jan-1976.
- Hoffmann C and Landweber L (1976). A Completeness Theorem for Straight-Line Programs with Structured Variables, Journal of the ACM, 23:1, (203-220), Online publication date: 1-Jan-1976.
- Jones N and Muchnick S Binding time optimization in programming languages Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, (77-94)
- Aho A, Johnson S and Ullman J Code generation for expressions with common subexpressions (Extended Abstract) Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, (19-31)
- Wardle C ARTSPEAK The papers of the ACM symposium on Graphic languages, (32-39)
- Allen F and Cocke J (1976). A program data flow analysis procedure, Communications of the ACM, 19:3, (137), Online publication date: 1-Mar-1976.
- Wardle C (1976). ARTSPEAK, ACM SIGPLAN Notices, 11:6, (32-39), Online publication date: 1-Jun-1976.
- Wardle C (1976). ARTSPEAK, ACM SIGGRAPH Computer Graphics, 10:1, (32-39), Online publication date: 1-May-1976.
- Stuart T (1976). Adapting large systems to small machines, ACM SIGPLAN Notices, 11:4, (144-150), Online publication date: 1-Apr-1976.
- Bennett-Novak G (1976). Optimized machine-independent extended FORTRAN for minicomputer programming, ACM SIGPLAN Notices, 11:4, (40-44), Online publication date: 1-Apr-1976.
- Stuart T Adapting large systems to small machines Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment, (144-150)
- Bennett-Novak G Optimized machine-independent extended FORTRAN for minicomputer programming Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment, (40-44)
- Nylin W Flow graph analysis using linear connected regions Proceedings of the 1976 annual conference, (7-11)
- Fong A and Ullman J Induction variables in very high level languages Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, (104-112)
- Kennedy K (1976). A Comparison of Two Algorithms for Global Data Flow Analysis, SIAM Journal on Computing, 5:1, (158-180), Online publication date: 1-Mar-1976.
- Wedel D Fortran for the Texas Instruments ASC system Proceedings of the conference on Programming languages and compilers for parallel and vector machines, (119-132)
- Fong A, Kam J and Ullman J Application of lattice algebra to loop optimization Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (1-9)
- Wedel D (1975). Fortran for the Texas Instruments ASC system, ACM SIGPLAN Notices, 10:3, (119-132), Online publication date: 1-Mar-1975.
- Matelan M (1975). MPACT, ACM SIGDA Newsletter, 5:1, (13-41), Online publication date: 1-Mar-1975.
- Wegbreit B (1975). Mechanical program analysis, Communications of the ACM, 18:9, (528-539), Online publication date: 1-Sep-1975.
- VanderBrug G and Minker J (1975). State-space problem-reduction, and theorem proving—some relationships, Communications of the ACM, 18:2, (107-115), Online publication date: 1-Feb-1975.
- Wegbreit B (1974). The synthesis of loop predicates, Communications of the ACM, 17:2, (102-113), Online publication date: 1-Feb-1974.
- Housel B and Halstead M A methodology for machine language decompilation Proceedings of the 1974 annual conference - Volume 1, (254-260)
- Schneck P Semantic preprocessing Proceedings of the 1974 annual conference - Volume 1, (79-81)
- Kildall G A unified approach to global program optimization Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (194-206)
- Grishman R, Sager N, Raze C and Bookchin B The linguistic string parser Proceedings of the June 4-8, 1973, national computer conference and exposition, (427-434)
- Schneck P A survey of compiler optimization techniques Proceedings of the ACM annual conference, (106-113)
- Sethi R Validating register allocations for straight line programs Proceedings of the fourth annual ACM symposium on Theory of computing, (222-237)
- Schneck P (1972). Automatic recognition of vector and parallel operations in a higher level language, ACM SIGPLAN Notices, 7:11, (45-52), Online publication date: 1-Nov-1972.
- Schneck P Automatic recognition of vector and parallel operations in a higher level language Proceedings of the ACM annual conference - Volume 2, (772-779)
- Ellis C Parallel compiling techniques Proceedings of the 1971 26th annual conference, (508-519)
- Frailey D Expression optimization using unary complement operators Proceedings of a symposium on Compiler optimization, (67-85)
- Allen F Control flow analysis Proceedings of a symposium on Compiler optimization, (1-19)
- Frailey D (1970). Expression optimization using unary complement operators, ACM SIGPLAN Notices, 5:7, (67-85), Online publication date: 1-Jul-1970.
- Allen F (1970). Control flow analysis, ACM SIGPLAN Notices, 5:7, (1-19), Online publication date: 1-Jul-1970.
Index Terms
- Programming languages and their compilers: Preliminary notes
Recommendations
A generative programming approach to developing DSL compilers
GPCE'05: Proceedings of the 4th international conference on Generative Programming and Component EngineeringDomain-Specific Languages (DSLs) represent a proven approach to raising the abstraction level of programming. They offer high-level constructs and notations dedicated to a domain, structuring program design, easing program writing, masking the ...
Definitional Interpreters for Higher-Order Programming Languages
Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...