Giorgio Ausiello, Corrado Böhm
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
ICALP, 1978.

@proceedings{ICALP-1978,
	address       = "Udine, Italy",
	editor        = "Giorgio Ausiello and Corrado Böhm",
	isbn          = "3-540-08860-1",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Fifth Colloquium on Automata, Languages and Programming}",
	volume        = 62,
	year          = 1978,
}

Contents (37 items)

6 ×#french
4 ×#on the
3 ×#complexity
3 ×#problem
3 ×#recursion
3 ×#set
3 ×#λ-calculus
2 ×#logic
2 ×#network
2 ×#nondeterminism

ICALP-1978-AlbertMR #generative

Simple EOL Forms under Uniform Interpretation Generating CF Languages (JA, HAM, GR), pp. 1–14.

ICALP-1978-AltenkampM #named

Codes: Unequal Probabilities, Unequal Letter Costs (DA, KM), pp. 15–25.

ICALP-1978-ArnoldD #french #morphism

Sul l’inversion des morphisms d’arbres (AA, MD), pp. 26–35.

ICALP-1978-Barth #set

Grammars with Dynamic Control Sets (GB), pp. 36–51.

ICALP-1978-Beauquier #french

Ambiguite Forte (JB), pp. 52–62.

ICALP-1978-Berman #complexity

Relationship Between Density and Deterministic Complexity of NP-Complete Languages (PB), pp. 63–71.

ICALP-1978-Berry #modelling #λ-calculus

Stable Models of Typed λ-Calculi (GB), pp. 72–89.

ICALP-1978-Biskup #metric #turing machine

Path Measures of Turing Machine Computations (JB), pp. 90–104.

ICALP-1978-Boe #french

Une Famille Remarquable de Codes Indecomposables (JMB), pp. 105–112.

ICALP-1978-BookGW

Comparisons and Reset Machines (RVB, SAG, CW), pp. 113–124.

ICALP-1978-Commentz-Walter #trade-off

Size-Depth Tradeoff in Boolean Formulas (BCW), pp. 125–141.

ICALP-1978-CoppoDR #finite #set #λ-calculus

(Semi)-separability of Finite Sets of Terms in Scott’s D∞-Models of the λ-Calculus (MC, MDC, SRDR), pp. 142–164.

ICALP-1978-CremersH #using

Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (ABC, TNH), pp. 165–176.

ICALP-1978-DammF #on the #power of #recursion #self

On the Power of Self-Application and Higher Type-Recursion (WD, EF), pp. 177–191.

ICALP-1978-DobkinM #bound #problem

Time and Space Bounds for Selection Problems (DPD, JIM), pp. 192–204.

ICALP-1978-EhrigKP #data type #implementation #specification

Stepwise Specification and Implementation of Abstract Data Types (HE, HJK, PP), pp. 205–226.

ICALP-1978-FortuneHS #complexity #equivalence #for free

The Complexity of Equivalence and Containment for Free Single Variable Program Schemes (SF, JEH, EMS), pp. 227–240.

ICALP-1978-Galil #algorithm #on the #string

On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm (ZG), pp. 241–250.

ICALP-1978-Gallier #correctness #nondeterminism #recursion #semantics #source code

Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures (JHG), pp. 251–267.

ICALP-1978-Harel #logic #source code

Arithmetical Completeness in Logics of Programs (DH), pp. 268–288.

ICALP-1978-ItaiR #graph

Covering a Graph by Circuits (AI, MR), pp. 289–299.

ICALP-1978-Lingas #game studies #problem

A PSPACE Complete Problem Related to a Pebble Game (AL), pp. 300–321.

ICALP-1978-Mignotte #effectiveness #linear #recursion #sequence

Some Effective Results About Linear Recursive Sequences (MM), pp. 322–329.

ICALP-1978-Nijholt #on the #parsing

On the Parsing and Covering of Simple Chain Grammars (AN), pp. 330–344.

ICALP-1978-Pin #french

Sur un Cas Particulier de la Conjecture de Cerny (JÉP), pp. 345–352.

ICALP-1978-PriceW #stack

States Can Sometimes Do More Than Stack Symbols in PDA’s (JKP, DW), pp. 353–362.

ICALP-1978-Restivo #monad #set

Some Decision Results for Recognizable Sets in Arbitrary Monoids (AR), pp. 363–371.

ICALP-1978-Reutenauer #commutative #french

Sur les Series Rationnelles en Variables Non Commutatives (CR), pp. 372–381.

ICALP-1978-Saarinen #attribute grammar #on the #performance

On Constructing Efficient Evaluators for Attribute Grammars (MS), pp. 382–397.

ICALP-1978-Sale #french #λ-calculus

Une Extension de la Theorie des Types en λ-Calcul (PS), pp. 398–410.

ICALP-1978-Savitch #complexity #nondeterminism #parallel

Parallel and Nondeterministic Time Complexity Classes (WJS), pp. 411–424.

ICALP-1978-Schnorr #multi #network #symmetry

Multiterminal Network Flow and Connectivity in Unsymmetrical Networks (CPS), pp. 425–439.

ICALP-1978-ScioreT

Admissible Coherent CPO’s (ES, AT), pp. 440–456.

ICALP-1978-Toffoli #integration #network

Integration of the Phase-Difference Relations in Asynchronous Sequential Networks (TT), pp. 457–463.

ICALP-1978-Valk #petri net #self

Self-Modifying Nets, a Natural Extension of Petri Nets (RV), pp. 464–476.

ICALP-1978-Zilli #combinator #logic #normalisation

Head Recurrent Terms in Combinatory Logic: A Generalization of the Notion of Head Normal Form (MVZ), pp. 477–493.

ICALP-1978-Wiehagen #formal method #induction #problem

Characterization Problems in the Theory of Inductive Inference (RW), pp. 494–508.