David R. Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, Edinburgh University, Edinburgh, Scotland, December 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....mechanisms that, when combined, yield a flexible, expressive, and implementable type system for modules. Specifically, the following mechanisms are crucial. Singletons Propagation of type sharing is handled by singleton signatures, a variant of Aspinall s and Stone and Harper s singleton kinds [33, 32, 1]. Singletons provide a simple, orthogonal treatment of sharing that captures the full equational theory of types in a higher order module system with subtyping. No previous module system has provided both abstraction and the full equational theory supported by singletons, and consequently none ....

David R. Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, Edinburgh University, Edinburgh, Scotland, December 1997.

....mechanisms that, when combined, yield a flexible, expressive, and implementable type system for modules. Specifically, the following mechanisms are crucial. Singletons Propagation of type sharing is handled by singleton signatures, a variant of Aspinall s and Stone and Harper s singleton kinds [30, 29, 1]. Singletons provide a simple, orthogonal treatment of sharing that captures the full equational theory of types in a higher order module system with subtyping. No previous module system has provided both abstraction and the full equational theory supported by singletons, consequently none has ....

David R. Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, Edinburgh University, Edinburgh, Scotland, December 1997.

....mechanisms that, when combined, yield a flexible, expressive, and implementable type system for modules. Specifically, the following mechanisms are crucial. Singletons Propagation of type sharing is handled by singleton signatures, a variant of Aspinall s and Stone and Harper s singleton kinds [32, 31, 1]. Singletons provide a simple, orthogonal treatment of sharing that captures the full equational theory of types in a higher order module system with subtyping. No previous module system has provided both abstraction and the full equational theory supported by singletons, consequently none has ....

David R. Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, Edinburgh University, Edinburgh, Scotland, December 1997.

....mechanisms that, when combined, yield a flexible, expressive, and implementable type system for modules. Specifically, the following mechanisms are crucial. Singletons Propagation of type sharing is handled by singleton signatures, a variant of Aspinall s and Stone and Harper s singleton kinds [33, 32, 1]. Singletons provide a simple, orthogonal treatment of sharing that captures the full equational theory of types in a higher order module system with subtyping. No previous module system has provided both abstraction and the full equational theory supported by singletons, and consequently none ....

David R. Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, Edinburgh University, Edinburgh, Scotland, December 1997.

....interpreted in environment g # # as a subset (its total realizers ) of # A ,where# is the type underlying t.The types are implicit in the interpretation. An alternative would be to make them explicit by giving an interpretation over well structuredness judgements. This is the approach taken in [Asp97] for example. # # #] R [ # ,x : #, # # # x] ##, a, # # # = a # a # R(#) a [ # # t 1 ] m 1 [ # # t n ] m n [ # # k(t 1 , t n ) #) k A (a 1 , a n ) a i # m i (#) # ##] #) 1 A [ # # t] m [ # # t # ] m # [ # ##t, t ....

....abstractions #X0:SIG0.exp[X0] then the coding rule of [San91] can be derived. The rule becomes #X : SIG. SIG # # #X : SIG.r when SIG # r # SIG # , that is, X : SIG # r : SIG # This follows since it is admissible that if r : # then # # r. 5.4. 2 Aspinall s # ASL In his thesis [Asp97] Aspinall presents a number of lambda calculus based calculi for program development. In the same spirit as our work, he constructs his main calculus from a number of subcalculi which he studies separately. The development methodology is based on the specification as type, elementhood as ....

David Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, Department of Computer Science, University of Edinburgh, 1997.

....architectural specifications. In ASL, parametrized specifications and # specifications (and the parametrized programs themselves) may be combined in a rather unconstrained way with no restriction to first order parametrization. Certain combinations that are not available in Casl seem useful (see [2] for examples) 8.2 Larch Larch [33,34] is a family of specification languages. Each Larch specification has components written in two languages: one designed for a specific programming language, the Larch interface language, and another common to all programming languages, the Larch shared ....

David Aspinall. Type Systems for Modular Programs and Specifications. Ph.D. thesis, Dept. of Computer Science, Univ. of Edinburgh, 1997.

....is solved by supplying an interpretation for encapsulated operations that exactly mirror their applicability. The theoretical foundations in universal algebra are formidable, see [8] But there has been substantial development for refinement in type theory as well, and other relevant work include [32, 28, 29, 27, 33, 1, 40, 39]. Section 2 outlines the type theory, the logic, and the standard PER semantics. In Sect. 3 specification refinement is introduced. Simulation relations and the proof method for proving observational refinements are introduced for first order. In Sect. 4 we present the alternative simulation ....

D. Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, University of Edinburgh, 1998.

....are shown to coincide. Important issues in algebraic specification refinement, such as the choice of input sorts [36] and the stability of constructors [39, 37, 10] are automatically resolved in the type theoretic setting. Other work linking algebraic specification and type theory includes [28, 34, 2, 41, 40]. Relevant work using System F and parametricity includes [29, 30] showing that the introduction of non terminating recursion also breaks down the tight correspondence between the existence of a simulation relation and observational equivalence. In [12] a proof method from algebraic specification ....

D. Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, University of Edinburgh, 1998.

....orthogonal dimensions along which the picture above can be extended to higherorder. First, we can generalize constructor implementations by allowing constructors to be higher order parameterised programs. If we extend the specification language to permit the specification of such programs (see [SST92,Asp97]) then we can develop them stepwise using the definitions of Sect. 3, with decomposition as in Sect. 4. Both Extended ML and Casl support the development of first order parameterised programs. In both cases the extension to higherorder parameterised programs has been considered but not yet fully ....

D. Aspinall. Type Systems for Modular Programs and Specifications. Ph.D. thesis, Dept. of Computer Science, Univ. of Edinburgh (1997).

....and our results complement those of [25] in that we consider also partial congruences. Other work linking algebraic specification and type theory includes [17] encoding constructor implementations in ECC, 26] expressing module algebra axioms in ECC, 23] encoding behavioural equalities in UTT, [2] treating the specification language ASL , 35] using Nuprl as a specification language, and [34] promoting dependent types in specification. Only [25] utilises relational parametricity. There are also non type theoretic higher order approaches using higher order universal algebra [20] and other ....

D. Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, University of Edinburgh, 1998.

....however, is different from the others since it privileges the aspects connected with the notion of type system and separate type checking. For instance, we do not need to assume monotonicity of the entailment relation, as it happens in the other mentioned approaches. The PhD thesis of Aspinall ([5], Chap.6 and 7) and the related paper [30] is without any doubt the most related work to this paper: the instantiation of ASL over the institution FPC allows Aspinall to define a powerful typechecking system for modules. However, such a system deals with type equalities, but not with more general ....

D. Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, Department of Computer Science, University of Edinburgh, August 1997.

.... [SST92] describes an extension of ASL called ASL that also 8 Specification Languages 5 supports specification of (possibly higher order) parameterised algebras, and distinguishes between these and parameterised specifications, with a formal system for proving satisfaction, cf. Asp97] The expressive power of the language makes it possible to model refinement of specifications (Chapter 7) as model class inclusion; more elaborate notions of implementation of ASL specifications are studied in [ST88b] A system for performing structured proofs of properties of specifications and ....

D. Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, University of Edinburgh, 1997.

....however, is different from the others since it privileges the aspects connected with the notion of type system and separate type checking. For instance, we do not need to assume monotonicity of the entailment relation, as it happens in the other mentioned approaches. The PhD thesis of Aspinall ([5], Chap.6 and 7) and the related paper [31] is without any doubt the most related work to this paper: the instantiation of ASL over the institution FPC allows Aspinall to define a powerful type checking system for modules. However, such a system deals with type equalities, but not with more ....

D. Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, Department of Computer Science, University of Edinburgh, August 1997.

No context found.

David Aspinall. Type Systems for Modular Programs and Specification. PhD thesis, Department of Computer Science, University of Edinburgh, 1997.

No context found.

David Aspinall. Type Systems for Modular Programs and Specification. PhD thesis, Department of Computer Science, University of Edinburgh, 1997.

No context found.

David Aspinall. Type Systems for Modular Programs and Specification. PhD thesis, Department of Computer Science, University of Edinburgh, 1997. URL http://www.dcs.ed.ac.uk/home/da/thesis.

No context found.

David R. Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, Edinburgh University, Edinburgh, Scotland, December 1997.

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