Jo Erskine Hannay  Home/Search
Context Related
| dcs.ed.ac.uk/home/joh/Papers/csl.ps 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: dcs.ed.ac.uk/home/joh/public (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Essential concepts of algebraic specification refinement are translated into a type-theoretic setting involving System F and Reynolds' relational parametricity assertion as expressed in Plotkin and Abadi's logic for parametric polymorphism. At first order, the type-theoretic setting provides a canonical picture of algebraic specification refinement. At higher order, the type-theoretic setting allows future generalisation of the principles of algebraic specification refinement to higher... (Update)
Context of citations to this paper: More
.... the fact that logical relations traditionally used to describe refinement do not compose at higher order [17, 18, 21, 20, 32] In [12] an account of algebraic specification refinement [38, 37] is mapped to the first order type theoretic refinement notion, and the two...
...the existence of quotients and sub objects. Work related to this is [33, 42] The higher order generalisation of this is to be found in [13]. Section 2 outlines the type theory. In Sect. 3 refinement is introduced in a first order setting, and Sect. 4 generalises to higher...
Cited by: More
Semantic and Syntactic Approaches to Simulation Relations - Hannay, Katsumata, Sannella (2003) (Correct)
Specification Refinement with System F, The Higher-Order Case - Hannay (Correct)
Constructive Data Refinement in Typed Lambda Calculus - Honsell, Longley.. (2000) (Correct)
Similar documents (at the sentence level):
10.5%: A Higher-Order Simulation Relation for System F - Hannay (2000) (Correct)
Active bibliography (related documents): More All
1.2: Algebraic System Specification and Development.. - Cerioli, Gogolla, .. (1997) (Correct)
0.5: Specification Languages - Sannella, Wirsing (1999) (Correct)
0.3: Referential Opacity in Equational Reasoning - Hannay (1998) (Correct)
Similar documents based on text: More All
0.3: Representing Knowledge in the Statistical System Jasp - Kobayashi, Yamamoto, Fujiwara (2002) (Correct)
0.2: An Expressive, Scalable Type Theory for Certified Code - Crary, Vanderwaart (2001) (Correct)
0.2: Higher-Order Modules and the Phase Distinction - Harper, Mitchell, Moggi (1990) (Correct)
Related documents from co-citation: More All
5: Foundations for Programming Languages (context) - Mitchell - 1996
5: Essential concepts of algebraic specification and program development - Sannella, Tarlecki
5: Toward formal development of programs from algebraic specifications: Implementat.. - Sannella, Tarlecki - 1988
BibTeX entry: (Update)
J.E. Hannay. Specification refinement with System F. In Proc. CSL'99, volume 1683 of LNCS, pages 530--545, 1999. http://citeseer.ist.psu.edu/hannay99specification.html More
@inproceedings{ hannay99specification,
author = "Jo Erskine Hannay",
title = "Specification Refinement with System F",
booktitle = "{CSL}",
pages = "530-545",
year = "1999",
url = "citeseer.ist.psu.edu/hannay99specification.html" }
Citations (may not include all citations):229 Foundations for Programming Languages (context) - Mitchell - 1996
198 Toward formal development of programs from algebraic specifi.. - Sannella, Soko et al. - 1992
198 Toward formal development of programs from algebraic specifi.. - Sannella, Tarlecki - 1988
147 abstraction and parametric polymorphism (context) - Reynolds - 1983
63 Theoretical Computer Science (context) - Bainbridge, Freyd et al. - 1990
58 A logic for parametric polymorphism - Plotkin, Abadi - 1993
57 On observational equivalence and algebraic specification (context) - Sannella, Tarlecki - 1987
53 Automatic synthesis of typed -programs on term algebras (context) - Bohm, Beraducci - 1985
51 A kernel language for algebraic specification and implementa.. (context) - Sannella, Wirsing - 1983
46 Data Abstraction and the Correctness of Modular Programming (context) - Schoett - 1986
43 Science of Computer Programming (context) - Bidoit, Hennicker et al. - 1995
41 Essential concepts of algebraic specification and program de.. - Sannella, Tarlecki - 1997
37 Formal parametric polymorphism - Abadi, Cardelli et al. - 1993
29 On behavioural abstraction and behavioural satisfaction in h.. - Hofmann, Sannella - 1996
28 the equivalence of data representations (context) - Mitchell - 1991
27 The definition of Extended ML: a gentle introduction - Kahrs, Sannella et al. - 1997
27 Universal algebra in higher types (context) - Meinke - 1992
26 Behavioural theories and the proof of behavioural properties - Bidoit, Hennicker - 1996
25 An axiomatic approach to binary logical relations with appli.. - Kinoshita, O'Hearn et al. - 1997
20 IEEE Transactions on Software Engineering (context) - Goguen - 1984
18 Algebraic System Specification and Development: A Survey and.. (context) - Bidoit, Kreowski et al. - 1991
18 Outline of a proof theory of parametricity - Mairson - 1991
17 Type Systems for Modular Programs and Specifications (context) - Aspinall - 1998
15 Pre-logical relations - Honsell, Sannella - 1999
15 A simple model for quotient types - Hofmann - 1995
14 Proof systems for structured specifications with observabili.. (context) - Bidoit, Hennicker et al. - 1997
13 Structured specifications: Syntax (context) - Wirsing - 1993
12 Algebraic specification languages: An overview (context) - Wirsing - 1994
11 abstraction and parametric polymorphism (context) - Ma, Reynolds
9 A logic for abstract data types as existential types (context) - Poll, Zwanenburg - 1999
7 Structured specifications with behavioural operators: Semant.. (context) - Hennicker - 1997
5 Verifying properties of module construction in type theory - Reus, Streicher - 1993
4 Dependent types considered necessary for specification langu.. (context) - Streicher, Wirsing - 1990
4 Typing abstract data types (context) - Underwood - 1994
3 Behavioural specifications in type theory (context) - Mylonakis - 1995
3 Program specification and data type refinement in type theor.. (context) - Luo - 1993
1 and set-theoretic models (context) - Kirchner, Mosses et al. - 1998
Documents on the same site (http://www.dcs.ed.ac.uk/home/joh/public.html): More
Abstraction Barriers in Equational Proof - Hannay (1998) (Correct)
A Higher-Order Simulation Relation for System F - Hannay (2000) (Correct)
Specification Refinement with System F, The Higher-Order Case - Hannay (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