Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy
type: Dataset
contact point: Organization
  fn: CCSD
keyword: infoeu-reposemanticsconferenceobject
keyword: lambda-calculus
keyword: infoinfo-locomputer-science-cslogic-in-computer-science-cslo
keyword: conference-papers
keyword: polynomial-time-complexity
keyword: implicit-computational-complexity
keyword: linear-logic
keyword: acm-subject-classification-f32-semantics-of-programming-languages
landing page: Proceedings of 9th Asian Symposium on Programming Languages and Systems APLAS 2011
description: International audience
issued: 2026-05-13T07:03:14.582604
language: en
modified: 2026-05-13T07:03:14.582613

Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy
type: Distribution
access URL: https://hal.science/hal-00798307
format: HTML
issued: 2026-05-13T07:03:14.588776
modified: 2026-05-13T07:03:14.558730

test_moissonnage_selune
type: Agent