See this document in CiteSeerX!

Axiomatics for Data Refinement in Call By Value Programming Languages  (Make Corrections)  
John Power, Miki Tanaka



  Home/Search   Context   Related

 
View or download:
etl.go.jp/~furusawa/H...PowerTanaka.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  etl.go.jp/~furusawa/HTML/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We give a systematic category theoretic axiomatics for modelling data refinement in call by value programming languages. Our leading examples of call by value languages are extensions of the computational -calculus, such as FPC and languages for modelling nondeterminism, and extensions of the first order fragment of the computational -calculus, such as a CPS language. We give a category theoretic account of the basic setting, then show how to model contexts, then arbitrary type and term... (Update)

Active bibliography (related documents):   More   All
1.1:   Logical Relations and Data Abstraction - Power, Robinson   (Correct)
0.9:   A Compositional Generalisation of Logical Relations - Plotkin, Power, Sannella (1998)   (Correct)
0.7:   A Functorial Approach to Refinement - Yoshiki Kinoshita And   (Correct)

Similar documents based on text:   More   All
0.6:   Data Refinement and Algebraic Structure - Kinoshita, Power (1996)   (Correct)
0.4:   An Axiomatic Approach to Binary Logical Relations.. - Kinoshita.. (1997)   (Correct)
0.4:   A Categorical Axiomatics for Bisimulation - Cattani, Power, Winskel (1998)   (Correct)

BibTeX entry:   (Update)

@misc{ power-axiomatics,
  author = "John Power and Miki Tanaka",
  title = "Axiomatics for Data Refinement in Call By Value Programming Languages",
  url = "citeseer.ist.psu.edu/504598.html" }
Citations (may not include all citations):
562   Categories for the working mathematician (context) - Lane - 1971
291   Computational Lambda-calculus and Monads - Moggi - 1989
265   Proof of correctness of data representations (context) - Hoare - 1972
229   Foundations for programming languages (context) - Mitchell - 1996
156   Basic concepts of enriched category theory (context) - Kelly - 1982
35   Two-dimensional monad theory (context) - Blackwell, Kelly et al. - 1989
28   Adjunctions whose counits are coequalizers (context) - Kelly, Power - 1993
25   An Axiomatic Approach to Binary Logical Relations with Appli.. - Kinoshita, O'Hearn et al. - 1997
23   An axiomatisation of computationally adequate domain-theoret.. - Fiore, Plotkin - 1994
17   On Mac Lane's conditions for coherence of natural associativ.. (context) - Kelly - 1964
17   Premonoidal categories as categories with algebraic structur.. (context) - Power
13   Lax logical relations - Plotkin, Power et al.
13   Structures defined by finite limits in the enriched context (context) - Kelly - 1982
13   Data refinement in a categorical setting (context) - Hoare - 1987
13   Data refinement in a categorical setting (context) - Hoare, Jifeng - 1990
12   Correctness of data representations in ALGOL-like languages (context) - Tennent - 1994
11   abstraction and parametric polymorphism (context) - Ma, Reynolds - 1991
10   A representable approach to finite nondeterminism (context) - Anderson, Power - 1997
8   Formal Aspects of Computing (context) - Naumann - 1995
7   Electronic Notes in Theoretical Computer Science (context) - Power, Robinson - 1999
6   Structures in Computer Science (context) - Power, Robinson - 1997
5   An Axiomatics for Categories of Transition Systems as Coalge.. - Johnstone, Power et al. - 1998
5   Pure Appl (context) - Kinoshita, Power et al. - 1999
4   Categories with algebraic structure (context) - Power - 1998
4   A general completeness result in refinement - Kinoshita, Power
4   Data refinement for Call-by-value programming languages (context) - Kinoshita, Power - 1999
3   available as ECS-LFCS (context) - Hermida, Fibrations - 1993
2   Data refinement and algebraic structure - Kinoshita, Power - 2000
2   Flum and Rodriguez-Artalejo (context) - Honsell, Sannella - 1999
2   Electronic Notes in Theoretical Computer Science (context) - Thielecke - 1997
1   LNCS 1281 Abadi and Ito (context) - Power, Thielecke - 1997

Documents on the same site (http://www.etl.go.jp/~furusawa/HTML/):   More
Cumulatives for Safety - Kinoshita, Takahashi   (Correct)
Binary Relations for Abstraction and Refinement - Schmidt   (Correct)
A Functorial Approach to Refinement - Yoshiki Kinoshita And   (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