Kernel Andorra Prolog and its Computation Model
暂无分享,去创建一个
The logic programming language framework Kernel Andorra Prolog is defined by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive languages and nondeterministic transformational languages may be specified. The framework is based on constraints. The languages Prolog, GHC, Parlog, and Atomic Herbrand, are all executable in the Kernel Andorra Prolog computation model. There are instances of the framework in which all of these languages are embeddable.
[1] Dana S. Scott,et al. Concurrent constraint programming languages , 1989 .
[2] Rong Yang. Solving Simple Substitution Ciphers in Andorra-I , 1989, ICLP.
[3] Vijay A. Saraswat,et al. The concurrent logic programming language CP: Definition and operational semantics , 1987, POPL '87.
[4] Seif Haridi,et al. ANDORRA Prolog - An Integration of Prolog and Committed Choice Languages , 1988, FGCS.
[5] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.