Abstract is missing.
- Shrinkable Polymorphic VariantsKoji Kagawa. 1-15
- An Overview of the Chameleon SystemMartin Sulzmann. 16-30
- Relaxing the Value RestrictionJacques Garrigue. 31-45
- Pruning Unnecessary Computations using Improving SequencesHideya Iwasaki. 46-57
- Algebraic construction of graphs with bounded tree width and its applications - Catamorphic Approach to Program AnalysesMizuhito Ogawa, Zhenjiang Hu, Isao Sasano, Masato Takeichi. 58-73
- Folds with Dependent TypesJan-Li Lin. 74-83
- What Is the Right Logical Framework for Evolution of KnowledgeWei Li. 84-94
- Specification based on Backus-Naur Formalism and Programming LanguageGuoyong, Peimin Deng, Jiali Feng. 95-101
- COPLA* - a Middleware for Distributed DatabasesJavier Esparza Peidro, Antonio Calero Monteagudo, Jordi Bataller, Francesc D. Muñoz-Escoí, Hendrik Decker, José M. Bernabéu-Aubán. 102-113
- Functional Logic Origami ProgrammingTetsuo Ida. 114
- Programming with Logical LinksKazunori Ueda. 115-126
- An Interoperable Calculus for External Object AccessAtsushi Ohori, Kiyoshi Yamatodani. 127
- Static Extensionality Checking for Lambda-Definable Functions Over LatticesKwangkeun Yi, Hyunjun Eo. 128-144
- Deforesting in Accumulating Parameters via Type-Directed TransformationsSusumu Nishimura. 145-159
- Fusion Transformation on Functional Programs of Regular Expression TypesKazuhiko Kakehi, Zhenjiang Hu, Masato Takeichi. 160-174
- A Type-Based Approach to Parallelization (preliminary report)Dana N. Xu, Siau-Cheng Khoo, Wei-Ngan Chin, Zhenjiang Hu. 175-192
- On Quasi-Open BisimulationYuxi Fu. 193-215
- Bisimulation for Higher-Order Pi-calculusXinxin Liu, Yongjian Li. 216-229
- An Automatic Program Inverter for Lisp: Potential and LimitationsRobert Glück, Masahiko Kawabe. 230-245
- Flattening Transformation for Efficient Segmented Computation - Segmented Diffusion TheoremZhenjiang Hu, Hideya Iwasaki, Masato Takeichi. 246-257
- Implementation of Parallel Tree Skeletons on Distributed SystemsKiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi. 258-271
- An Optimal Staging AlgorithmTakuma Murakami, Zhenjiang Hu, Masato Takeichi. 272-284
- An Improved Differential Fixpoint Iteration Method for Program AnalysisHyunjun Eo, Kwangkeun Yi. 285-301
- Type-Based Information Analysis for Low-Level LanguagesNaoki Kobayashi, Keita Shirane. 302-316
- Inserting Safe Memory Re-use Commands into ML-like ProgramsOukseh Lee, Hongseok Yang, Kwangkeun Yi. 317-333
- Association Computation for Information AccessAkihiko Takano, Shingo Nishioka, Osamu Imaichi, Yoshiki Niwa. 334-336
- An Approach for Assessing Software CouplingBixin Li. 337-351
- Data Flow Analysis of Secure Information-FlowKyung-Goo Doh, Seung Cheol Shin, Kwangkeun Yi. 352-365
- Yicho - A System for Programming Program CalculationsTetsuo Yokoyama, Zhenjiang Hu, Masato Takeichi. 366-382
- Recursion Removal from Recursive Programs with One Descent FunctionYusuke Ichikawa, Zenjiro Konishi, Yoshihiko Futamura. 383-395
- Extending Sized Type with Collection AnalysisWei-Ngan Chin, Siau-Cheng Khoo, Dana N. Xu. 396-413