scientific article; zbMATH DE number 176206

MaRDI QIDQ4035310zbMATH OpenFDO

Authors Jean-Yves Girard, Andre Scedrov, Philip Scott

Publication date 18 May 1993

zbMATH Keywords

structural rulestypingcomputable functionbounded exclamation markbounded linear logicbounded storageinteractive behaviour of algorithmspolynomial-time functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other nonclassical logic (03B60) Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20) Logic in computer science (03B70) Real polynomials: analytic properties, etc. (26C05)

Recommendations

• Bounded linear logic: A modular approach to polynomial-time computability
• Polynomial time in untyped elementary linear logic
• Linear logic by levels and bounded time complexity
• Realizability models for BLL-like languages
• Linear logic and polynomial time

Cited in

(10)

• Bounded linear logic, revisited
• An arithmetic for polynomial-time computation
• An analysis of the Core-ML language: Expressive power and type reconstruction
• Bounded linear logic: A modular approach to polynomial-time computability
• Realizability models for BLL-like languages
• Full intuitionistic linear logic
• Computation models and function algebras
• Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes
• Computing on structures
• Bounded Linear Logic, Revisited

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035310)