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

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.
Document type :
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Monday, September 25, 2006 - 5:03:26 PM
Last modification on : Friday, February 4, 2022 - 3:32:53 AM


  • HAL Id : inria-00098559, version 1



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



Record views