Theoretical Computer Science 1999: Vol 212 Index PDF
Preview Theoretical Computer Science 1999: Vol 212 Index
Theoretical Computer Science Theoretical Computer Science 212 (1999) 309 Author index volume 212 (1999) (The issue number is given in front of the page numbers) Benke, M., Some complexity bounds for subtype inequalities Berarducci, A. and M. Dezani-Ciancaglini, Infinite A-calculus and types Bohm, C. and I. Guessarian, Foreword Boley, H., Functional-logic integration via minimal reciprocal extensions Bono, V. and M. Bugliesi, Matching for the lambda calculus of objects Bugliesi, M., see V. Bono Dezani-Ciancaglini, M., see A. Berarducci Dyckhoff, R. and L. Pinto, Permutability of proofs in intuitionistic sequent calculi Emms, M. and H. Leif, Extending the type checker of Standard ML by polymorphic recursion Guessarian, I., see C. Bohm Honsell, F. and M. Lenisa, Semantical analysis of perpetual strategies in j-calculus Intrigila, B. and M. Venturini Zilli, Orders, reduction graphs and spectra Lei’, H., see M. Emms Lenisa, M., see F. Honsell Pinto, L., see R. Dyckhoff Piperno, A., An algebraic view of the BOhm-out technique Schwichtenberg, H., Termination of permutative conversions in intuitionistic Gentzen calculi Spreen, D., On functions preserving levels of approximation: A refined model construc- tion for various lambda calculi Venturini Zilli, M., see B. Intrigila Elsevier Science B.V.
The list of books you might like
