Bounded linear logic: a modular approach to polynomial-time computability
Authors:
- Jean-Yves GirardJGJean-Yves Girard
- Andre ScedrovASAndre Scedrov
- Philip J. ScottPSPhilip J. Scott
- 1 April 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 97 (1) , 1-66
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Computational interpretations of linear logicTheoretical Computer Science, 1993
- Opérateurs de mise en mémoire et traduction de GödelArchive for Mathematical Logic, 1990
- The structure of multiplicativesArchive for Mathematical Logic, 1989
- Characterizations of the basic feasible functionals of finite type1989
- Linear logicTheoretical Computer Science, 1987
- Relational queries computable in polynomial timeInformation and Control, 1986
- Π12-logic, Part 1: DilatorsAnnals of Mathematical Logic, 1981