Treffer: Bounded linear logic : a modular approach to polynomial-time computability
Title:
Bounded linear logic : a modular approach to polynomial-time computability
Authors:
Source:
Theoretical computer science. 97(1):1-66
Publisher Information:
Amsterdam: Elsevier, 1992.
Publication Year:
1992
Physical Description:
print, 32 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Commutativité, Commutativity, Conmutatividad, Complexité calcul, Computing complexity, Complejidad cálculo, Informatique théorique, Computer theory, Informática teórica, Lambda calcul, Lambda calculus, Lambda cálculo, Logique intuitionniste, Intuitionistic logic, Lógica intuicionista, Méthode réduction, Reduction method, Método reducción, Spécification programme, Program specification, Especificación programa, Système informatique, Computer system, Sistema informático, Temps polynomial, Polynomial time, Tiempo polinomial
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
CNRS Univ. Paris 7, équipe logique, 75251 Paris, France
ISSN:
0304-3975
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4382683
Database:
PASCAL Archive
Weitere Informationen
Usual typed lambda-calculi yiled input/output specifications; in this paper the authors show how to extend this paradigm to complexity specifications. This is achieved by means of a restricted version of linear logic in which the use of exponential connectives is bounded in advance. This bounded linear logic naturally involves polynomials in its syntax and dynamics. It is then proved that any functional term of appropriate type actually encodes a polynomial-time algorithm and that conversely any polynomial-time function can be obtained in this way.