Data refinement for call-by-value programming languages

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

Volumn 1683, Issue , 1999, Pages 562-576

  Kinoshita, Yoshiki ^a   Power, John ^b  

^a ELECTROTECHNICAL LABORATORY   (Japan)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY;

DATA REFINEMENTS; LAX LOGICAL RELATION; LOGICAL RELATIONS;

COMPUTER CIRCUITS;

EID: 84956860512     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_39     Document Type: Conference Paper

References (23)

1. Fiore, M., Plotkin, G.D.: An axiomatisation of computationally adequate domain-theoretic models of FPC. Proc LICS 94. IEEE Press (1994) 92-102.
2. Gardiner, P.H.B., Morgan, C.:A single complete rule for data refinement. Formal Aspects of Computing 5 (1993) 367-382.
3. Hermida, C.A.: Fibrations, Logical Predicates and Indeterminates. Ph.D. thesis. Edinburgh (1993) available as ECS-LFCS-93-277.
4. Hoare, C.A.R.: Proof of correctness of data representations. Acta Informatica 1 (1972) 271-281.
5. Hoare, C.A.R.: Data refinement in a categorical setting. (1987) (draft).
6. Hoare, C.A.R., Jifeng, H.: Data refinement in a categorical setting. (1990) (draft).
7. Honsell, F., Sannella, D.T.: Pre-logical relations. Proc. CSL 99 (in this volume).
8. Johnstone, P.T., Power, A.J., Tsujishita, T., Watanabe, H., Worrell, J.: An Axiomatics for Categories of Transition Systems as Coalgebras. Proc LICS 98. IEEE Press (1998) 207-213.
9. Kelly, G.M.: Basic concepts of enriched category theory. Cambridge University Press (1982).
10. Kinoshita, Y., O'Hearn, P., Power, A.J., Takeyama, M., Tennent, R.D.: An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement. Proc TACS 97. LNCS 1281. Abadi and Ito (eds.) Springer (1997) 191-212.
11. Kinoshita, Y., Power, A.J.: Data refinement and algebraic structure. Acta In-formatica (to appear).
12. Kinoshita, Y., Power, A.J., Takeyama, M.: Sketches. J. Pure Appl. Algebra (to appear).
13. Kinoshita, Y., Power, A.J., Watanabe, H.: A general completeness result in refinemen (submitted).
14. Lambek, J., Scott, P.J.: Introduction to Higher-Order Categorical Logic, Cambridge Studies in Advanced Mathematics 7. CUP (1986).
15. Ma, Q., Reynolds, J.C.: Types, abstraction and parametric polymorphism 2. Math. Found. of Prog. Lang. Sem. Lecture Notes in Computer Science. Springer (1991).
16. Mitchell, J.: Foundations for programming languages. Foundations of Computing Series. MIT Press (1996).
17. Moggi, E.: Computational Lambda-calculus and Monads. Proc LICS 89. IEEE Press (1989) 14-23.
18. Naumann, D.A.: Data refinement, call by value, and higher order programs. Formal Aspects of Computing 7 (1995) 752-762.
19. Power, A.J.: Premonoidal categories as categories with algebraic structure. Theoretical Computer Science (to appear).
20. Plotkin, G.D., Power, A.J., Sannella, D.T.: A generalised notion of logical relations. (submitted).
21. Power, A.J., Robinson, E.P. Premonoidal categories and notions of computation. Math. Structures in Computer Science 7 (1997) 453-468.
22. Power, A.J., Thielecke, H.: Environments, Continuation Semantics and Indexed Categories. Proc TACS 97. LNCS 1281 Abadi and Ito (eds) (1997) 391-414
23. Tennent, R.D.: Correctness of data representations in ALGOL-like languages. In: A Classical Mind, Essays in Honour of C.A.R. Hoare, A.W. Roscoe (ed.) Prentice-Hall (1994) 405-417.