A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1414, Issue , 1998, Pages 275-294

  Hofmann, Martin ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL MECHANICS; COMPUTER CIRCUITS; DIFFERENTIATION (CALCULUS); FUNCTIONAL ANALYSIS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; RECONFIGURABLE HARDWARE;

FUNCTION ALGEBRA; LAMBDA CALCULUS; LINEAR FUNCTIONS; MODAL FUNCTIONS; POLYNOMIAL-TIME; SAFE RECURSION; SIMPLY TYPED LAMBDA CALCULUS; THEORETIC MODEL;

CALCULATIONS;

EID: 84957704802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028020     Document Type: Conference Paper

References (20)

1. S. Bellantoni. Predicative recursion and computational complexity. PhD thesis, University of Toronto, 192. Technical Report 264/92.
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.
6. Vuokko-Helena Caseiro. Equations for Defining Poly-time Functions. PhD thesis, University of Oslo, 1997. Available by ftp from ftp.ifi.uio.no/pub/vuokko/Oadm.ps.
7. Iliano Cervesato and Frank Pfenning. A Linear Logical Framework. In Symposium on Logic in Computer Science (LICS’96), pages 264-275. IEEE, 1996.
8. Peter Clote. Computation models and function algebras, available electronically under http://thelonius.tcs.informatik.uni-muenchen.de/clote/Survey.ps.gz, 1996.
9. J. Despeyroux, F. Pfenning, and C. Schiirmann. Primitive Recursion for Higher-Order Abstract Syntax. Technical Report CMU-CS-96-172, Carnegie Melon University, 1996.
10. Martin Hofmann. An application of category-theoretic semantics to the characterisation of complexity classes using higher-order function algebras. To appear in Bulletin of Symbolic Logic, 1997.
11. Martin Hofmann. More results on modal/linear lambda calculus. Submitted. Available under www.mathematik.tu-dctrmstadt.de/~mh, 1998.
12. Yves Lafont and Thomas Streicher. Game semantics for linear logic. In Proc. 6th Annual IEEE Symp. on Logic in Computer Science, editor, Logic in Computer Science (LICS), pages 43-49, 1991.
13. Daniel Leivant and Jean-Yves Marion. Lambda calculus characterisations of polytime. Fundamentae Informaticae, 19:167-184, 1993.
14. Daniel Leivant and Jean-Yves Marion. Ramified Recurrence and Computational Complexity II: Substitution and Poly-space. In Jerzy Tiuryn and Leszek Pacholski, editors, Proc. CSL’94, Kazimierz, Poland, Springer LNCS, Vol. 933, pages 4486-500, 1995.
15. Daniel Leivant and Jean-Yves Marion. Ramified Recurrence and Computational Complexity IV: Predicative functionals and Poly-space. Manuscript, 1997.
16. Frank Pfenning and Rowan Davies. A modal analysis of staged computation. In Proc. POPL’96, Florida. IEEE, 1996.
17. Gordon Plotkin. Type theory and recursion. Invited talk at the 8th Annual IEEE Symposium on Logic in Computer Science, Montreal, Canada, 1993.
18. V.R. Pratt. Chu spaces and their interpretation as concurrent objects. In J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, volume 1000 of Springer LNCS, pages 392-405. Springer-Verlag, 1995.
19. David N. Turner, Philip Wadler, and Christian Mossin. Once upon a type. In 7’th International Conference on Functional Programming and Computer Architecture, San Diego, California, June 1995.
20. Philip Wadler. Is there a use for linear logic? In ACM Conference on Partial Evaluation and Semantics-Based Program Manipulation, New Haven, Connecticut, June 1991.