An axiomatic approach to binary logical relations with applications to data refinement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1281, Issue , 1997, Pages 191-212

  Kinoshita, Yoshiki ^a   O’Hearnt, Peter W ^b   John Power, A ^c   Takeyama, Makoto ^d   Tennent, Robert D ^e  

^a ELECTROTECHNICAL LABORATORY   (Japan)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

^d CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^e QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER SOFTWARE; SEMANTICS;

AXIOMATIC APPROACH; DATA REFINEMENTS; DATA REPRESENTATIONS; LOGICAL RELATIONS; SEMANTIC CATEGORY;

ABSTRACT DATA TYPES;

EID: 84957679731     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0014552     Document Type: Conference Paper

References (24)

1. Michael Barr and Charles Wells. Toposes, Triples and Theories, volume 278 of Grundlagen der maihematischen Wissenschafìen. Springer-Verlag, 1985.
2. D. Gries, editor. Programming Methodology, A Collection of Articles by IFIP WG 2.3. Springer-Verlag, New York, 1978.
3. Claudio A, Hermida. Fibrations, Logical Predicates, and Indeterminates. PhD thesis, The University of Edinburgh, 1993. Published as CST-103-93, also as ECS-LFCS-93-277.
4. C.A.R. Hoare. Data refinement in a categorical setting. Unpublished manuscript, 1987.
5. C.A.R. Hoare and He Jifeng. Data refinement in a categorical setting. Oxford Computing Laboratory Technical Monograph PRG-9Û, 1990.
6. G.M. Kelly and A.J. Power. Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads. Journal of Pure and Applied Algebra, 89:163-179, 1993.
7. Y. Kinoshita and A.J. Power. Data refinement and algebraic structure. ETL Technical Report TR96-2, Electrotechnical Laboratory, January 1996.
8. Y. Kinoshita and A.J. Power. Lax naturality through enrichment. Journal of Pure and Applied Algebra, 112(1):53~72, 1996.
9. Yoshiki Kinoshita, A. John Power, and Makoto Takeyama. Sketches. Submitted, 1996.
10. QingMing Ma and J. C. Reynolds. Types, abstraction, and parametric polymorphism, part 2. In S. Brookes et al., editors, Mathematical Foundations of Programming Semantics, Proceedings of the 7th International Conference, volume 598 of Lecture Notes in Computer Science, pages 1-40. Springer-Verlag, Berlin, 1992, Pittsburgh, PA, March 1991.
11. J. C. Mitchell. Representation independence and data abstraction, pages 263-276.
12. J.C, Mitchell and A. Scedrov. Notes on sconing and relators. In E. Boerger et al., editors, Computer Science Logic: 6th Workshop, CSL '92: Selected Pape rs, volume 702 of Lecture Notes in Computer Science, pages 352-378, San Miniato, Italy, 1992. Springer-Verlag, Berlin.
13. P. W. O'Hearn and R. D. Tennent. Parametricity and local variables. J. ACM, 42(3):658-709, May 1995. Also in [14].
14. P.W. O'Hearn and R.D. Tennent, editors. Algol-like Languages, volume 2. Birkhauser, Boston, 1997.
15. A. M. Pitts. Relational properties of domains. Information and Computation, 127:66-90, 1996.
16. G. Plotkin and M. Abadi. A logic for parametric polymorphism. In M. Bezen and J. F. Groot.e, editors, Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science, pages 361-375, Utrecht, The Netherlands, March 1993. Springer-Verlag, Berlin.
17. G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977.
18. A. J. Power. Premonoidal categories as categories with algebraic structure. Submitted.
19. J. C. Reynolds. User-defined types and procedural data structures as complementary approaches to data, abstraction. In S. A. Schuman, editor, New Advances in Algorithmic Languages 1975, pages 157-168. Inst, de Reserche d'Informatique et d'Automatique, Rocquencourt, France, 1975. Reprinted in [2], pages 309-317.
20. J. C. Reynolds. Types, abstraction and parametric polymorphism. In R. E. A. Mason, editor, Information Processing 83, pages 513-523, North Holland, Amsterdam, 1983.
21. E, P. Robinson. Logical relations and data abstraction. Extended abstract.
22. E. P. Robinson and G. Rosolini. Reflexive graphs and parametric polymorphism. In Proceedings, 9th Annual IEEE Symposium on Logic in Computer Science, Paris, 1994. IEEE Computer Society Press, Los Alamitos, California.
23. D. S. Scott. A type-theoretical alternative to Cuch, IswiM, Owhy. Privately circulated memo, Oxford University, October 1969. Published in Theoretical Computer Science, 121(l/2):411-440, 1993.
24. H. Thielecke. Continuation passing style and self adjointness. Continuations Workshop, Paris, January, 1997.