1. S. Bellantoni. Predicative recursion and computational complexity. PhD thesis, University of Toronto, 192. Technical Report 26492.
2. S. Bellantoni, K.-H. Niggl, and H. Schwichtenberg. Ramification, Modality, and Linearity in Higher Type Recursion. in preparation, 1998.
3. Stephen Bellantoni and Stephen Cook. New recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97–110, 1992.
4. Nick Benton. A mixed linear and nonlinear logic: proofs, terms, and models. In Jerzy Tiuryn and Leszek Pacholski, editors, Proc. CSL '94, Kazimierz, Poland, Springer LNCS, Vol. 933, pages 121–135, 1995.
5. Luca Cardelli, Simone Martini, John C. Mitchell, and Andre Scedrov. An extension of system F with subtyping. Information and Computation, 109(1/2):4–56, 15 February/March 1994.