## Abstract

Calculi with control operators have been studied as extensions of simple type theory. Real programming languages contain datatypes, so to really understand control operators, one should also include these in the calculus. As a first step in that direction, we introduce λμ<sup>T</sup>, a combination of Parigot's λμ-calculus and Gödel's T, to extend a calculus with control operators with a datatype of natural numbers with a primitive recursor. We consider the problem of confluence on raw terms, and that of strong normalization for the well-typed terms. Observing some problems with extending the proofs of Baba et al. and Parigot's original confluence proof, we provide new, and improved, proofs of confluence (by complete developments) and strong normalization (by reducibility and a postponement argument) for our system. We conclude with some remarks about extensions, choices, and prospects for an improved presentation.</p>

Original language | English |
---|---|

Pages (from-to) | 676-701 |

Number of pages | 26 |

Journal | Annals of Pure and Applied Logic |

Volume | 164 |

Issue number | 6 |

DOIs | |

Publication status | Published - 2013 |

## Keywords

- Strong normalization
- Lambda calculus with control
- Confluence

## Fingerprint

Dive into the research topics of 'The λμ^{T}-calculus'. Together they form a unique fingerprint.