## Axioms for Recursion in Call-by-Value (2001)

### Cached

### Download Links

- [www.kurims.kyoto-u.ac.jp]
- [www.kurims.kyoto-u.ac.jp]
- DBLP

### Other Repositories/Bibliography

Venue: | HIGHER-ORDER AND SYMBOLIC COMPUT |

Citations: | 11 - 5 self |

### BibTeX

@INPROCEEDINGS{Hasegawa01axiomsfor,

author = {Masahito Hasegawa and Yoshihiko Kakutani},

title = {Axioms for Recursion in Call-by-Value},

booktitle = {HIGHER-ORDER AND SYMBOLIC COMPUT},

year = {2001},

pages = {246--260},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

We propose an axiomatization of fixpoint operators in typed call-by-value programming languages, and give its justifications in two ways. First, it is shown to be sound and complete for the notion of uniform T-fixpoint operators of Simpson and Plotkin. Second, the axioms precisely account for Filinski's fixpoint operator derived from an iterator (infinite loop constructor) in the presence of firstclass continuations, provided that we define the uniformity principle on such an iterator via a notion of effect-freeness (centrality). We then explain how these two results are related in terms of the underlying categorical structures.