Samson Abramsky, T. S. E. Maibaum
Proceedings of the Fourth International Joint Conference on Theory and Practice of Software Development, Volume 1: Colloquium on Trees in Algebra and Programming
TAPSOFT, Vol.1: CAAP, 1991.

@proceedings{CAAP-1991,
	doi           = "10.1007/3-540-53982-4",
	editor        = "Samson Abramsky and T. S. E. Maibaum",
	isbn          = "3-540-53982-4",
	publisher     = "{Springer}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Fourth International Joint Conference on Theory and Practice of Software Development, Volume 1: Colloquium on Trees in Algebra and Programming}",
	volume        = 493,
	year          = 1991,
}

Contents (24 items)

CAAP-1991-Aceto #abstraction

Full Abstraction for Series-Parallel Pomsets (LA), pp. 1–25.

CAAP-1991-Ferrari #incremental #on the

On Causality Observed Incrementally, Finally (GLF), pp. 26–41.

CAAP-1991-Kwiatkowska #composition #on the

On the Domain of Traces and Sequential Composition (MZK), pp. 42–56.

CAAP-1991-KounalisL #commutative #compilation #pattern matching

Compilation of Pattern Matching with Associative-Commutative Functions (EK, DL), pp. 57–73.

CAAP-1991-Caron #automaton #bound #linear #term rewriting

Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties (ACC), pp. 74–89.

CAAP-1991-Broek #algebra #category theory #graph grammar #using

Algebraic Graph Rewriting Using a Single Pushout (PMvdB), pp. 90–102.

CAAP-1991-Baumeister #semantics #specification

Unifying Initial and Loose Semantics of Parameterized Specifications in an Arbitrary Institution (HB), pp. 103–120.

CAAP-1991-AstesianoC #algebra #specification #strict

Non-Strict Don't Care Algebras and Specifications (EA, MC), pp. 121–142.

CAAP-1991-Luo #refinement #specification #type system

Program Specification and Data Refinement in Type Theory (ZL), pp. 143–168.

CAAP-1991-Granger #congruence #linear #static analysis

Static Analysis of Linear Congruence Equalities among Variables of a Program (PG), pp. 169–192.

CAAP-1991-LuccioP #approximate #problem

Simple Solutions for Approximate Tree Matching Problems (FL, LP), pp. 193–201.

CAAP-1991-KilpelainenM #problem

The Tree Inclusion Problem (PK, HM), pp. 202–214.

CAAP-1991-KasangianV #calculus

Introducing a Calculus of Trees (SK, SV), pp. 215–240.

CAAP-1991-Amadio #framework

Domains in a Realizability Framework (RMA), pp. 241–263.

CAAP-1991-BloomE #algebra

Iteration Algebras (Extended Abstract) (SLB, ZÉ), pp. 264–274.

CAAP-1991-CorradiniRP #graph grammar #logic programming

Logic Programming as Hypergraph Rewriting (AC, FR, FPP), pp. 275–295.

CAAP-1991-BoerP #concurrent #constraints #programming

A Fully Abstract Model for Concurrent Constraint Programming (FSdB, CP), pp. 296–319.

CAAP-1991-GabbrielliL #algorithm #constraints

A Solved Form Algorithm for Ask and Tell Herbrand Constraints (MG, GL), pp. 320–337.

CAAP-1991-Prasad #calculus

A Calculus of Broadcasting Systems (KVSP), pp. 338–358.

CAAP-1991-NajmS #analysis #calculus #concurrent #process

Object-Based Concurrency: A Process Calculus Analysis (EN, JBS), pp. 359–380.

CAAP-1991-JonssonL #algebra #complexity #equation #on the #process

On the Complexity of Equation Solving in Process Algebra (BJ, KGL), pp. 381–396.

CAAP-1991-Breugel #comparative #integration #programming language #realtime #semantics

Comparative Semantics for a Real-Time Programming Language with Integration (FvB), pp. 397–411.

CAAP-1991-Ortega-MallenF #proving

A Complete Proof System for Timed Observations (YOM, DdFE), pp. 412–440.

CAAP-1991-Schwartzbach #type inference

Type Inference with Inequalities (MIS), pp. 441–455.