David Aspinall Department of Computer Science, University of Edinburgh, U.K....  Home/Search
Context
Related
| homepages.inf.ed.ac.uk/d...TSASL+.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: homepages.inf.ed.ac.uk/da/pape... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ASL+ is a formalism for specification and programming in-the-large, based on an arbitrary institution. It has rules for proving the satisfaction and refinement of specifications, which can be seen as a type theory with subtyping, including contravariant refinement for \Pi-abstracted specifications and a notion of stratified equality for higher-order objects. We describe the syntax of the language and a partial equivalence relation semantics. This style of semantics is familiar from... (Update)
Active bibliography (related documents): More All
1.8: Types, Subtypes, and ASL+ - Aspinall (1995) (Correct)
0.2: Subtyping with Power Types - Aspinall (2000) (Correct)
0.2: Subtyping Dependent Types - David Aspinall Lfcs (1996) (Correct)
Similar documents based on text: More All
0.2: Subtyping with Singleton Types - David Aspinall (1995) (Correct)
0.2: Another Type System for in-Place Update - David Aspinall And (2002) (Correct)
0.1: Cv - Compagnoni (2000) (Correct)
BibTeX entry: (Update)
@misc{ department-types,
author = "David Aspinall Department",
title = "Types, Subtypes, and ASL+",
url = "citeseer.ist.psu.edu/642892.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1990
234 Institutions: abstract model theory for specification and pr.. (context) - Goguen, Burstall - 1992
198 Toward formal development of programs from algebraic specifi.. - Sannella, Soko et al. - 1992
83 Bounded quantification is undecidable - Pierce - 1994
79 Simple consequence relations - Avron - 1991
67 Specifications in an arbitrary institution (context) - Sannella, Tarlecki - 1988
51 A semantic basis for Quest - Cardelli, Longo - 1991
35 minimum typing and type-checking in F (context) - Curien, Ghelli et al. - 1992
32 Subtyping with singleton types - Aspinall - 1995
15 Inheritance as implicit coercion - Breazu-Tannen, Coquand et al. - 1991
8 Structural subtyping and the notion of power type (context) - Cardelli - 1988
5 Parametricity in algebraic specifications: A case study - Soko - 1989
2 Higher order module parameterization (context) - Drossopoulou, Paterson - 1993
2 Structuring specifications inthe -large and in-the-small: Hi.. (context) - Krieg-Bruckner, Sannella - 1991
2 Type systems for algebraic specification in-the-large (context) - Aspinall - 1996
1 A calculus of parameterization for algebraic specifications (context) - Cengarle, Wirsing - 1994
1 Verification in ASL and related Specification Languages (context) - Farr'es-Cassals - 1992
Documents on the same site (http://homepages.inf.ed.ac.uk/da/papers/): More
Subtyping with Power Types - Aspinall (2000) (Correct)
Subtyping with Power Types - David Aspinall Http (2000) (Correct)
Heap Bounded Assembly Language - Aspinall, Compagnoni (2003) (Correct)
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