Results 1  10
of
10
A Modular Module System
 Journal of Functional Programming
, 2000
"... A simple implementation of an SMLlike module system is presented as a module parameterized by a base language and its typechecker. This implementation is useful both as a detailed tutorial on the HarperLillibridgeLeroy module system and its implementation, and as a constructive demonstration of ..."
Abstract

Cited by 79 (0 self)
 Add to MetaCart
A simple implementation of an SMLlike module system is presented as a module parameterized by a base language and its typechecker. This implementation is useful both as a detailed tutorial on the HarperLillibridgeLeroy module system and its implementation, and as a constructive demonstration of the applicability of that module system to a wide range of programming languages.
Building Equational Proving Tools by Reflection in Rewriting Logic
 In Cafe: An IndustrialStrength Algebraic Formal Method
, 1998
"... This paper explains the design and use of two equational proving tools, namely an inductive theorem prover  to prove theorems about equational specifications with an initial algebra semantics  and a ChurchRosser checkerto check whether such specifications satisfy the ChurchRosser property. ..."
Abstract

Cited by 38 (19 self)
 Add to MetaCart
This paper explains the design and use of two equational proving tools, namely an inductive theorem prover  to prove theorems about equational specifications with an initial algebra semantics  and a ChurchRosser checkerto check whether such specifications satisfy the ChurchRosser property. These tools can be used to prove properties of ordersorted equational specifications in Cafe [11] and of membership equational logic specifications in Maude [7, 6]. The tools have been written entirely in Maude and are in fact executable specifications in rewriting logic of the formal inference systems that they implement.
HasCASL: Towards Integrated Specification and Development of Functional Programs
, 2002
"... The development of programs in modern functional languages such as Haskell calls for a widespectrum specification formalism that supports the type system of such languages, in particular higher order types, type constructors, and parametric polymorphism, and contains a functional language as an exe ..."
Abstract

Cited by 25 (11 self)
 Add to MetaCart
The development of programs in modern functional languages such as Haskell calls for a widespectrum specification formalism that supports the type system of such languages, in particular higher order types, type constructors, and parametric polymorphism, and contains a functional language as an executable subset in order to facilitate rapid prototyping. We lay out the design of HasCasl, a higher order extension of the algebraic specification language Casl that is geared towards precisely this purpose. Its semantics is tuned to allow program development by specification refinement, while at the same time staying close to the settheoretic semantics of first order Casl. The number of primitive concepts in the logic has been kept as small as possible; we demonstrate how various extensions to the logic, in particular general recursion, can be formulated within the language itself.
The ABCs of Specification: AsmL, Behavior, and Components
, 2001
"... We show how to use AsmL, an executable specification... ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
We show how to use AsmL, an executable specification...
Experiences with Query Translation: Object Queries meet DB2
, 1999
"... COKOKOLA is a twotiered framework for building efficient and correct query rewriters. KOLA is a combinatorbased (i.e., variablefree) query algebra and representation that permits the expression of basic query rewrites in terms of rewrite rules that can be verified with a theorem prover. COKO is ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
COKOKOLA is a twotiered framework for building efficient and correct query rewriters. KOLA is a combinatorbased (i.e., variablefree) query algebra and representation that permits the expression of basic query rewrites in terms of rewrite rules that can be verified with a theorem prover. COKO is a programming language for expressing complex query rewrites using sets of KOLA rewrite rules supplemented with a ( ring) algorithm that controls their application. This paper describes our experiences using COKOKOLA in an industrial setting. The goal of this work was to build a translating query rewriter for an objectoriented database built on top of the relational database DB2, that would translate object queries posed in a subset of OQL into equivalent SQL queries over DB2. To assess the difficulty of using COKOKOLA in a practical setting, we reect on the effort that was required to specify normalizations specific to translation, and the rewrites to do the "actual work" of making object quer...
Specifications intheLarge by Typed ASMs
"... An important problem of the representation of a big dynamic system as a number of interrelating typed ASMs and the subsequent combination of the specifications of individual ASMs into the speci cation of the whole system is investigated in the paper. The structure of such a system is formally define ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
An important problem of the representation of a big dynamic system as a number of interrelating typed ASMs and the subsequent combination of the specifications of individual ASMs into the speci cation of the whole system is investigated in the paper. The structure of such a system is formally defined and a notion of external signature of a typed ASM is introduced. Two main operations for combining existing specifications (and their implementing ASMs) are suggested: import of existing typed ASMs by a new one and union of several typed ASMs into a new one. The syntax and semantics of the operations are formally defined.
An Algebraic Specification of the SteamBoiler Control System
, 1996
"... We describe how to derive an algebraic specification of the SteamBoiler Control System starting from the informal requirements provided to the participants of the Dagstuhl Meeting Methods for Semantics and Speci cation, organized jointly by JeanRaymond Abrial, Egon Börger and Hans Langmaack in Jun ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We describe how to derive an algebraic specification of the SteamBoiler Control System starting from the informal requirements provided to the participants of the Dagstuhl Meeting Methods for Semantics and Speci cation, organized jointly by JeanRaymond Abrial, Egon Börger and Hans Langmaack in June 1995. The aim of this formalization process is to analyze the informal requirements, to detect inconsistencies and loose ends, and to translate the requirements into a formal, algebraic, specification. During this process we have to provide interpretations for the unclear or missing parts. We explain how we can keep track of these additional interpretations by localizing very precisely in the formal specification where they lead to specific axioms. Hence we take care of the traceability issues. We also explain how the formal specification is obtained in a stepwise way by successive refinements. Emphasis is put on how to specify the detection of the steamboiler failures. Finally...
Formal Specification of Computer Algebra
, 2000
"... 3]. We describe the abstract (i.e having large classes of potential models) hierarchy of algebraic types in the Larch Shared Language. A unit of specication (a trait) is provided for each member of the hierarchy. Type and operator inheritance is designed to match that of the AXIOM system. Properties ..."
Abstract
 Add to MetaCart
3]. We describe the abstract (i.e having large classes of potential models) hierarchy of algebraic types in the Larch Shared Language. A unit of specication (a trait) is provided for each member of the hierarchy. Type and operator inheritance is designed to match that of the AXIOM system. Properties in the theory of each trait are proved using the Larch Prover [1, 2, 5]. Some of these proofs verify basic properties in the manner of the specication and verication of nonmathematical software. Other proofs are designed to demonstrate the mathematical correctness of the specications, and highlight areas in which the AXIOM system is not correct. An interface level of specication is provided, which takes semantics from the abstract specication. A primitive tool uses these specications to generate verication conditions, which may be investigated using the Larch Prover. Our aim is to provide better CAS by the formal specication and verication of types and procedures both at the des
The LAST Project
"... This paper describes the basic methodology of a Formal Method (LAST) that uses elements of Linear Algebra and Sets Theory for ISspecification. It also reports on a R&D project, presently under way, whose aim is to develop LAST and to make it fully operational. To this end, a CASEtool consisting of ..."
Abstract
 Add to MetaCart
This paper describes the basic methodology of a Formal Method (LAST) that uses elements of Linear Algebra and Sets Theory for ISspecification. It also reports on a R&D project, presently under way, whose aim is to develop LAST and to make it fully operational. To this end, a CASEtool consisting of a LAST userinterface, and a translator LASTUML will be developed and tested. The necessary description of LASTUML correspondence is also treated below. The ultimate goal of the project is to contribute to the improvement of IS development cycle.
Basic Inference Rules for Algebraic and Coalgebraic Specifications
, 2002
"... We give a survey of proof and computation rules, which, viewed from a longstanding experience with formal design methods, seem to be necessary and sucient for executing as well as verifying algebraic or coalgebraic data type speci cations. Based on manysorted logics, swinging types [17, 21] p ..."
Abstract
 Add to MetaCart
We give a survey of proof and computation rules, which, viewed from a longstanding experience with formal design methods, seem to be necessary and sucient for executing as well as verifying algebraic or coalgebraic data type speci cations. Based on manysorted logics, swinging types [17, 21] provide the uniform syntax and the semantics with respect to which the set of rules is sound and, to a certain extent, complete.