## Josep Díaz, Fernando Orejas

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

TAPSOFT, Vol.1: CAAP, 1989.

@proceedings{CAAP-1989, doi = "10.1007/3-540-50939-9", editor = "Josep Díaz and Fernando Orejas", isbn = "3-540-50939-9", publisher = "{Springer}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the Third International Joint Conference on Theory and Practice of Software Development, Volume 1: Colloquium on Trees in Algebra and Programming}", volume = 351, year = 1989, }

### Contents (19 items)

- CAAP-1989-AstesianoC #higher-order #modelling #on the #specification
- On the Existence of Initial Models for Partial (Higher-Order) Conditional Specifications (EA, MC), pp. 74–88.
- CAAP-1989-Badouel #infinity #monad
- Terms and Infinite Trees as Monads Over a Signature (EB), pp. 89–103.
- CAAP-1989-Baeza-Yates #graph #sequence
- The Subsequence Graph of a Text (RABY), pp. 104–118.
- CAAP-1989-BeauquierCPV #bound
- Syntactical Properties of Unbounded Nets of Processors (JB, AC, AP0, GVN), pp. 119–133.
- CAAP-1989-BloomS #equation #parallel #petri net
- Shuffle Equations, Parallel Transition Systems and Equational Petri Nets (SLB, KS), pp. 134–148.
- CAAP-1989-Boudol #communication #concurrent #towards #λ-calculus
- Towards a Lambda-Calculus for Concurrent and Communicating Systems (GB), pp. 149–161.
- CAAP-1989-BrogiG #distributed #prolog #semantics
- A Distributed, Net Oriented Semantics for Delta Prolog (AB, RG), pp. 162–177.
- CAAP-1989-BruinV #continuation #prolog #semantics
- Continuation Semantics for PROLOG with Cut (AdB, EPdV), pp. 178–192.
- CAAP-1989-DelestF #generative
- Labeled Trees and Relations on Generating Functions (MPD, JMF), pp. 193–206.
- CAAP-1989-Deransart #declarative #logic programming #proving #source code
- Proofs of Declarative Properties of Logic Programs (PD), pp. 207–226.
- CAAP-1989-DeruyverG #problem #reachability
- The Reachability Problem for Ground TRS and Some Extensions (AD, RG), pp. 227–243.
- CAAP-1989-Ganzinger #order
- Order-Sorted Completion: The Many-Sorted Way (Extended Abstract) (HG), pp. 244–258.
- CAAP-1989-Gogolla #algebra #approach #constraints
- Algebraization and Integrity Constraints for an Extended Entity-Relationship Approach (MG), pp. 259–274.
- CAAP-1989-HabelKV #bound #decidability #graph grammar #problem
- Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar (AH, HJK, WV), pp. 275–289.
- CAAP-1989-Hennicker #implementation #specification
- Implementation of Parameterized Observational Specifications (RH), pp. 290–305.
- CAAP-1989-KaplanG #attribute grammar #graph grammar #incremental
- Priority Controlled Incremental Attribute Evaluation in Attributed Graph Grammars (SMK, SKG), pp. 306–336.
- CAAP-1989-MiglioliMO #axiom #data type
- Semi-Constructive Formal Systems and Axiomatization of Abstract Data Types (PM, UM, MO), pp. 337–351.
- CAAP-1989-Padawitz #induction #proving
- Inductive Proofs by Resolution and Paramodulation (PP), pp. 352–368.
- CAAP-1989-StirlingW #calculus #model checking
- Local Model Checking in the Modal Mu-Calculus (CS, DW), pp. 369–383.