Logic, language, and computation : festschrift in honor of Satoru Takasu

This volume contains 15 papers from research areas where Japanese theoretical computer science is particularly strong. Many are about logic, and its realization and applications to computer science; others concern synthesis, transformation and implementation of programming languages, and complexity...

Cijeli opis

Spremljeno u:
Bibliografski detalji
Glavni autor: Jones, Neil D., 1941-
Daljnji autori: Hagiya, Masami, 1957-...., mathématicien (Urednik), Satō, Masahiko, 1947- (Urednik)
Format: Livre numérique
Jezik:Anglais
Izdano: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Serija:Lecture notes in computer science 792
Teme:
Online pristup:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Bilješka: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Logic, language, and computation, festschrift in honor of Satoru Takasu, Neil D. Jones, Masami Hagiya, Masahiko Sato, eds, Berlin, Springer-Verlag, 1994, 1 vol. (XII-269 p.), Lecture notes in computer science, 3-540-57935-4
• Logic, Language and Computation, Texte imprimé, 9783662192399
Sadržaj:
  • Lifschitz's logic of calculable numbers and optimizations in program extraction
  • On implicit arguments
  • A functional system with transfinitely defined types
  • The non-deterministic catch and throw mechanism and its subject reduction property
  • Conservativeness of ? over ??-calculus
  • ML with first-class environments and its type inference algorithm
  • A simple proof of the genericity lemma
  • The logic of FOL systems: Formulated in set theory
  • Well-ordering of algebras and Kruskal's theorem
  • On locomorphism in analytical equivalence theory
  • Analysis of a software/hardware system by tense arithmetic
  • The essence of program transformation by partial evaluation and driving
  • Program transformation via contextual assertions
  • On coding theorems with modified length functions
  • Thirty four comparisons are required to sort 13 items.