Paper Info
Title
Non-deterministic Computations in ELAN
Abstract
The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for experimenting their combination.The ELAN language is based on rewriting logic and evaluation of labelled conditional rewrite rules. ELAN has two originalities with respect to several other algebraic languages, namely to handle nondeterministic computations and to provide a user-defined strategy language for controlling rule application. We focus in this paper on these two related aspects and explain how non-determinism is used in ELAN programs and handled in the ELAN compiler.
Year
DOI
Venue
1998
10.1007/3-540-48483-3_12
WADT
Keywords
Field
DocType
related aspect,deduction system,prototyping constraint solvers,nondeterministic computation,elan program,elan system,elan compiler,algebraic language,non-deterministic computations,user-defined strategy language,elan language,rewriting logic,theorem prover
Theorem provers,Algebraic number,Programming language,Nondeterministic algorithm,Computer science,Algorithm,Constraint satisfaction problem,Theoretical computer science,Compiler,Rewriting,Logic programming,Computation
Conference
Volume
ISSN
ISBN
1589
0302-9743
3-540-66246-4
Citations 
PageRank 
References 
6
0.52
16
Authors
2
Name
Order
Citations
PageRank
Hélène Kirchner11655152.66
Pierre-etienne Moreau259840.40