Abstract is missing.
- Lifschitz Logic of Calcubable Numbers and Optimizations in Program ExtractionSusumu Hayashi, Yukihide Takayama. 1-9
- On Implicit ArgumentsMasami Hagiya, Yozo Toda. 10-30
- A Functional System with Transfinitely Defined TypesMariko Yasugi, Susumu Hayashi. 31-60
- The Non-deterministic Catch and Throw Mechanism and Its Subject Reduction PropertyHiroshi Nakano. 61-72
- Conservativeness of Lambda over lambda-sigma-CalculusMasahiko Sato, Yukiyoshi Kameyama. 73-94
- ML with First-Class Environments and its Type Inference AlgorithmShin-ya Nishizaki. 95-116
- A Simple Proof of the Genericity LemmaMasako Takahashi. 117-118
- The Logic of FOL Systems: Formulated in Set TheoryRichard W. Weyhrauch, Carolyn L. Talcott. 119-132
- Well-Ordering of Algebras and Kruskal s TheoremRyu Hasegawa. 133-172
- On Locomorphism in Analytical Equivalence TheoryShigeru Igarashi, Tetsuya Mizutani, Takashi Tsuji, Chiharu Hosono. 173-187
- Analysis of a Software/Hardware System by Tense ArithmeticKohji Tomita, Takashi Tsuji, Shigeru Igarashi. 188-205
- The Essence of Program Transformation by Partial Evaluation and DrivingNeil D. Jones. 206-224 [doi]
- Program Transformation via Contextual AssertionsIan A. Mason, Carolyn L. Talcott. 225-254
- On Coding Theorems with Modified Length FunctionsKojiro Kobayashi. 255-259
- Thirty four Comparisons are Required to Sort 13 ItemsTakumi Kasai, Shusaku Sawato, Shigeki Iwata. 260-269