Advertisement

On the nature of TELLUS

A typed equational logic look over uniform specification
  • V. Manca
  • A. Salibra
  • G. Scollo
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 379)

Abstract

A Typed Equational Logic (TEL) has been recently proposed as an extension of (conditional) equational logic, that enables one to deal in a single, unified framework with diverse phenomena such as partiality, type assignment, polymorphism and dependent types. In this paper the pragmatic motivations for this logic are recalled, as they arise from specification of abstract data types. An overview of TEL is then presented, and its usage illustrated by simple examples where the aforementioned phenomena occur.

Keywords

Unify Algebra Atomic Formula Dependent Type Partial Algebra Type Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABN 80]
    H. Andreka, P. Burmeister and I. Nemeti, Quasivarieties of partial algebras — a unifying approach towards a two-valued model theory for partial algebras, Preprint Nr. 557, FB Mathematik und Informatik, TH Darmstadt, 1980.Google Scholar
  2. [B 88]
    H. Brinksma, On the Design of Extended LOTOS: A Specification Language for Open Distributed Systems, Thesis Doct. Phil., Univ. Twente, November 1988.Google Scholar
  3. [BK 86]
    J.A. Bergstra and J.W. Klop, Conditional rewrife rules: confluence and termination, J. Comput. Sys. Sci. 32, 3 (1986) 323–362.Google Scholar
  4. [EM 85]
    H. Ehrig, B. Mahr, Fundamentals of Algebraic Specification 1, Springer-Verlag, Berlin, 1985.Google Scholar
  5. [EVD 88]
    P.H.J. van Eijk, C.A. Vissers, M. Diaz (Eds.), The Formal Description Technique LOTOS, Results of the ESPRIT/SEDOS project, North-Holland, Amsterdam, 1988.Google Scholar
  6. [FGJM 85]
    K. Futatsugi, J.A. Goguen, J.-P. Jouannaud, and J. Meseguer, Principles of OBJ2, Proc. Principles of Programming Languages, ACM, 1985.Google Scholar
  7. [Ga 88]
    H. Ganzinger, Completion with hystory-dependent complexities for generated equations, in: D. Sannella, A. Tarlecki (Eds.), Recent Trends in Data Type Specification, Springer-Verlag LNCS 332 (1988) 73–91.Google Scholar
  8. [Ge 88]
    M. Gerritsen, Type Assignment Functions, Thesis Doct. Phil., Univ. Twente, June 1988.Google Scholar
  9. [G 78]
    J.A. Goguen, Order Sorted Algebra, Semantics and Theory of Computation Report 14, UCLA Computer Science Dept., 1978.Google Scholar
  10. [GTW 78]
    J.A. Goguen, J.W. Thatcher, E.G. Wagner, An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types, in: R. Yeh (Ed.), Current Trends in Programming Methodology IV, Prentice-Hall (1978) 80–149.Google Scholar
  11. [ISO 88]
    ISO — Information processing system — Open systems interconnection — LOTOS — A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour, DIS 8807 (Final Text), 1988.Google Scholar
  12. [M 88]
    P.D. Mosses, Unified Algebras and Modules, DAIMI PB-266, Univ. Aarhus, Computer Science Dept., October 1988; to appear in Proc. ACM POPL '89.Google Scholar
  13. [M 89]
    P.D. Mosses, Unified Algebras and Institutions, DAIMI IR-83, Univ. Aarhus, Computer Science Dept., February 1989; to appear in Proc. LICS '89.Google Scholar
  14. [MS 88]
    V. Manca and A. Salibra, On the power of equational logic: applications and extensions, Univ. Pisa, Dip. Informatica, TR-19/88; presented at Int.1 Conf. on Algebraic Logic, Budapest, August 8–14, 1988.Google Scholar
  15. [MSS 88]
    V. Manca, A. Salibra and G. Scollo, On the nature of TELLUS, Univ. Twente, Memorandum INF-88-57, December 1988.Google Scholar
  16. [MSS 89a]
    V. Manca, A. Salibra and G. Scollo, DELTA: a Deduction system integrating Equational Logic and Type Assignment, AMAST '89, Int.1 Conf. on Algebraic Methodology And Software Technology, Iowa City, Iowa, USA, May 22–24, 1989.Google Scholar
  17. [MSS 89b]
    V. Manca, A. Salibra and G. Scollo, Equational Type Logic, Univ. Pisa & Univ. Twente, Draft (in preparation).Google Scholar
  18. [O 77]
    M.J. O'Donnell, Computing in Systems Described by Equations, Springer-Verlag LNCS 58, 1977.Google Scholar
  19. [P 88]
    A. Poigné, Partial Algebras, Subsorting and Dependent Types: Prerequisites of Error Handling in Algebraic Specification, in: D. Sannella, A. Tarlecki (Eds.), Recent Trends in Data Type Specification, Springer-Verlag LNCS 332 (1988) 208–234.Google Scholar
  20. [R 87]
    H. Reichel, Initial Computability, Algebraic Specifications, and Partial Algebras, Oxford University Press, 1987.Google Scholar
  21. [R 88]
    M. Rycko, Partial Partial Evaluators: What They Can Do, Metasoft Project, Polish Academy of Sciences, Institute of Computer Science, Warsaw, Poland, October 1988, submitted for publication.Google Scholar
  22. [S 86]
    G. Scollo, Some facilities for concise data type definitions in LOTOS, ESPRIT/SEDOS/C1/WP/13/T, Univ. of Twente, March 1986, also in: Potential Enhancements to LOTOS, ISO/TC 97/SC 21 N 2015.Google Scholar
  23. [S 88]
    G. Smolka, Type Logic, 6th ADT Workshop, Berlin, FRG, Aug.29–Sept.2, 1988 (Abstract).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • V. Manca
    • 1
  • A. Salibra
    • 1
  • G. Scollo
    • 2
  1. 1.University of Pisa — Dip. InformaticaPisaItaly
  2. 2.Dept. InformaticaUniversity of TwenteEnschedeNetherlands

Personalised recommendations