Mathematical foundations of computer science 1993 : 18th International Symposium, MFCS'93 Gdańsk, Poland, August 30 September 3, 1993 : proceedings

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-estab...

Full beskrivning

Sparad:
Bibliografiska uppgifter
Institutionell upphovsman: Symposium on mathematical foundations of computer science :Gdańsk
Övriga upphovsmän: Sokołowski, Stefan, 19..- (Chefredaktör, huvudredaktör), Borzyszkowski, Andrzej M., 19..- (Chefredaktör, huvudredaktör)
Materialtyp: Livre numérique
Språk:Anglais
Publicerad: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Serie:Lecture notes in computer science 711
Ämnen:
Länkar:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Anmärkning: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Mathematical foundations of computer science 1993, 18th International Symposium, MFCS'93, Gdańsk, Poland, August 30-September 3, 1993, proceedings, Andrzej M. Borzyszkowski, Stefan Sokołowski, eds, Berlin, Springer-Verlag, 1993, 1 vol. (XIII-781 p.), Lecture notes in computer science, 3-540-57182-5
• Mathematical Foundations of Computer Science 1993, Texte imprimé, 9783662162651
LEADER 07214nam a22004337a 4500
001 944114
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155175335
020 |a 9783540479277 (PDF) 
041 0 |a eng 
082 |a 004 
111 2 |a Symposium on mathematical foundations of computer science  |n (18  |d  :1993  |c  :Gdańsk). 
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 [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 711  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
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 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. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
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. 
650 |a Informatique 
650 |a Algorithmes 
650 |a Logique symbolique et mathématique 
650 |a Informatique  |x Mathématiques 
650 |a Analyse combinatoire 
650 |a Structures de données (informatique) 
650 |a Actes de congrès 
700 1 |a Sokołowski, Stefan,  |d 19..-  |4 pbd 
700 1 |a Borzyszkowski, Andrzej M.,  |d 19..-  |4 pbd 
776 0 |0 01738205X  |t Mathematical foundations of computer science 1993  |o 18th International Symposium, MFCS'93, Gdańsk, Poland, August 30-September 3, 1993  |o proceedings  |f Andrzej M. Borzyszkowski, Stefan Sokołowski, eds  |c Berlin  |n Springer-Verlag  |d 1993  |p 1 vol. (XIII-781 p.)  |s Lecture notes in computer science  |z 3-540-57182-5 
776 0 |t Mathematical Foundations of Computer Science 1993  |b Texte imprimé  |z 9783662162651 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-57182-5  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-S78X7D93-4  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747922624  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-57182-5  |z Accès Université d'Orléans 
856 4 |5 180339901:750934948  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-57182-5  |z Accès INSA CVL 
997 |0 944114  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/