# A characterization of Alternating log time by first order functional programs

1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We a give an intrinsic characterization of the class of functions which are computable in $\NCUN$ that is by a uniform, logarithmic depth and polynomial size family circuit. Recall that the class of functions in \Alogtime, that is in logarithmic time on an Alternating Turing Machine, is $\NCUN$. Our characterization is in terms of first order functional programming languages. We define measure-tools called Sup-interpretations, which allow to give space and time bounds and allow also to capture a lot of program schemas. This study is part of a research on static analysis in order to predict program resources. It is related to the notion of Quasi-interpretations and belongs to the implicit computational complexity line of research.
Type de document :
Communication dans un congrès
13th International Conference on Logic for Programming Artificial Intelligence and Reasoning - LPAR-13, Nov 2006, Phnom Penh/Cambodia, Springer, 2006, Logic for Programming, Artificial Intelligence, and Reasoning
Domaine :

Littérature citée [32 références]

https://hal.inria.fr/inria-00110014
Contributeur : Romain Péchoux <>
Soumis le : jeudi 26 octobre 2006 - 12:10:28
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48
Document(s) archivé(s) le : mardi 6 avril 2010 - 21:02:54

### Identifiants

• HAL Id : inria-00110014, version 1

### Citation

Romain Péchoux, Jean-Yves Marion, Guillaume Bonfante. A characterization of Alternating log time by first order functional programs. 13th International Conference on Logic for Programming Artificial Intelligence and Reasoning - LPAR-13, Nov 2006, Phnom Penh/Cambodia, Springer, 2006, Logic for Programming, Artificial Intelligence, and Reasoning. 〈inria-00110014〉

### Métriques

Consultations de la notice

## 208

Téléchargements de fichiers