scientific article; zbMATH DE number 1424054

zbMath0942.03062MaRDI QIDQ4945245

Luca Roversi

Publication date: 23 March 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Light Linear LogicLight Affine LogicP-Time completenessprogramming with feasible functions

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (11)

Light affine lambda calculus and polynomial time strong normalization ⋮ Light linear logics with controlled weakening: expressibility, confluent strong normalization ⋮ A type-assignment of linear erasure and duplication ⋮ Encodings of Turing machines in linear logic ⋮ Type inference for light affine logic via constraints on words ⋮ A semantic proof of polytime soundness of light affine logic ⋮ Light Linear Logic with Controlled Weakening ⋮ Soft linear logic and polynomial time ⋮ On an interpretation of safe recursion in light affine logic ⋮ Linear logic by levels and bounded time complexity ⋮ Implicit computation complexity in higher-order programming languages

This page was built for publication: