Compiling nondeterministic computations

Pierre-Etienne Moreau 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Implementing a compiler for a language with non-deterministic features is known to be a difficult task. This paper presents two new functions and fail that extend the C language to efficiently handle choice point management. Algorithms and implementation techniques are detailed. We illustrate their use by presenting the classical 8-queens problem. Then, we give compilation schemes for the language ELAN in order to illustrate the power and the easy use of setChoicePoint and fail to design new compilation schemes for non-deterministic computation.
Type de document :
Rapport
[Intern report] 98-R-005 || moreau98a, 1998, 16 p
Liste complète des métadonnées

https://hal.inria.fr/inria-00098559
Contributeur : Publications Loria <>
Soumis le : lundi 25 septembre 2006 - 17:03:26
Dernière modification le : jeudi 11 janvier 2018 - 06:19:58

Identifiants

  • HAL Id : inria-00098559, version 1

Collections

Citation

Pierre-Etienne Moreau. Compiling nondeterministic computations. [Intern report] 98-R-005 || moreau98a, 1998, 16 p. 〈inria-00098559〉

Partager

Métriques

Consultations de la notice

95