#### Filter Results:

- Full text PDF available (79)

#### Publication Year

1980

2017

- This year (2)
- Last 5 years (11)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Egidio Astesiano, Michel Bidoit, +4 authors Andrzej Tarlecki
- Theor. Comput. Sci.
- 2002

Casl is an expressive language for the formal specification of functional requirements and modular design of software. It has been designed by CoFI, the international Common Framework Initiative for algebraic specification and development. It is based on a critical selection of features that have already been explored in various contexts, including… (More)

- Rod M. Burstall, David B. MacQueen, Donald Sannella
- LISP Conference
- 1980

An applicative language called HOPE is described and discussed. The underlying goal of the design and implementation effort was to produce a very simple programming language which encourages the construction of clear and manipulable programs. HOPE does not include an assignment statement; this is felt to be an important simplification. The user may freely… (More)

- Donald Sannella, Andrzej Tarlecki
- Inf. Comput.
- 1988

A formalism for constructing and using axiomatic specifications in an arbitrary logical system is presented. This builds on the framework provided by Goguen and Burstall’s work on the notion of an institution as a formalisation of the concept of a logical system for writing specifications. We show how to introduce free variables into the sentences of an… (More)

- Donald Sannella, Andrzej Tarlecki
- Monographs in Theoretical Computer Science. An…
- 2012

Die Online-Fachbuchhandlung beck-shop.de ist spezialisiert auf Fachbücher, insbesondere Recht, Steuern und Wirtschaft. Im Sortiment finden Sie alle Medien (Bücher, Zeitschriften, CDs, eBooks, etc.) aller Verlage. Ergänzt wird das Programm durch Services wie Neuerscheinungsdienst oder Zusammenstellungen von Büchern zu Sonderpreisen. Der Shop führt mehr als 8… (More)

The program development process is viewed as a sequence of implementation steps leading from a spe-ciication to a program. Based on an elementary notion of reenement, two notions of implementation are studied: constructor implementations which involve a construction \on top of" the implementing speciication, and abstractor implementations which additionally… (More)

- Donald Sannella, Andrzej Tarlecki
- Acta Informatica
- 1987

The program development process is viewed as a sequence of implementation steps leading from a specification to a program. Based on an elementary notion of refinement, two notions of implementation are studied: constructor implementations which involve a construction “on top of” the implementing specification, and abstractor implementations which… (More)

- David Aspinall, Stephen Gilmore, Martin Hofmann, Donald Sannella, Ian Stark
- CASSIS
- 2004

We present the Mobile Resource Guarantees framework: a system for ensuring that downloaded programs are free from run-time violations of resource bounds. Certificates are attached to code in the form of efficiently checkable proofs of resource bounds; in contrast to cryptographic certificates of code origin, these are independent of trust networks. A novel… (More)

- Gordon D. Plotkin, John Power, Donald Sannella, Robert D. Tennent
- ICALP
- 2000

Lax logical relations are a categorical generalisation of logical relations; though they preserve product types, they need not preserve exponential types. But, like logical relations, they are preserved by the meanings of all lambda-calculus terms. We show that lax logical relations coincide with the correspondences of Schoett, the algebraic relations of… (More)

- Donald Sannella, Andrzej Tarlecki
- J. Comput. Syst. Sci.
- 1985

The properties of a simple and natural notion of observational equivalence of algebras and the corresponding specification-building operation are studied. We begin with a defmition of observational equivalence which is adequate to handle reachable algebras only, and show how to extend it to cope with unreachable algebras and also how it may be generalised… (More)

- Martin Hofmann, Donald Sannella
- Theor. Comput. Sci.
- 1995

The behavioural semantics of specifications with higher-order logical formulae as axioms is analyzed. A characterization of behavioural abstraction via behavioural satisfaction of formulae in which the equality symbol is interpreted as indistinguishability, which is due to Reichel and was recently generalized to the case of first-order logic by Bidoit et… (More)