Mathematical Foundations of Computer Science 1993 : 18th International Symposium, MFCS'93 Gdańsk, Poland, August 30-September 3, 1993 Proceedings /
Saved in:
| Author / Creator: | Borzyszkowski, Andrzej M. |
|---|---|
| Imprint: | Berlin, Heidelberg : Springer Berlin Heidelberg, 1993. |
| Description: | 1 online resource (XIII, 786 pages). |
| Language: | English |
| Series: | Lecture Notes in Computer Science, 0302-9743 ; 711 Lecture notes in computer science ; 711. |
| Subject: | |
| Format: | E-Resource Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/11080458 |
MARC
| LEADER | 00000cam a2200000Mi 4500 | ||
|---|---|---|---|
| 001 | 11080458 | ||
| 005 | 20170630045327.6 | ||
| 006 | m o d | ||
| 007 | cr nn|008mamaa | ||
| 008 | 121227s1993 gw o 000 0 eng | ||
| 003 | ICU | ||
| 040 | |a Nz |b eng |e pn |c UV0 |d OCLCO |d GW5XE |d OCLCF |d UA@ |d KIJ |d OCLCQ | ||
| 019 | |a 827359519 | ||
| 020 | |a 9783540479277 |q (electronic bk.) | ||
| 020 | |a 3540479279 |q (electronic bk.) | ||
| 020 | |z 3540479279 | ||
| 020 | |z 9783540571827 | ||
| 024 | 7 | |a 10.1007/3-540-57182-5 |2 doi | |
| 035 | |a (OCoLC)858926005 |z (OCoLC)827359519 | ||
| 050 | 4 | |a QA75.5-76.95 | |
| 072 | 7 | |a UYZG |2 bicssc | |
| 072 | 7 | |a COM037000 |2 bisacsh | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Borzyszkowski, Andrzej M. |1 http://viaf.org/viaf/30213745 | |
| 245 | 1 | 0 | |a Mathematical Foundations of Computer Science 1993 : |b 18th International Symposium, MFCS'93 Gdańsk, Poland, August 30-September 3, 1993 Proceedings / |c edited by Andrzej M. Borzyszkowski, Stefan Sokołowski. |
| 260 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg, |c 1993. | ||
| 300 | |a 1 online resource (XIII, 786 pages). | ||
| 336 | |a text |b txt |2 rdacontent |0 http://id.loc.gov/vocabulary/contentTypes/txt | ||
| 337 | |a computer |b c |2 rdamedia |0 http://id.loc.gov/vocabulary/mediaTypes/c | ||
| 338 | |a online resource |b cr |2 rdacarrier |0 http://id.loc.gov/vocabulary/carriers/cr | ||
| 490 | 0 | |a Lecture Notes in Computer Science, |x 0302-9743 ; |v 711 | |
| 520 | |a This volume contains the proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, MFCS '93, held in Gdansk, Poland, August-September 1993. The MFCS symposia, organized annually in Poland and the former Czechoslovakia since 1972, have a long and well-established tradition. Over the years they have served as a meeting ground for specialists from all branches of theoretical computer science, in particular - algorithms and complexity, automata theory and theory of languages, - concurrent, distributed and real-time systems, - the theory of functional, logic and object-oriented programming, - lambda calculus and type theory, - semantics and logics of programs, and others. The volume contains 12 invitedlectures and 56 contributed papers selected from 133 submissions. | ||
| 505 | 0 | |a On the unification free prolog programs -- Equivalences and preorders of transition systems -- Deliverables: a categorical approach to program development in type theory -- Complex and complex-like traces -- Symbolic bisimulations (abstract) -- Some results on the full abstraction problem for restricted lambda calculi -- Action calculi, or syntactic action structures -- Observable properties of higher order functions that dynamically create local names, or: What's new? -- The second calculus of binary relations -- An introduction to dynamic labeled 2-structures -- Post Correspondence Problem: Primitivity and interrelations with complexity classes -- A taste of linear logic -- On the tree inclusion problem -- On the adequacy of per models -- Hausdorff reductions to sparse sets and to sets of high information content -- Stores as homomorphisms and their transformations -- Comparative semantics for linear arrays of communicating processes -- Rabin tree automata and finite monoids -- Efficient type reconstruction in the presence of inheritance -- A characterization of Sturmian morphisms -- On the complexity of scheduling incompatible jobs with unit-times -- Isomorphisms between predicate and state transformers -- On the amount of nondeterminism and the power of verifying -- Observing distribution in processes -- Speedup of recognizable trace languages -- May I borrow your logic? -- Approximate and exact deterministic parallel selection -- Defining soft sortedness by abstract interpretation -- A model for real-time process algebras (extended abstract) -- Data encapsulation and modularity: Three views of inheritance -- Image compression using Weighted Finite Automata -- Filter models for a parallel and non deterministic?-calculus -- Real number computability and domain theory -- Lambda substitution algebras -- Global properties of 2D cellular automata: some complexity results -- Completeness results for linear logic on Petri nets -- An expressive logic for Basic Process Algebra -- The complexity of finding replicas using equality tests -- A complete axiomatization for branching bisimulation congruence of finite-state behaviours -- Object Oriented application flow graphs and their semantics -- Some hierarchies for the communication complexity measures of cooperating grammar systems -- Efficient parallel graph algorithms based on open ear decomposition -- On the communication complexity of parallel computation -- A taxonomy of forgetting automata -- Hybrid parallel programming and implementation of synchronised communication -- Proof systems for cause based equivalences -- A uniform universal CREW PRAM -- Observing located concurrency -- The boundary of substitution systems -- New algorithms for detecting morphic images of a word -- Ignoring nonessential interleavings in assertional reasoning on concurrent programs -- Constant time reductions in?-calculus -- Heterogeneous unified algebras -- A representation theorem for lambda abstraction algebras -- On saturated calculi for a linear temporal logic -- The snack powerdomain for database semantics -- Verifying properties of module construction in type theory -- On time-space trade-offs in dynamic graph pebbling -- Deterministic behavioural models for concurrency -- Real-time refinement: Semantics and application -- Deciding testing equivalence for real-time processes with dense time -- A calculus for higher order procedures with global variables -- Variable substitution with iconic combinators -- Feature constraints with first-class features -- Between Min Cut and Graph Bisection -- Paths and cycles in finite periodic graphs -- Learning decision lists from noisy examples -- Analytic tableaux for finite and infinite Post logics. | |
| 650 | 0 | |a Computer science. |0 http://id.loc.gov/authorities/subjects/sh89003285 | |
| 650 | 0 | |a Data structures (Computer science) |0 http://id.loc.gov/authorities/subjects/sh85035862 | |
| 650 | 0 | |a Computer software. |0 http://id.loc.gov/authorities/subjects/sh85029534 | |
| 650 | 0 | |a Logic design. |0 http://id.loc.gov/authorities/subjects/sh85078117 | |
| 650 | 0 | |a Combinatorial analysis. |0 http://id.loc.gov/authorities/subjects/sh85028802 | |
| 650 | 1 | 4 | |a Computer Science. |
| 650 | 2 | 4 | |a Computation by Abstract Devices. |
| 650 | 2 | 4 | |a Algorithm Analysis and Problem Complexity. |
| 650 | 2 | 4 | |a Logics and Meanings of Programs. |
| 650 | 2 | 4 | |a Mathematical Logic and Formal Languages. |
| 650 | 2 | 4 | |a Data Structures. |
| 650 | 7 | |a Combinatorial analysis. |2 fast |0 (OCoLC)fst00868961 | |
| 650 | 7 | |a Computer science. |2 fast |0 (OCoLC)fst00872451 | |
| 650 | 7 | |a Computer software. |2 fast |0 (OCoLC)fst00872527 | |
| 650 | 7 | |a Data structures (Computer science) |2 fast |0 (OCoLC)fst00887978 | |
| 650 | 7 | |a Logic design. |2 fast |0 (OCoLC)fst01002045 | |
| 655 | 4 | |a Electronic books. | |
| 700 | 1 | |a Sokołowski, Stefan. |0 http://id.loc.gov/authorities/names/n87923716 |1 http://viaf.org/viaf/169976011 | |
| 776 | 0 | 8 | |i Print version: |z 9783540571827 |
| 830 | 0 | |a Lecture notes in computer science ; |v 711. |x 0302-9743 | |
| 856 | 4 | 0 | |u http://link.springer.com/10.1007/3-540-57182-5 |y SpringerLink |
| 903 | |a HeVa | ||
| 929 | |a eresource | ||
| 999 | f | f | |i 9c507676-a8af-57c1-b685-6e9cd22aa501 |s ff37629e-c419-57b7-8024-18a158f27a9c |
| 928 | |t Library of Congress classification |a QA75.5-76.95 |l Online |c UC-FullText |u http://link.springer.com/10.1007/3-540-57182-5 |z SpringerLink |g ebooks |i 9890684 | ||