On list primitive recursion and the complexity of computinginf Loïc Colson Programming Logic Pages: 5 - 9
Partial inductive definitions as type-systems for λ-terms Daniel FredholmSvetozar Serafimovski Programming Logic Pages: 30 - 44
Complexity of subclasses of the intuitionistic propositional calculus G. Mints Programming Logic Pages: 64 - 69
Remarks on Martin-Löf's partial type theory Erik PalmgrenViggo Stoltenberg-Hansen Programming Logic Pages: 70 - 83
On specifications, subset types and interpretation of proposition in type theory Anne Salvesen Programming Logic Pages: 84 - 101
Local error estimation for singly-implicit formulas by two-step Runge-Kutta methods A. BellenZ. JackiewiczM. Zennaro Part II Numerical Mathematics Pages: 104 - 117
Generalized Padé approximations to the exponential function J. C. ButcherF. H. Chipman Part II Numerical Mathematics Pages: 118 - 130
Order conditions for canonical Runge-Kutta-Nyström methods M. P. CalvoJ. M. Sanz-Serna Part II Numerical Mathematics Pages: 131 - 142
Jacobi matrices for sums of weight functions Sylvan ElhayGene H. GolubJaroslav Kautsky Part II Numerical Mathematics Pages: 143 - 166
A family of centered forms for a polynomial Qun LinJ. G. Rokne Part II Numerical Mathematics Pages: 167 - 176