Vai al contenuto principale della pagina
| Titolo: |
Mathematical Foundations of Software Development. Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, March 25-29, 1985 [[electronic resource] ] : Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'85) / / edited by Hartmut Ehrig, Christiane Floyd, Maurice Nivat, James Thatcher
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1985 |
| Edizione: | 1st ed. 1985. |
| Descrizione fisica: | 1 online resource (XVIII, 422 p.) |
| Disciplina: | 004.0151 |
| Soggetto topico: | Computers |
| Software engineering | |
| Computer logic | |
| Combinatorics | |
| Theory of Computation | |
| Software Engineering | |
| Logics and Meanings of Programs | |
| Persona (resp. second.): | EhrigHartmut |
| FloydChristiane | |
| NivatMaurice | |
| ThatcherJames | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di contenuto: | 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. |
| Titolo autorizzato: | MATHEMATICAL foundations of software development ![]() |
| ISBN: | 3-540-39302-1 |
| Formato: | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996466099303316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |