2. ICALP 1974: Saarbrücken, Germany

Monday Morning

• Adriaan van Wijngaarden:
  The Generative Power of Two-Level Grammars. 9-16
  
• Jan van Leeuwen:
  A Generalisation of Parikh's Theorem in Formal Language Theory. 17-26
  
• E. Shamir, Catriel Beeri:
  Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages. 27-33
  

Monday Afternoon

• Willem P. de Roever:
  Recursion and Parameter Mechanisms: An Axiomatic Approach. 34-65
  
• Alberto Martelli, Ugo Montanari:
  Dynamic Programming Schemata. 66-80
  
• Giorgio De Michelis, Carla Simone:
  Semantic Characterization of Flow Diagrams and Their Decomposability. 81-96
  
• Peter Kandzia:
  On the Most Recent Property of Algol-Like Programs. 97-111
  
• Jacques J. Arsac:
  Langages sans Etiquettes et Transformations de Programmes. 112-128
  

Tuesday Morning

• Giorgio Ausiello:
  Relations between Semantics and Complexity of Recursive Programs. 129-140
  
• John C. Reynolds:
  On the Relation between Direct and Continuation Semantics. 141-156
  
• Giuliano Pacini, Carlo Montangero, Franco Turini:
  Graph Representation and Computation Rules for Typeless Recursive Languages. 157-169
  
• Mariangiola Dezani-Ciancaglini, Maddalena Zacchi:
  Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms. 170-184
  
• Corrado Böhm, Mariangiola Dezani-Ciancaglini:
  Combinatorial Problems, Combinator Equations and Normal Forms. 185-199
  
• Bruno Courcelle, Gilles Kahn, Jean Vuillemin:
  Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples. 200-213
  

Tuesday Afternoon

• David B. Lomet:
  Automatic Generation of Multiple Exit Parsing Subroutines. 214-231
  
• Matthew M. Geller, Susan L. Graham, Michael A. Harrison:
  Production Prefix Parsing (Extended Abstract). 232-241
  
• David Pager:
  On Eliminating Unit Productions from LR(k) Parsers. 242-254
  
• Bernard Lang:
  Deterministic Techniques for Efficient Non-Deterministic Parsers. 255-269
  
• Witold Lipski Jr., V. Wiktor Marek:
  File Organization, An Application of Graph Theory. 270-279
  

Wednesday Morning

• Burkhard Monien:
  Characterizations of Time-Bounded Computations by Limited Primitive Recursion. 280-293
  
• Claus-Peter Schnorr:
  On Maximal Merging of Information in Boolean Computations. 294-300
  
• Juris Hartmanis, Theodore P. Baker:
  On Simple Goedel Numberings and Translations. 301-316
  
• Kurt Mehlhorn:
  The "Almost All" Theory of Subrecursive Degrees is Decidable. 317-325
  
• Klaus Weihrauch:
  The Compuational Complexity of Program Schemata. 326-334
  

Thursday Morning

• Max Fontet:
  Un resultat en theorie des groupes de permutations et son application au calcul effectif du groupe d'automorphismes d'un automate fini. 335-341
  
• Yves Césari:
  Sur l'application du theoreme de Suschkewitsch a l'etude des codes rationnets complets. 342-350
  
• Marcel Paul Schützenberger:
  Sur une propriete syntactique des relations rationnelles. 612-619
  
• Ferenc Gécseg:
  Composition of Automata. 351-363
  
• Armin B. Cremers, Seymour Ginsburg:
  Context-Free Grammar Forms. 364-382
  
• Jean Berstel, Luc Boasson:
  Une suite decroissante de cônes rationnels. 383-397
  

Thursday Afternoon

• Günter Hotz:
  Komplexitätsmaße für Ausdrücke. 398-412
  
• Patrick C. Fischer, Robert L. Probert:
  Efficient Procedures for Using Matrix Algorithms. 413-427
  
• Patrick C. Fischer:
  Further Schemes for Combining Matrix Algorithms. 428-436
  
• Ronald V. Book:
  On the Structure of Complexity Classes. 437-445
  
• Philippe Flajolet, Jean-Marc Steyaert:
  On Sets Having Only Hard Subsets. 446-457
  
• Reinhold Weicker:
  Turing Machines with Associative Memory Access. 458-472
  

Friday Morning

• Andrzej Ehrenfeucht, Grzegorz Rozenberg:
  Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems. 473-480
  
• Miroslav Novotný:
  Operators Reducing Generalized OL-Systems. 481-494
  
• Karel Culik II, T. S. E. Maibaum:
  Parallel Rewriting Systems on terms. 495-510
  
• Meera Blattner:
  Transductions of Context-Free Languages into Sets of Sentential Forms. 511-522
  
• Arto Salomaa:
  Parallelism in Rewriting Systems. 523-533
  
• Rainer Kemp:
  Mehrdeutigkeiten Kontextfreier Grammatiken. 534-546
  

Friday Afternoon

• Werner Dilger, Peter Raulefs:
  Monadic Program Schemes Under Restricted Classes of Free Interpretations. 547-561
  
• Ashok K. Chandra:
  Generalized Program Schemas. 562-576
  
• Eberhard Bertsch:
  A Decidability Result for Sequential Grammars. 577-583
  
• Antoni Kreczmar:
  Effectivity Problems of Algorithmic Logic. 584-600
  
• Patrick J. Hayes:
  Simple and Structural Redundancy in Non-Deterministic Computation. 601-611