Logic, Language and Computation
Festschrift in Honor of Satoru Takasu
1st Edition
Published on 30. March 1994
Book
Paperback/Softback
XIII, 269 pages
978-3-540-57935-9 (ISBN)
Description
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.
More details
Series
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XIII, 269 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 16 mm
Weight
441 gr
ISBN-13
978-3-540-57935-9 (9783540579359)
DOI
10.1007/BFb0032390
Schweitzer Classification
Content
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.