RIMS symposia on software science and engineering II : proceedings of the Symposia 1983 and 1984, Kyoto, Japan

Αποθηκεύτηκε σε:
Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Goto, Eiichi, 19..-
Άλλοι συγγραφείς: Yuasa, Taiichi (Διευθυντής έκδοσης), Araki, Keijiro, 1954- (Διευθυντής έκδοσης)
Μορφή: Livre numérique
Γλώσσα:Anglais
Έκδοση: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Σειρά:Lecture notes in computer science 220
Θέματα:
Διαθέσιμο Online:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Σημείωση: Actes de deux congrès tenus à Kyoto en 1983 et 1984, d'après l écran-titre
Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• RIMS symposia on software science and engineering II, proceedings, of the symposia 1983 and 1984, Kyoto, Japan ; ed, by E. Goto, K. Araki, T. Yuasa, Berlin, Springer, 1985, 1 Vol. (X-323 p.), Lecture notes in computer science, 3-540-16470-7
• RIMS Symposium on Software Science and Engineering II, Texte imprimé, 9783662173121
Πίνακας περιεχομένων:
  • A fast parallel merging algorithm for 2 3 trees
  • Evaluation of graph representations with active nodes
  • On equivalence transformations for term rewriting systems
  • A portable logic simulation system for development of FLATS machine
  • Partial computation with a dataflow machine
  • OR-Parallel Optimizing Prolog System: Pops its design and implementation in Concurrent Prolog
  • Incorporating Naïve Negation into Prolog
  • Algebraic specification method of programming languages
  • Multiversion concurrency control scheme for a distributed database system A trial to break concurrent update of redundant copies
  • Global storage allocation in attribute evaluation
  • On program transformation with tupling technique
  • Evaluation of working set algorithms for data-flow machines
  • Comparison of closure reduction and combinatory reduction schemes
  • The BC-chain method for representing combinators in linear space
  • Circuit simulation code generation by computer algebra
  • List 1 Algebraic code for simple harmonic motion
  • List 2 Generated fortran code for simple harmonic motion.