Vor Ort
Merkzettel Warenkorb
  • Produktbild: Theoretical Aspects of Computer Software
  • Produktbild: Theoretical Aspects of Computer Software
Band 789

Theoretical Aspects of Computer Software International Symposium TACS ’94 Sendai, Japan, April 19–22, 1994 Proceedings

Aus der Reihe Lecture Notes in Computer Science

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

30.03.1994

Abbildungen

XI, 892 p.

Herausgeber

Masami Hagiya + weitere

Verlag

Springer Berlin

Seitenzahl

892

Maße (L/B/H)

23,5/15,5/4,9 cm

Gewicht

1346 g

Auflage

1994

Sprache

Englisch

ISBN

978-3-540-57887-1

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

30.03.1994

Abbildungen

XI, 892 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

892

Maße (L/B/H)

23,5/15,5/4,9 cm

Gewicht

1346 g

Auflage

1994

Sprache

Englisch

ISBN

978-3-540-57887-1

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Theoretical Aspects of Computer Software
  • Produktbild: Theoretical Aspects of Computer Software
  • Full Abstraction for PCF (extended abstract).- Fully abstract semantics for concurrent ?-calculus.- An operational approach to combining classical set theory and functional programming languages.- ML typing, explicit polymorphism and qualified types.- Extensions to type systems can preserve operational equivalences.- Constraint programming and database query languages.- Intuitionistic resolution for a logic programming language with scoping constructs.- Proof by pointing.- A computer-checked verification of Milner's scheduler.- A purely functional language with encapsulated assignment.- Simple termination of hierarchical combinations of term rewriting systems.- Separate abstract interpretation for control-flow analysis.- Extensible denotational language specifications.- A normalizing calculus with overloading and subtyping.- A theory of primitive objects.- Programming objects with ML-ART an extension to ML with abstract and record types.- A type system for a lambda calculus with assignments.- Theory and practice of Concurrent Object-Oriented Computing.- The family relation in Interaction Systems.- On syntactic and semantic action refinement.- Locality and true-concurrency in calculi for mobile processes.- Term rewriting properties of SOS axiomatisations.- The tyft/tyxt format reduces to tree rules.- Undecidable equivalences for basic parallel processes.- Normal proofs and their grammar.- A symmetric lambda calculus for “classical” program extraction.- The ? ?-calculus.- Syntactic definitions of undefined: On defining the undefined.- Discovering needed reductions using type theory.- Nontraditional applications of automata theory.- Abstract pre-orders.- Categorical models of relational databases I: Fibrational formulation, schema integration.- Petri nets, Hornprograms, Linear Logic, and vector games.- A complete type inference system for subtyped recursive types.- Subtyping with union types, intersection types and recursive types.- A decidable intersection type system based on relevance.- Temporal verification diagrams.- A semantic theory for Concurrent ML.- Replication in concurrent combinators.- Transitions as interrupts: A new semantics for timed statecharts.- Relating multifunctions and predicate transformers through closure operators.- Notes on typed object-oriented programming.- Observing truly concurrent processes.