<電子ブック>
Mathematical Foundations of Computer Science 1978 : 7th Symposium Zakopane, Poland, September 4-8, 1978. Proceedings / edited by J. Winkowski
(Lecture Notes in Computer Science. ISSN:16113349 ; 64)
版 | 1st ed. 1978. |
---|---|
出版者 | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
出版年 | 1978 |
本文言語 | 英語 |
大きさ | IX, 556 p : online resource |
著者標目 | Winkowski, J editor SpringerLink (Online service) |
件 名 | LCSH:Computer science LCSH:Compilers (Computer programs) FREE:Theory of Computation FREE:Compilers and Interpreters |
一般注記 | The connection between modal logic and algorithmic logics -- The algebraic semantics of recursive program schemes -- Finding the correctness proof of a concurrent program -- An algebra for parallelism based on petri nets -- Data types as functions -- Synthesis of communicating behaviour -- Programming languages as mathematical objects -- Writing and verifying sequential files updating programs -- On the completeness of query languages for relational data bases -- Mastering contextsensitivity in programming languages -- Decision problems concerning parallel programming -- Attribute grammars and two-level grammars: A unifying approach -- Extensions and implementations of abstract data type specifications -- Concurrency of manipulations in multidimensional information structures -- Deriving structures from structures -- Semantics of nondeterminism, concurrency and communication -- Contribution to the theory of concurrency in databases -- Facts in place/transition-nets -- Loop programs and classes of primitive recursive functions -- Dynamic theories of real and complex numbers -- Multiplicative complexity of a pair of bilinear forms and of the polynomial multiplication -- Some applications of algebraic semantics -- Goal-oriented derivation of logic programs -- Transforming recursion equations to algorithms -- Structural invariants for some classes of structured programs -- Synthesis of concurrent schemes -- Fast matrix multiplication by boolean RAM in linear storage -- Cycles of partial orders -- Complexity measures defined by mazurkiewicz-algorithms -- On functional grammars -- Analysis of a universal class of hash functions -- A framework for producing deterministic canonical bottom-up parsers -- Cooperating grammar systems -- Synchronized petri nets : A model for the description of non-autonomous sytems -- On divergence and halting problems for monadic program schemas -- Compression of clustered inverted files -- The completeness of propositional dynamic logic -- Improving memory utilization in transforming recursive programs -- On two subclasses of real-time grammars -- On information storage and retrieval systems an algebraic approach, part 1 -- Probabilistic LCF -- On algorithmic theory of stacks -- Analyzing program solutions of coordination problems by cp-nets -- Structural properties of petri nets -- Ensuring correctness by arbitrary postfixed-points -- String-matching in real time: Some properties of the data structure -- Name independence and database abstraction in the relational model -- Free Petri net languages -- Transformations to produce certain covering grammars -- On the computational power of extended petri nets -- Theory of relations for databases — a tutorial survey HTTP:URL=https://doi.org/10.1007/3-540-08921-7 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9783540357575 |
|
電子リソース |
|
EB00224836 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA75.5-76.95 DC23:004.0151 |
書誌ID | 4001088645 |
ISBN | 9783540357575 |