Jacques Loeckx
Proceedings of the Second Colloquium on Automata, Languages and Programming
ICALP, 1974.

@proceedings{ICALP-1974,
	editor        = "Jacques Loeckx",
	isbn          = "3-540-06841-4",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Second Colloquium on Automata, Languages and Programming}",
	volume        = 14,
	year          = 1974,
}

Contents (47 items)

7 ×#on the
6 ×#french
6 ×#recursion
4 ×#algorithm
4 ×#parsing
3 ×#complexity
3 ×#parallel
3 ×#performance
3 ×#semantics
3 ×#term rewriting

ICALP-1974-Wijngaarden #generative #power of #two-level grammar

The Generative Power of Two-Level Grammars (AvW), pp. 9–16.

ICALP-1974-Leeuwen #formal method #theorem

A Generalisation of Parikh’s Theorem in Formal Language Theory (JvL), pp. 17–26.

ICALP-1974-ShamirB

Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages (ES, CB), pp. 27–33.

ICALP-1974-Roever #approach #axiom #parametricity #recursion

Recursion and Parameter Mechanisms: An Axiomatic Approach (WPdR), pp. 34–65.

ICALP-1974-MartelliM #programming

Dynamic Programming Schemata (AM, UM), pp. 66–80.

ICALP-1974-MichelisS #diagrams #semantics

Semantic Characterization of Flow Diagrams and Their Decomposability (GDM, CS), pp. 81–96.

ICALP-1974-Kandzia #algol #on the #source code

On the Most Recent Property of Algol-Like Programs (PK), pp. 97–111.

ICALP-1974-Arsac #french

Langages sans Etiquettes et Transformations de Programmes (JJA), pp. 112–128.

ICALP-1974-Ausiello #complexity #recursion #semantics #source code

Relations between Semantics and Complexity of Recursive Programs (GA), pp. 129–140.

ICALP-1974-Reynolds #continuation #on the #semantics

On the Relation between Direct and Continuation Semantics (JCR), pp. 141–156.

ICALP-1974-PaciniMT #graph #recursion #representation

Graph Representation and Computation Rules for Typeless Recursive Languages (GP, CM, FT), pp. 157–169.

ICALP-1974-Dezani-CiancagliniZ #algorithm #parallel #performance

Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms (MDC, MZ), pp. 170–184.

ICALP-1974-BohmD #combinator #equation #normalisation #problem

Combinatorial Problems, Combinator Equations and Normal Forms (CB, MDC), pp. 185–199.

ICALP-1974-CourcelleKV #equation #equivalence #french #recursion #reduction

Algorithmes d’equivalence et de reduction a des expressions minimales dans une classe d’equations recursives simples (BC, GK, JV), pp. 200–213.

ICALP-1974-Lomet #automation #generative #multi #parsing

Automatic Generation of Multiple Exit Parsing Subroutines (DBL), pp. 214–231.

ICALP-1974-GellerGH #parsing

Production Prefix Parsing (MMG, SLG, MAH), pp. 232–241.

ICALP-1974-Pager #lr #on the #parsing

On Eliminating Unit Productions from LR(k) Parsers (DP), pp. 242–254.

ICALP-1974-Lang #nondeterminism #parsing #performance

Deterministic Techniques for Efficient Non-Deterministic Parsers (BL), pp. 255–269.

ICALP-1974-LipskiM #graph

File Organization, An Application of Graph Theory (WLJ, VWM), pp. 270–279.

ICALP-1974-Monien #bound #recursion

Characterizations of Time-Bounded Computations by Limited Primitive Recursion (BM), pp. 280–293.

ICALP-1974-Schnorr #information management #on the

On Maximal Merging of Information in Boolean Computations (CPS), pp. 294–300.

ICALP-1974-HartmanisB #on the

On Simple Goedel Numberings and Translations (JH, TPB), pp. 301–316.

ICALP-1974-Mehlhorn #decidability #recursion

The “Almost All” Theory of Subrecursive Degrees is Decidable (KM), pp. 317–325.

ICALP-1974-Weihrauch #complexity

The Compuational Complexity of Program Schemata (KW), pp. 326–334.

ICALP-1974-Fontet #french #morphism #permutation

Un resultat en theorie des groupes de permutations et son application au calcul effectif du groupe d’automorphismes d’un automate fini (MF), pp. 335–341.

ICALP-1974-Cesari #french

Sur l’application du theoreme de Suschkewitsch a l’etude des codes rationnets complets (YC), pp. 342–350.

ICALP-1974-Gecseg #automaton #composition

Composition of Automata (FG), pp. 351–363.

ICALP-1974-CremersG #context-free grammar

Context-Free Grammar Forms (ABC, SG), pp. 364–382.

ICALP-1974-BerstelB #french

Une suite decroissante de cônes rationnels (JB, LB), pp. 383–397.

ICALP-1974-Hotz #german

Komplexitätsmaße für Ausdrücke (GH), pp. 398–412.

ICALP-1974-FischerP #algorithm #matrix #performance #using

Efficient Procedures for Using Matrix Algorithms (PCF, RLP), pp. 413–427.

ICALP-1974-Fischer #algorithm #matrix

Further Schemes for Combining Matrix Algorithms (PCF), pp. 428–436.

ICALP-1974-Book #complexity #on the

On the Structure of Complexity Classes (RVB), pp. 437–445.

ICALP-1974-FlajoletS #on the #set

On Sets Having Only Hard Subsets (PF, JMS), pp. 446–457.

ICALP-1974-Weicker #memory management #turing machine

Turing Machines with Associative Memory Access (RW), pp. 458–472.

ICALP-1974-EhrenfeuchtR #morphism #term rewriting #trade-off #using

Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems (AE, GR), pp. 473–480.

ICALP-1974-Novotny

Operators Reducing Generalized OL-Systems (MN), pp. 481–494.

ICALP-1974-CulikM #parallel #term rewriting

Parallel Rewriting Systems on terms (KCI, TSEM), pp. 495–510.

ICALP-1974-Blattner #context-free grammar #set

Transductions of Context-Free Languages into Sets of Sentential Forms (MB), pp. 511–522.

ICALP-1974-Salomaa #parallel #term rewriting

Parallelism in Rewriting Systems (AS), pp. 523–533.

ICALP-1974-Kemp #german

Mehrdeutigkeiten Kontextfreier Grammatiken (RK), pp. 534–546.

ICALP-1974-DilgerR #monad #strict

Monadic Program Schemes Under Restricted Classes of Free Interpretations (WD, PR), pp. 547–561.

ICALP-1974-Chandra

Generalized Program Schemas (AKC), pp. 562–576.

ICALP-1974-Bertsch #decidability

A Decidability Result for Sequential Grammars (EB), pp. 577–583.

ICALP-1974-Kreczmar #algorithm #logic #problem

Effectivity Problems of Algorithmic Logic (AK), pp. 584–600.

ICALP-1974-Hayes #nondeterminism

Simple and Structural Redundancy in Non-Deterministic Computation (PJH), pp. 601–611.

ICALP-1974-Schutzenberger #french

Sur une propriete syntactique des relations rationnelles (MPS), pp. 612–619.