Parameterizations and Fixed-Point Operators on Control Categories
The λµ-calculus features both variables and names, together with their binding mechanisms. This means that constructions on open terms are necessarily parameterized in two different ways for both variables and names. Semantically, such a construction must be modeled by a bi-parameterized family of operators. In this paper, we study these bi-parameterized operators on Selinger’s categorical models of the λµ-calculus called control categories. The overall development is analogous to that of Lambek’s functional completeness of cartesian closed categories via polynomial categories. As a particular and important case, we study parameterizations of uniform fixed-point operators on control categories, and show bijective correspondences between parameterized fixed-point operators and non-parameterized ones under uniformity conditions.
KeywordsBijective Correspondence Internal Language Functional Completeness Control Category Parameterized Construct
Unable to display preview. Download preview PDF.
- 1.S. Bloom and Z. Ésik. Iteration Theories. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1993.Google Scholar
- 3.M. Hasegawa. Models of Sharing Graphs: A Categorical Semantics of let and letrec. PhD thesis, University of Edinburgh, 1997.Google Scholar
- 8.J. Lambek and P.J. Scott. Introduction to Higher-Order Categorical Logic. Cambridge Studies in Advanced Mathematics, Cambridge University Press, 1986.Google Scholar
- 12.A. Simpson and G. Plotkin. Complete axioms for categorical fixed-point operators. In Proceedings of 15th Annual Symposium on Logic in Computer Science, pages 30–41, 2000.Google Scholar