## Hartmut Ehrig, Christiane Floyd, Maurice Nivat, James W. Thatcher

*Proceedings of the First International Joint Conference on Theory and Practice of Software Development, Volume 1: Colloquium on Trees in Algebra and Programming*

TAPSOFT, Vol.1: CAAP, 1985.

@proceedings{CAAP-1985, doi = "10.1007/3-540-15198-2", editor = "Hartmut Ehrig and Christiane Floyd and Maurice Nivat and James W. Thatcher", isbn = "3-540-15198-2", publisher = "{Springer}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the First International Joint Conference on Theory and Practice of Software Development, Volume 1: Colloquium on Trees in Algebra and Programming}", volume = 185, year = 1985, }

### Contents (19 items)

- CAAP-1985-ProtasiT #on the #random
- On the Maximum Size of Random Trees (MP, MT), pp. 139–144.
- CAAP-1985-Chazelle #algebra #complexity #geometry #performance
- Fast Searching in a Real Algebraic Manifold with Applications to Geometric Complexity (BC), pp. 145–156.
- CAAP-1985-Curien #combinator #logic
- Typed Categorial Combinatory Logic (PLC), pp. 157–172.
- CAAP-1985-KapurNS #order #proving #term rewriting #termination
- A Path Ordering for Proving Termination of Term Rewriting Systems (DK, PN, GS), pp. 173–187.
- CAAP-1985-KapurS #approach #data type #rule-based
- A Rewrite Rule Based Approach for Synthesizing Abstract Data Types (DK, MKS), pp. 188–207.
- CAAP-1985-Karr #proving #λ-calculus
- “Delayability” in Proofs of Strong Normalizability in the Typed Lambda Calculus (MK), pp. 208–222.
- CAAP-1985-Castellani #abstraction #bisimulation #morphism
- Bisimulations and Abstraction Homomorphisms (IC), pp. 223–238.
- CAAP-1985-Costa #metric
- A Metric Characterization of Fair Computations in CCS (GC), pp. 239–252.
- CAAP-1985-Sterling #proving #set
- A Complete Modal Proof System for a Subset of SCCS (CS), pp. 253–266.
- CAAP-1985-BoehmFH #graph transformation
- Amalgamation of Graph Transformations with Applications to Synchronization (PB, HRF, AH), pp. 267–283.
- CAAP-1985-Lichtblau #decompiler #graph transformation
- Decompilation of Control Structures by Means of Graph Transformations (UL), pp. 284–297.
- CAAP-1985-FachiniN #automaton #bottom-up
- Synchronized Bottom-Up Tree Automata and L-Systems (EF, MN), pp. 298–307.
- CAAP-1985-SannellaT #algebra #equivalence #on the #specification
- On Observational Equivalence and Algebraic Specification (DS, AT), pp. 308–322.
- CAAP-1985-Padawitz #data type #parametricity #specification
- Parameter Preserving Data Type Specifications (PP), pp. 323–341.
- CAAP-1985-AstesianoMRW #algebra #concurrent #on the #specification
- On the Parameterized Algebraic Specification of Concurrent Systems (EA, GM, GR, MW), pp. 342–358.
- CAAP-1985-BlumP #semantics #specification
- The Semantics of Shared Submodules Specifications (EKB, FPP), pp. 359–373.
- CAAP-1985-Makowsky #matter #why
- Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples (Extended Abstract) (JAM), pp. 374–387.
- CAAP-1985-PoigneV #data type #implementation #on the #programming language
- On the Implementation of Abstract Data Types by Programming Language Constructs (AP, JV), pp. 388–402.
- CAAP-1985-ChoppyGK #algebra #compilation #lisp #proving #semantics
- A Lisp Compiler for FP Language and Its Proof via Algebraic Semantics (CC, GG, SK), pp. 403–415.