|
|
|
|
LEADER |
03648nam a2200541 4500 |
001 |
978-3-540-49366-2 |
003 |
DE-He213 |
005 |
20191023222110.0 |
007 |
cr nn 008mamaa |
008 |
121227s1998 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540493662
|9 978-3-540-49366-2
|
024 |
7 |
|
|a 10.1007/3-540-49366-2
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA75.5-76.95
|
050 |
|
4 |
|a QA76.63
|
072 |
|
7 |
|a UY
|2 bicssc
|
072 |
|
7 |
|a COM014000
|2 bisacsh
|
072 |
|
7 |
|a UY
|2 thema
|
072 |
|
7 |
|a UYA
|2 thema
|
082 |
0 |
4 |
|a 004.0151
|2 23
|
245 |
1 |
0 |
|a Advances in Computing Science - ASIAN'98
|h [electronic resource] :
|b 4th Asian Computing Science Conference, Manila, The Philippines, December 8-10, 1998, Proceedings /
|c edited by Jieh Hsiang, Atsushi Ohori.
|
250 |
|
|
|a 1st ed. 1998.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 1998.
|
300 |
|
|
|a X, 314 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 1538
|
505 |
0 |
|
|a Invited Talk 1 -- Testing Proofs by Examples -- Session 1 -- Rigid Reachability -- Mechanizing Reasoning about Large Finite Tables in a Rewrite Based Theorem Prover -- A Polymorphic Language Which Is Typable and Poly-step -- Cut Elimination for Classical Proofs as Continuation Passing Style Computation -- Tutorial 1 -- Semantics and Logic for Provable Fault-Tolerance, A Tutorial -- Invited Talk 2 -- The Rewriting Calculus as a Semantics of ELAN -- Session 2 -- Tried Linear Hashing -- A New Factoring Algorithm for Magic Predicates -- An Optimal Parallel Algorithm for the Perfect Dominating Set Problem on Distance-Hereditary Graphs -- Session 3 -- Taxonomy and Expressiveness of Preemption: A Syntactic Approach -- Exploring Regional Locality in Distributed Shared Memory -- Guaranteed Mutually Consistent Checkpointing in Distributed Computations -- Session 4 -- Type Inference for First-Class Messages with Feature Constraints -- Two Flavors of Offine Partial Evaluation -- First-Class Contexts in ML -- Keynote Address -- Formal Methods: Past, Present, and Future -- Session 5 -- A Comparison of Petri Net Semantics under the Collective Token Philosophy -- Bisimulation Lattice of Chi Processes -- Eventuality in LOTOS with a Disjunction Operator -- Towards a Characterisation of Finite-State Message-Passing Systems -- Tutorial 2 -- Mobile Computation: Calculus and Languages (A Tutorial).
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Programming languages (Electronic computers).
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
1 |
4 |
|a Theory of Computation.
|0 http://scigraph.springernature.com/things/product-market-codes/I16005
|
650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|0 http://scigraph.springernature.com/things/product-market-codes/I14037
|
650 |
2 |
4 |
|a Artificial Intelligence.
|0 http://scigraph.springernature.com/things/product-market-codes/I21000
|
700 |
1 |
|
|a Hsiang, Jieh.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Ohori, Atsushi.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662203552
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540653882
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 1538
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-49366-2
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|