---

＜電子ブック＞
Mathematical Foundations of Software Development. Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, March 25-29, 1985 : Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'85) / edited by Hartmut Ehrig, Christiane Floyd, Maurice Nivat, James Thatcher
(Lecture Notes in Computer Science. ISSN:16113349 ; 185)

版	1st ed. 1985.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1985
本文言語	英語
大きさ	XVIII, 422 p : online resource
著者標目	Ehrig, Hartmut editor Floyd, Christiane editor Nivat, Maurice editor Thatcher, James editor SpringerLink (Online service)
件　名	LCSH:Computer science LCSH:Software engineering LCSH:Discrete mathematics FREE:Theory of Computation FREE:Software Engineering FREE:Computer Science Logic and Foundations of Programming FREE:Discrete Mathematics
一般注記	Specification and top down design of distributed systems -- Specification languages for distributed systems -- Semantically based programming tools (Summary) -- From function level semantics to program transformation and optimization -- Inductively defined functions -- Three approaches to type structure -- On the maximum size of random trees -- Fast searching in a real algebraic manifold with applications to geometric complexity -- Typed categorical combinatory logic -- A path ordering for proving termination of term rewriting systems -- A rewrite rule based approach for synthesizing abstract data types -- “Delayability” in proofs of strong normalizability in the typed lambda Calculus -- Bisimulations and abstraction homomorphisms -- A metric characterization of fair computations in CCS -- A complete modal proof system for a subset of SCCS -- Amalgamation of graph transformations with applications to synchronization -- Decompilation of control structures by means of graph transformations -- Synchronized bottom-up tree automata and L-systems -- On observational equivalence and algebraic specification -- Parameter preserving data type specifications -- On the parameterized algebraic specification of concurrent systems -- The semantics of shared submodules specifications -- Why Horn formulas matter in computer science: Initial structures and generic examples -- On the implementation of abstract data types by programming language constructs -- A LISP compiler for FP language and its proof via algebraic semantics HTTP:URL=https://doi.org/10.1007/3-540-15198-2

 類似資料