Logic, Language and Computation

Festschrift in Honor of Satoru Takasu
1994
ISBN: 978-3-540-57935-9
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 792, 269 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 441 g

Reihe: Lecture Notes in Computer Science

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 and coding theory. Not coincidentally, all the authors are either former students or close colleagues of Satoru Takasu, professor and director at the Research Institute of Mathematical Sciences at the University of Kyoto. The purpose of this volume is to celebrate Professor Takasu's influence on theoretical computer science in Japan and worldwide by his research, his philosophy, and his advising of students. The breadth, depth and quality of the papers are characteristic of his interests and activities.

Zielgruppe

Research

Autoren/Hrsg.

Jones, Neil

Sato, Masahiko

Hagiya, Masami

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Rechnerarchitektur
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Prozedurale Programmierung
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
• Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker

Inhaltsverzeichnis

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.