Stratified coherence spaces: A denotational semantics for light linear logic
From MaRDI portal
Publication:1827389
DOI10.1016/j.tcs.2003.10.015zbMath1051.03050OpenAlexW2159254191WikidataQ56092883 ScholiaQ56092883MaRDI QIDQ1827389
Publication date: 6 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.015
Related Items (12)
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus ⋮ Light affine lambda calculus and polynomial time strong normalization ⋮ Linear logic and elementary time ⋮ Polynomial time in untyped elementary linear logic ⋮ A semantic measure of the execution time in linear logic ⋮ Type inference for light affine logic via constraints on words ⋮ Light types for polynomial time computation in lambda calculus ⋮ A Fresh Look at the λ-Calculus ⋮ Realizability models for BLL-like languages ⋮ Linear logic by levels and bounded time complexity ⋮ An abstract approach to stratification in linear logic ⋮ Implicit computation complexity in higher-order programming languages
Cites Work
This page was built for publication: Stratified coherence spaces: A denotational semantics for light linear logic