| M. Carlsson, J. Wid`en, J. Andersson, S. Andersson, K. Boortz, H. Nilsson, and T. Sjoland. SICStus Prolog User's Manual. SICS, Box 1263, 164 28 Kista, Sweden, 1991. |
.... 2 The Approach The ingredients of our semantics are (cf. Figure 1) BNF style rules to define the abstract syntax, reduction rules ( Gamma ) for the operational and For example: freeze, suspension, residuation (negated constraints also introduce an implicit form of coroutining) cf. [5, 10, 11, 4, 1]) congruence laws ( j ) for the declarative aspects. The execution of a program is seen as a sequence of state transitions. The states are modeled by formulae ( continuations ) which are represented as trees as usual. A computation step is modeled as the application of a rewrite rule to an ....
M. Carlsson, J. Wid`en, J. Andersson, S. Andersson, K. Boortz, H. Nilsson, and T. Sjoland. SICStus Prolog User's Manual. SICS, Box 1263, 164 28 Kista, Sweden, 1991.
.... contrast, imperative languages do have elegant formal semantics (both operational and denotational style) The work in [2] gives the operational semantics of freeze, but 1 For example: freeze, suspension, residuation (negated constraints also introduce an implicit form of coroutining) cf. [4, 9, 10, 3, 1] on a very low level; for example, it formalizes the stepwise search through the list of frozen goals. Such a low level approach seems suitable for specifying and comparing language implementations, but not so much for designing and specifying the languages themselves. On a very high level, ....
M. Carlsson, J. Wid`en, J. Andersson, S. Andersson, K. Boortz, H. Nilsson, and T. Sjoland. SICStus Prolog User's Manual. SICS, Box 1263, 164 28 Kista, Sweden, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC