Semantics of linear/modal lambda calculus

Journal of Functional Programming

Volumn 9, Issue 3, 1999, Pages 247-277

  Hofmann, Martin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033416921     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003433     Document Type: Article

References (20)

1. Asperti, A. (1998) Light affine logic. Proc. Symp. Logic in Comp. Sci. (LICS '98). IEEE, 1998.
2. Bellantoni, S. (1992) Predicative recursion and computational complexity. PhD thesis, University of Toronto, 192. Technical Report 264/92.
3. Bellantoni, S., Niggl, K.-H. and Schwichtenberg, H. (1998) Ramification, Modality, and Linearity in Higher Type Recursion. in preparation.
4. Bellantoni, S. and Cook, S. (1992) New recursion-theoretic characterization of the polytime functions. Computational Complexity, 2, 97-110.
5. Caseiro, V.-H. (1997) Equations for Denning Poly-time Functions. PhD thesis, University of Oslo. (Available by ftp from ftp.ifi.uio.no/pub/vuokko/0adm.ps.)
6. Clote, P. (1996) Computation models and function algebras. Available electronically under http://thelonius.tcs.informatik.uni-muenchen.de/~clote/Survey.ps.gz.
7. Cobham, A. (1965) The intrinsic computational difficulty of functions. In: Y. Bar-Hillel, editor, Logic, Methodology, and Philosophy of Science II, pp. 24-30. Springer Verlag.
8. Girard, J.-Y. (1995) Light Linear Logic. Information and Computation, 143, 1998.
9. Hofmann, M. (1997) An application of category-theoretic semantics to the characterisation of complexity classes using higher-order function algebras. Bulletin of Symbolic Logic, 3(4), 469-485.
10. Hofmann, M. (1998a) Linear types and non-size-increasing polynomial time computation. Proc. Symp. Logic in Comp. Sci. (LICS '99), IEEE, 1999.
11. Hofmann, M. (1998b) A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion. Proc. CSL '97: LNCS 1414, Aarhus. Springer-Verlag, pp. 275-294.
12. Hofmann, M. (1998c) Type systems for polynomial-time computation. Habilitation thesis, TU Darmstadt, Germany, 1999. Appeared as Edinburgh Univ. LFCS Technical Report ECS-LFCS-99-406, Abridged and revised version to appear in Annals of Pure and Applied Logic.
13. Lafont, Y. and Streicher, T. (1991) Game semantics for linear logic. Proc. 6th Annual IEEE Symp. on Logic in Computer Science, pp. 43-49.
14. Leivant, D. and Marion, J.-Y. (1993) Lambda calculus characterisations of polytime. Fundamentae Informaticae, 19, 167-184.
15. Leivant, D. and Marion, J.-Y. (1997) Ramified Recurrence and Computational Complexity IV: Predicative functionals and Poly-space. Manuscript.
16. Martin-Löf, P. (1984) Intuitionistic Type Theory. Bibliopolis-Napoli.
17. Moerdijk, I. and MacLane, S. (1992) Sheaves in Geometry and Logic. A First Introduction to Topos Theory. Springer-Verlag.
18. Moggi, E. (1991) Notions of computation and monads. Information and Computation, 93, 55-92.
19. Otto, J. (1995) Complexity Doctrines. PhD thesis, McGill University.
20. Pratt, V. R. (1995) Chu spaces and their interpretation as concurrent objects. In: J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments: LNCS 1000, pp. 392-405. Springer-Verlag.