D. T. Sannella and A. Tarlecki. Building specifications in an arbitrary institution. In Proc. of the Intl. Symp. on Semantics of Data Types, pages 337--356. Springer LNCS 173, 1984.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and exploited in the definition of the GSBL language [226] ASL [851] 941] had as its main aim to provide very powerful specification building operations, in such a way that the language could be used as a kernel to design other languages. Because of its aims its semantics is model oriented. In [843, 837] it was shown that operations similar to those in ASL can be provided in an institution independent framework. Extended ML [836] and the meta language for the semantics of Ada [25] are defined in terms of ASL. ASF [68] is based on a pure initial algebra approach. It provides export, import and ....

D. T. Sannella and A. Tarlecki. Building specifications in an arbitrary institution. In Proc. of the Intl. Symp. on Semantics of Data Types, pages 337--356. Springer LNCS 173, 1984.

.... (trivial) Uniquely from the hypothesis that f SP impl is a correct implementation of SP , both forgetful functors from Mod( f SP impl ) to Mod(SP ) and from Mod( f SP 0 ) to Mod(SP ) are [ST88] s constructors where the specification building operation is the usual translate operation taken from [ST84]. Consequently, both correct refinement and enrichment composition, and correct refinement composition are directly obtained from the [ST88] s vertical composition theorem. Thus, we gain an incremental method compatible with the object oriented approach, capital to obtain software in working ....

D. Sannella, and A. Tarlecki, : "Building specifications in an arbitrary institution ", Proc. Intl. Symposium on Semantics of Data Types, Sophia-Antipolis. Lect. Notes Comput. Sci. Vol. 173, pp. 337-356, 1984.

....software systems, it is indispensable that it permits two or more modules to have hidden state variables in common. This requires a model of specification modules which is more concrete than most models proposed for modular property oriented, algebraic specifications (such as the ones presented in [BHK90, SaT85, WiB89]) Appropriately concrete models (e.g. the model presented in [Ber86] and the presentation model from [Wir86] usually treat name clashes in a way which still inhibits modules to have hidden state variables in common. DA makes it possible for modules to have hidden state variables in common. This ....

Sannella, D. and Tarlecki, A.: Building specifications in an arbitrary institution. In: Semantics of Data Types, G. Kahn, D.B. MacQueen and G. Plotkin (eds.), pp. 337--356, LNCS 173, Springer Verlag, 1985.

....token, but the arc weight always equals one (2.5.2.3) This motivates that in general an actual net structure parameter for a net class can be considered as a pair of functions: Net : Sets F Gamma Struct G Gamma Sets. For high level net classes we use the notion of institutions (see [GB84, ST84]) which is well established in the area of abstract data types. Institutions are an abstract description of data type formalisms and generalize different formalisms, as algebraic specifications, predicate logic, functional programming languages, and so on. The basic idea is to assume axiomaticly ....

D. T. Sannella and A. Tarlecki, Building specifications in an arbitrary institution, Proc. Int. Symposium on Semantics of Data Types, LNCS 173, Springer, 1984, pp. 337--356.

....as programming logics in which one can describe and reason about program specification and program development. Program specifications have been studied quite extensively in computer science (for example, algebraic specification languages like Clear [BGog80] Act1 [EFH83] OBJ [FGJM85] and ASL [ST88] In type theory, a specification may be formulated as a type. In particular, Sigma types provide a nice mechanism for describing program specifications. For example, a specification of sorting programs for lists of natural numbers can be expressed as follows: Sorting = df Pil:List(N) ....

.... induction on derivations does not work as the (app) rule loses the information of variable occurrences (in A) To solve this problem, we notice that we only have to prove the following statement: if Gamma; y:Y; Gamma 0 M : A and y 62 FV (M) FV ( Gamma 0 ) then there exists A 0 A such that Gamma; Gamma 0 M : A 0 . for then, supposing Gamma; y:Y; Gamma 0 M : A and y 62 FV (M) FV (A) FV ( Gamma 0 ) we have by ( that there exists A 0 A such that Gamma; Gamma 0 M : A 0 . We only have to show Gamma; Gamma 0 A : K for some kind K in ....

[Article contains additional citation context not shown here]

D. Sannella and A. Tarlecki, Building Specifications in an Arbitrary Institution, Information and Computation 76(2/3).

....could be used together 122 to provide support for the different aspects of program development: algorithm design, refinement, implementation, and verification. I will look at systems that have provided similar or overlapping capabilities: Automath [8] CLEAR [11] Institutions [21] [41] , consequence relations in LF [24] ELF [37] Extended ML [42] a system of Deliverables [9] and Specware [49] Each of these formalizes a particular activity associated with program or theory development, with the Specware system being the closest in terms of its stated goals. 5.1 Automath The ....

....parameterized specifications from a specific presentation to satisfying structural environments (lattices, diagrams) and the move of the details of presentation instantiation (application) to the object level. 130 5. 3 Institutions The goal of Goguen and Burstall s work on Institutions ( 21] [41]) is to: 1. Support as many computer science features as possible independently of the underlying logical system. 2. Facilitate the transfer of results from one logical system to another. 3. Permit the combining of different logical systems naturally. To accomplish this, they formalize the role of ....

Sanella, D., and Tarlecki, A. Building specifications in an arbitrary institution. In Lecture Notes in Computer Science, vol. 173. Springer-Verlag, 1984, pp. 337--356.

No context found.

D. Sannella and A. Tarlecki. Building specifications in an arbitrary institution. In G. Kahn, D.B. MacQueen, and G. Plotkin, editors, Proceedings Symposium on Semantics of Data Types, pages 337--356. Springer Verlag, LNCS 173, 1985.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC