Sciweavers

1912 search results - page 152 / 383
» On the evaluation of argumentation formalisms
Sort
View
SAS
1994
Springer
15 years 10 months ago
Generating Transformers for Deforestation and Supercompilation
Abstract. Our aim is to study how the interpretive approach -- inserting an interpreter between a source program and a program specializer -- can be used to improve the transformat...
Robert Glück, Jesper Jørgensen
ICFEM
2000
Springer
15 years 10 months ago
Using Use Cases in Executable Z
Use Cases are a wide-spread informal method for specifying the requirements of a technical system in the early development phase. Z is a formal notation which aims to support, bes...
Wolfgang Grieskamp, Markus Lepper
LPAR
2000
Springer
15 years 10 months ago
Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System
Abstract. The ZETA system is a Z-based tool environment for developing formal specifications. It contains a component for executing the Z language based on the implementation techn...
Wolfgang Grieskamp, Markus Lepper
AFP
1995
Springer
128views Formal Methods» more  AFP 1995»
15 years 10 months ago
Monads for Functional Programming
Abstract. The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global st...
Philip Wadler
ZUM
2000
Springer
15 years 10 months ago
A Computation Model for Z Based on Concurrent Constraint Resolution
We present a computation model for Z, which is based on a reduction to a small calculus, called Z, and on concurrent constraint resolution techniques applied for computing in thi...
Wolfgang Grieskamp