iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/3-540-48168-0_39
Data-Refinement for Call-By-Value Programming Languages | SpringerLink
Skip to main content
Springer Nature Link
Log in

Data-Refinement for Call-By-Value Programming Languages

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1683))

Included in the following conference series:

Abstract

We give a category theoretic framework for data-refinement in call-by-value programming languages. One approach to data refinement for the simply typed λ-calculus is given by generalising the notion of logical relation to one of lax logical relation, so that binary lax logical relations compose. So here, we generalise the notion of lax logical relation, defined in category theoretic terms, from the simply typed ?- calculus to the computational λ-calculus as a model of data refinement.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Fiore, M., Plotkin, G.D.: An axiomatisation of computationally adequate domain-theoretic models of FPC. Proc LICS 94. IEEE Press (1994) 92–102.

    Google Scholar 

  2. Gardiner, P.H.B., Morgan, C.:A single complete rule for data refinement. Formal Aspects of Computing 5 (1993) 367–382.

    Article  Google Scholar 

  3. Hermida, C.A.: Fibrations, Logical Predicates and Indeterminates. Ph.D. thesis. Edinburgh (1993) available as ECS-LFCS-93-277.

    Google Scholar 

  4. Hoare, C.A.R.: Proof of correctness of data representations. Acta Informatica 1 (1972) 271–281.

    Article  Google Scholar 

  5. Hoare, C.A.R.: Data refinement in a categorical setting. (1987) (draft).

    Google Scholar 

  6. Hoare, C.A.R., Jifeng, H.: Data refinement in a categorical setting. (1990) (draft).

    Google Scholar 

  7. Honsell, F., Sannella, D.T.: Pre-logical relations. Proc. CSL 99 (in this volume).

    Google Scholar 

  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.

    Google Scholar 

  9. Kelly, G.M.: Basic concepts of enriched category theory. Cambridge University Press (1982).

    Google Scholar 

  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.

    Google Scholar 

  11. Kinoshita, Y., Power, A.J.: Data refinement and algebraic structure. Acta Informatica (to appear).

    Google Scholar 

  12. Kinoshita, Y., Power, A.J., Takeyama, M.: Sketches. J. Pure Appl. Algebra (to appear).

    Google Scholar 

  13. Kinoshita, Y., Power, A.J., Watanabe, H.: A general completeness result in refinement (submitted).

    Google Scholar 

  14. Lambek, J., Scott, P.J.: Introduction to Higher-Order Categorical Logic, Cambridge Studies in Advanced Mathematics 7. CUP (1986).

    Google Scholar 

  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).

    Google Scholar 

  16. Mitchell, J.: Foundations for programming languages. Foundations of Computing Series. MIT Press (1996).

    Google Scholar 

  17. Moggi, E.: Computational Lambda-calculus and Monads. Proc LICS 89. IEEE Press (1989) 14–23.

    Google Scholar 

  18. Naumann, D.A.: Data refinement, call by value, and higher order programs. Formal Aspects of Computing 7 (1995) 752–762.

    Article  Google Scholar 

  19. Power, A.J.: Premonoidal categories as categories with algebraic structure. Theoretical Computer Science (to appear).

    Google Scholar 

  20. Plotkin, G.D., Power, A.J., Sannella, D.T.: A generalised notion of logical relations. (submitted).

    Google Scholar 

  21. Power, A.J., Robinson, E.P. Premonoidal categories and notions of computation. Math. Structures in Computer Science 7 (1997) 453–468.

    Article  MathSciNet  Google Scholar 

  22. Power, A.J., Thielecke, H.: Environments, Continuation Semantics and Indexed Categories. Proc TACS 97. LNCS 1281 Abadi and Ito (eds) (1997) 391–414

    Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrotechnical Laboratory, Tsukuba-shi, Ibaraki, Japan

    Yoshiki Kinoshita

  2. Laboratory for the Foundations of Computer Science, University of Edinburgh, King’s Buildings, Edinburgh EH9 3JZ, Scotland

    John Power

Authors
  1. Yoshiki Kinoshita
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Power
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematisches Institut, Universität Freiburg, Eckerstr. 1, D-79104, Freiburg, Germany

    Jörg Flum

  2. Dpto. de Sistemas Informáticos y Programación Edificio Fac. Matemáticas, Universidad Complutense de Madrid, Av. Complutense s/n, E-28040, Madrid, Spain

    Mario Rodriguez-Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kinoshita, Y., Power, J. (1999). Data-Refinement for Call-By-Value Programming Languages. In: Flum, J., Rodriguez-Artalejo, M. (eds) Computer Science Logic. CSL 1999. Lecture Notes in Computer Science, vol 1683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48168-0_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-48168-0_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66536-6

  • Online ISBN: 978-3-540-48168-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation