HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Editorial : Implicit Computational Complexity (ICC)

Jean-Yves Marion 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : This special issue is devoted to Implicit Computational Complexity (ICC), following the successful ICC workshop that took place in 2000 at Santa Barbara, CA, in affiliation with the 15th IEEE Symposium on Logic in Computer Science.
Mots-clés : logic complexity logique complexité
Document type :
Journal articles
Complete list of metadata
https://hal.inria.fr/inria-00100101
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 10:14:09 AM
Last modification on : Friday, February 4, 2022 - 3:30:14 AM

Identifiers

  • HAL Id : inria-00100101, version 1

Collections

INRIA | CNRS | LORIA | UNIV-LORRAINE | INRIA2

Citation

Jean-Yves Marion. Editorial : Implicit Computational Complexity (ICC). Theoretical Computer Science, Elsevier, 2004, 318 (1-2), pp.1. ⟨inria-00100101⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

157

 

Contact                    Legal Notice                    Personal Data