Ordered and continuous models of higher-order specifications

  • We investigate the existence of continuous and fixpoint models of higher-order specifications. Particular attention is paid to the question of extensionality. We use ordered specifications, a particular case of Horn specifications. The main tool for obtaining continuous models is the ideal completion. Unfortunately, it may destroy extensionality. This problem is inherent: we show that there is no completion method which is guaranteed to preserve extensionality. To restore it, generally a quotient has to be taken. It is shown that under certain conditions this preserves the existence of least fixpoints. Examples of the specification method include the essential concepts of Backus’s FP and Hoare’s CSP.

Download full text files

Export metadata


Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Author:Bernhard MöllerGND
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/20644
Parent Title (English):Lecture Notes in Computer Science
Year of first Publication:1994
Publishing Institution:Universität Augsburg
Release Date:2017/07/21
First Page:223
Last Page:255
Higher order algebra, logic, and term rewriting: first International Workshop, HOA '93, Amsterdam, The Netherlands, September 23 - 24, 1993; selected papers : Higher-order algebra, logic, and term rewriting
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme
Dewey Decimal Classification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Licence (German):Deutsches Urheberrecht