Hostname: page-component-76fb5796d-vvkck Total loading time: 0 Render date: 2024-04-25T17:40:00.955Z Has data issue: false hasContentIssue false
  • English
  • Français

Parametric algebraic specifications with Gentzen formulas – from quasi-freeness to free functor semantics†

Published online by Cambridge University Press:  04 March 2009

Michael Löwe  and
Uwe Wolter
Michael Löwe
Affiliation:
Technische Universität Berlin, FB Informatik, Sekr. FR 6-1, Franklinstr. 28/29 10587 Berlin, Germany
Uwe Wolter
Affiliation:
Technische Universität Berlin, FB Informatik, Sekr. FR 6-1, Franklinstr. 28/29 10587 Berlin, Germany
Get access Rights & Permissions [Opens in a new window]

Abstract

Inspired by the work of S. Kaplan on positive/negative conditional rewriting, we investigate initial semantics for algebraic specifications with Gentzen formulas. Since the standard initial approach is limited to conditional equations (i.e. positive Horn formulas), the notion of semi-initial and quasi-initial algebras is introduced, and it is shown that all specifications with (positive) Gentzen formulas admit quasi-initial models.

The whole approach is generalized to the parametric case where quasi-initiality generalizes to quasi-freeness. Since quasi-free objects need not be isomorphic, the persistency requirement is added to obtain a unique semantics for many interesting practical examples. Unique persistent quasi-free semantics can be described as a free construction if the homomorphisms of the parameter category are suitably restricted. Furthermore, it turns out that unique persistent quasi-free semantics applies especially to specifications where the Gentzen formulas can be interpreted as hierarchical positive/negative conditional equations. The data type constructor of finite function spaces is used as an example that does not admit a correct initial semantics, but does admit a correct unique persistent quasi-initial semantics. The example demonstrates that the concepts introduced in this paper might be of some importance in practical applications.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 5 , Issue 1 , March 1995 , pp. 69 - 111
Copyright
Copyright © Cambridge University Press 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Apt, K., Blair, H. and Walker, A. (1987) Towards a theory of declarative knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos.CrossRefGoogle Scholar
Broy, M., Dosch, W., Partsch, H., Pepper, P. and Wirsing, M. (1979) Existential quantifiers in abstract data types. In: Maurer, H. A. (ed.) Sixth International Colloquium on Automata, Languages, and Programming. Springer Lecture Notes on Computer Science 71 73–87.CrossRefGoogle Scholar
Ehrig, H., Claßen, I., Boehm, P., Fey, W., Korff, M. and Löwe, M. (1989) Algebraic concepts for software development in ACT ONE, ACT TWO, and LOTOS. In: GI Tagung Softwareentwicklung. Springer Informatik Fachberichte 212 201–224.CrossRefGoogle Scholar
Ehrich, H.-D., Gogolla, M. and Lippeck, U. W. (1989) Algebraische Spezifikation abstrakter Datentypen, B. G. Teubner, Stuttgart.CrossRefGoogle Scholar
Ehrig, H. and Mahr, B. (1985) Fundamentals of Algebraic Specifications 1, Monographs in Computer Science, Springer, Berlin.CrossRefGoogle Scholar
Ehrig, H. and Mahr, B. (1990) Fundamentals of Algebraic Specifications 2, Monographs in Computer Science, Springer, Berlin.CrossRefGoogle Scholar
Goguen, J. A. and Burstall, R. M. (1984) Some fundamental algebraic tools for the semantics of computation — Part 1: comma categories, colimits, signatures, and theories. Theoretical Computer Science 31 175–209.Google Scholar
Goguen, J. A. (1988) What is unification? A categorical view of substitution, equation, and solution. Technical Report CSLI-88–124, Center for the Study of Languages and Information.Google Scholar
Goguen, J. A., Thatcher, J. W.and Wagner, E. G. (1976) An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types. Research Report RC 6487, IBM T. J. Watson Research Center, Yorktown Heights. Also in: Yeh, R. (ed.) (1978) Current Trends in Programming IV: Data Structuring, Prentice Hall 80–149.Google Scholar
Guttag, J. V. (1975) The specification and application to programming of abstract data types, PhD thesis, University of Toronto.Google Scholar
Hofbauer, D. and Kutsche, R. (1989) Grundlagen des machinellen Beweisens, Vieweg, Braunschweig/Wiesbaden.CrossRefGoogle Scholar
Herrlich, H. and Strecker, G. (1973) Category Theory, Allyn and Bacon, Rockleigh, New Jersey.Google Scholar
Kaplan, S..(1988) Positive/negative conditional rewriting. In: Kaplan, S. and Jouannaud, J. P. (eds.) Conditional Term Rewriting Systems. Springer Lecture Notes in Computer Science 308 129–143.CrossRefGoogle Scholar
Mac Lane, S. (1971) Categories for the Working Mathematician, Springer, Berlin.CrossRefGoogle Scholar
Mal'cev, A. I. (1973) Algebraic Systems, Springer, Berlin. (Translated from the original 1970 edition.)Google Scholar
Meseguer, J. (1992) Conditional Rewriting Logic as a unified Model of Concurrency. Theoretical Computer Science 96 73–155.CrossRefGoogle Scholar
Mahr, B. and Makowski, J. A. (1982) Characterizing specification languages which admit initial semantics. Technical Report 232, Technion Haifa. Also in Theoretical Computer Science (1984) 31 49–59.CrossRefGoogle Scholar
Nipkow, T. (1986) Non-deterministic data types: models and implementations. Acta Informatica 22 629–661.CrossRefGoogle Scholar
Reichel, H. (1981) Behavioural equivalence - a unifying concept for initial and final specification methods. In Third Hungarian Computer Science Conference 27–39.Google Scholar
Reichel, H. (1987) Initial Computability, Algebraic Specifications, and Partial Algebras, Akademie-Verlag, Berlin.CrossRefGoogle Scholar
Ullman, J. D. (1988) Principles of Database and Knowledge-Base Systems, vol. 1, Computer Science Press.Google Scholar
Wechler, W. (1992) Universal algebra for computer scientists, EATCS Monographs on Theoretical Computer Science 25, Springer, Berlin, 1992.CrossRefGoogle Scholar
Wirsing, M. (1986) Structured algebraic apecification: a kernel language. Theoretical Computer Science 43 123–250.CrossRefGoogle Scholar
Wirsing, M. (1989) Algebraic Specification. Research Report MIP-8914, University of Passau. Updated version also in Handbook of Theor. Comp. Sci. B, Elsevier, Amsterdam, 1990.Google Scholar
Wolter, U. (1991) Deduction in partial equational Horn theories. Journal of Information Processing and Cybernetics (EIK) 27 (2) 85–128.Google Scholar
Zilles, S. N. (1974) Algebraic specification of data types. Technical Report, MIT, Project MAC Progress Report 11 28–52.Google Scholar