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.
Author(s): Susumu Hayashi, Yukihide Takayama (auth.), Neil D. Jones, Masami Hagiya, Masahiko Sato (eds.)
Series: Lecture Notes in Computer Science 792
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1994
Language: English
Pages: 269
Tags: Mathematical Logic and Formal Languages; Logics and Meanings of Programs; Computation by Abstract Devices; Programming Languages, Compilers, Interpreters; Artificial Intelligence (incl. Robotics); Mathematical Logic and Foundations
Lifschitz's logic of calculable numbers and optimizations in program extraction....Pages 1-9
On implicit arguments....Pages 10-30
A functional system with transfinitely defined types....Pages 31-60
The non-deterministic catch and throw mechanism and its subject reduction property....Pages 61-72
Conservativeness of Λ over λσ -calculus....Pages 73-94
ML with first-class environments and its type inference algorithm....Pages 95-116
A simple proof of the genericity lemma....Pages 117-118
The logic of FOL systems: Formulated in set theory....Pages 119-132
Well-ordering of algebras and Kruskal's theorem....Pages 133-172
On locomorphism in analytical equivalence theory....Pages 173-187
Analysis of a software/hardware system by tense arithmetic....Pages 188-205
The essence of program transformation by partial evaluation and driving....Pages 206-224
Program transformation via contextual assertions....Pages 225-254
On coding theorems with modified length functions....Pages 255-259
Thirty four comparisons are required to sort 13 items....Pages 260-269
