Mathematical Foundations of Computer Science 1993 de Andrzej M. Borzyszkowski

Mathematical Foundations of Computer Science 1993: 18th International Symposium, MFCS’93, Gdańsk, Poland, August 30–September 3, 1993 Proceedings: Lecture Notes in Computer Science, cartea 711

Andrzej M. Borzyszkowski

Stefan Sokolowski

en Limba Engleză Paperback – 18 aug 1993

This volume contains the proceedings of the 18thInternational Symposium on Mathematical Foundations ofComputer Science, MFCS '93, held in Gdansk, Poland,August-September 1993.The MFCS symposia, organized annually in Poland and theformer Czechoslovakia since 1972, have a long andwell-established tradition. Over the years they have servedas a meeting ground for specialists from all branches oftheoretical computer science, in particular- algorithms and complexity, automata theory and theory oflanguages,- concurrent, distributed and real-time systems,- the theory of functional, logic and object-orientedprogramming,- lambda calculus and type theory,- semantics and logics of programs,and others. The volume contains 12 invitedlectures and 56contributed papers selected from 133 submissions.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 571^.63 lei
20%

Preț: 336^.71 lei
20%

Preț: 333^.46 lei
20%

Preț: 662^.76 lei
20%

Preț: 330^.23 lei
20%

Preț: 747^.79 lei
20%

Preț: 438^.67 lei
20%

Preț: 369^.12 lei
20%

Preț: 315^.76 lei
20%

Preț: 584^.40 lei
20%

Preț: 148^.66 lei
20%

Preț: 122^.89 lei
20%

Preț: 315^.18 lei
20%

Preț: 256^.26 lei
20%

Preț: 1040^.03 lei
20%

Preț: 504^.56 lei
Preț: 402^.62 lei
20%

Preț: 346^.40 lei
20%

Preț: 301^.94 lei
20%

Preț: 237^.99 lei
5%

Preț: 365^.59 lei
20%

Preț: 309^.89 lei
20%

Preț: 321^.95 lei
20%

Preț: 310^.25 lei
20%

Preț: 334^.68 lei
Preț: 373^.56 lei
20%

Preț: 172^.68 lei
20%

Preț: 1386^.07 lei
20%

Preț: 315^.76 lei
20%

Preț: 1003^.66 lei
20%

Preț: 444^.17 lei
20%

Preț: 567^.60 lei
20%

Preț: 632^.22 lei
17%

Preț: 360^.18 lei
20%

Preț: 538^.28 lei
20%

Preț: 335^.08 lei
20%

Preț: 307^.68 lei
20%

Preț: 343^.16 lei
20%

Preț: 641^.78 lei
20%

Preț: 579^.56 lei
20%

Preț: 1053^.45 lei
15%

Preț: 568^.74 lei
Preț: 389^.47 lei
20%

Preț: 333^.46 lei
20%

Preț: 607^.38 lei
20%

Preț: 326^.97 lei

Specificații

ISBN-13: 9783540571827
ISBN-10: 3540571825
Pagini: 804
Ilustrații: XIII, 786 p.
Dimensiuni: 210 x 279 x 42 mm
Greutate: 1.11 kg
Ediția:Softcover reprint of the original 1st ed. 1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Cuprins

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 substitutionalgebras.- 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 decisionlists from noisy examples.- Analytic tableaux for finite and infinite Post logics.