Abstract:
This volume contains the proceedings of ICC'01, which was
held at the University of Aarhus on 20-21 May 2001.
Available as PostScript, PDF.
Contents
- iii
- Foreword
- 1
- Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, and Sebastiaan A. Terwijn: Linear Ramified Higher Type Recursion and Parallel Computation
- 11
- Salvatore Caporaso and Vito L. Plantamura: Feasibility, Provability, and Restrictions to von Neumann Architecture
- 19
- Martin Hofmann: The Strength of Non Size-Increasing Computation
- 37
- Neil D. Jones: Program Analysis for Implicit Computational Complexity
- 39
- Ulrich Kohlenbach: Proof Mining in Functional Analysis
- 41
- Daniel Leivant: Termination Proofs and Complexity Certification
- 65
- Daniel Leivant: The boundedness principle
- 75
- Daniel Leivant: Substructural Termination Proofs and Feasibility Certification
- 93
- Jean-Yves Moyen: An Analyser of Rewriting Systems Complexity
- 101
- Lars Kristiansen and Karl-Heinz Niggl: On the Computational Complexity of Stack Programs
- 117
- Paulo Oliva and Ulrich Kohlenbach: Proof Mining in
-Approximation
- 123
- Chung-Chih Li and Jim Royer: On Type-2 Complexity Classes
- 139
- Dieter Spreen: Safe Weak Minimization Revisited