Results 1 
4 of
4
Prolog's Control Constructs in a Functional . . .
 INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
"... The purpose of this article is twofold. First, we show that Prolog's control constructs can be smoothly integrated into a functional language like Haskell. The resulting `language', termed embedded Prolog, incorporates many of the features prescribed by the Prolog ISO standard: control constructs ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
The purpose of this article is twofold. First, we show that Prolog's control constructs can be smoothly integrated into a functional language like Haskell. The resulting `language', termed embedded Prolog, incorporates many of the features prescribed by the Prolog ISO standard: control constructs including the cut, all solution collecting functions, and error handling facilities. Embedded Prolog lacks some concepts such as logical variables but it inherits all of Haskell's strengths, eg static polymorphic typing, higher order functions etc. Technically, the integration is achieved using monads and monad transformers. One of the main innovations is the de nition of a backtracking monad transformer, which allows us to combine backtracking with exception handling and interaction. Second, we work towards an axiomatization of the operations, through which the computational features are accessed. Equations are used to lay down the meaning of the various operations and their interrelations enabling the programmer to reason about programs in a simple calculational style. The axiomatization is applied to show that each nite computation has a simple canonical form.
Description and Simulation of Microprocessor Instruction Sets Using ASMs
, 2000
"... In this paper, we describe how cycleaccurate processor behavior may be eciently described using Abstract State Machines (ASMs). ..."
Abstract

Cited by 11 (8 self)
 Add to MetaCart
In this paper, we describe how cycleaccurate processor behavior may be eciently described using Abstract State Machines (ASMs).
Verification of a Prolog Compiler  First Steps with KIV
, 1996
"... This paper describes the rst steps of the formal verication of a Prolog compiler with the KIV system. We build upon the mathematical denitions given by Borger and Rosenzweig in [BR95]. There an operational semantics of Prolog is dened using the formalism of Evolving Algebras, and then transformed i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper describes the rst steps of the formal verication of a Prolog compiler with the KIV system. We build upon the mathematical denitions given by Borger and Rosenzweig in [BR95]. There an operational semantics of Prolog is dened using the formalism of Evolving Algebras, and then transformed in several systematic steps to the Warren Abstract Machine (WAM). To verify these transformation steps formally in KIV, a translation of deterministic Evolving Algebras to Dynamic Logic is dened, which may also be of general interest. With this translation, correctness of transformation steps becomes a problem of program equivalence in Dynamic Logic. We dene a proof technique for verifying such problems, which corresponds to the use of proof maps in Evolving Algebras. Although the transformation steps are small enough for a mathematical analysis, this is not sucient for a successful formal correctness proof. Such a proof requires to explicitly state a lot of facts, which were only impli...
Rigorous Methods for Requirements Capture and Software Architecture
"... State Machines in the sense of Gurevich [23]) the models are expressed by rstorder statements and transition rules. We will investigate the usefulness of the machine character of ASMs for early validation and simulation of requirements, when they are given by use cases. Indeed, use cases can be dir ..."
Abstract
 Add to MetaCart
State Machines in the sense of Gurevich [23]) the models are expressed by rstorder statements and transition rules. We will investigate the usefulness of the machine character of ASMs for early validation and simulation of requirements, when they are given by use cases. Indeed, use cases can be directly expressed by computation segments of the ground model. We also plan to relate the ground model concept to the conceptual software architecture level proposed in [24]. Paradigmatic Architectural Models. We intend to dene a collection of ground model templates which capture paradigmatic architectural composition principles and allow one to make dierent basic system views explicit, in particular in terms of static system properties, user interfaces, communication mechanisms and notions of time. We expect two concrete shortterm results of conceptual nature: characterizations and formalizations of the best known architectural styles in the logic Oikosadtl [19, 21], and the denitio...