Hartmut Ehrig (auth.), Hartmut Ehrig, Christiane Floyd, Maurice Nivat, James Thatcher (eds.)3540151982, 9783540151982
Table of contents :
Introduction….Pages 1-3
Specification and top down design of distributed systems….Pages 4-28
Specification languages for distributed systems….Pages 29-51
Semantically based programming tools (Summary)….Pages 52-59
From function level semantics to program transformation and optimization….Pages 60-91
Inductively defined functions….Pages 92-96
Three approaches to type structure….Pages 97-138
On the maximum size of random trees….Pages 139-144
Fast searching in a real algebraic manifold with applications to geometric complexity….Pages 145-156
Typed categorical combinatory logic….Pages 157-172
A path ordering for proving termination of term rewriting systems….Pages 173-187
A rewrite rule based approach for synthesizing abstract data types….Pages 188-207
“Delayability” in proofs of strong normalizability in the typed lambda Calculus….Pages 208-222
Bisimulations and abstraction homomorphisms….Pages 223-238
A metric characterization of fair computations in CCS….Pages 239-252
A complete modal proof system for a subset of SCCS….Pages 253-266
Amalgamation of graph transformations with applications to synchronization….Pages 267-283
Decompilation of control structures by means of graph transformations….Pages 284-297
Synchronized bottom-up tree automata and L-systems….Pages 298-307
On observational equivalence and algebraic specification….Pages 308-322
Parameter preserving data type specifications….Pages 323-341
On the parameterized algebraic specification of concurrent systems….Pages 342-358
The semantics of shared submodules specifications….Pages 359-373
Why Horn formulas matter in computer science: Initial structures and generic examples….Pages 374-387
On the implementation of abstract data types by programming language constructs….Pages 388-402
A LISP compiler for FP language and its proof via algebraic semantics….Pages 403-415
Reviews
There are no reviews yet.