Category Theory and Computer Science pp 140-157 | Cite as
A typed lambda calculus with categorical type constructors
Conference paper
First Online:
Abstract
A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categorical objects like products and coproducts as well as recursive types like natural numbers and lists. It also allows duals of recursive types, i.e. lazy types, like infinite lists. It has generalized iterators for recursive types and duals of iterators for lazy types. We will give reduction rules for this simply typed lambda calculus and show that they are strongly normalizing even though it has infinite things like infinite lists.
Keywords
Reduction Rule Type Constructor Unique Morphism Lambda Calculus Adjoint Functor
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- [1]Arbib, M. A. and Manes, E. G.: The Greatest Fixed Points Approach to Data Types. In proceedings of Third Workshop Meeting on Categorical and Algebraic Methods in Computer Science and System Theory, Dortmund, West Germany, 1980.Google Scholar
- [2]Curien, P-L.: Categorical Combinators, Sequential Algorithms and Functional Programming. Research Notes in Theoretical Computer Science, Pitman, 1986.Google Scholar
- [3]Gordon, M. J., Milner, A. J. and Wordsworth, C. P.: Edinburgh LCF. Lecture Notes in Computer Science, Volume 78, 1979.Google Scholar
- [4]Hagino, T.: Category Theoretic Approach to Data Types. Ph. D. thesis, University of Edinburgh, 1987.Google Scholar
- [5]Harper, R., MacQueen, D. and Milner, R.: Standard ML. LFCS Report Series, ECS-LFSC-86-2. Department of Computer Science, University of Edinburgh, 1986.Google Scholar
- [6]Lambek, J. and Scott, P. J.: Introduction on Higher-Order Categorical Logic. Cambridge Studies in Advanced Mathematics, Volume 7, 1986.Google Scholar
- [7]Lehmann, D. and Smyth, M.: Algebraic Specification of Data Types — A Synthetic Approach —. Mathematical System Theory, Volume 14, pp. 97–139, 1981.Google Scholar
- [8]Mendler N. P.: First-and Second-Order Lambda Calculi with Recursive Types. Technical Report TR 86-764, Department of Computer Science, Cornell University, 1986.Google Scholar
- [9]Mendler N. P.: Recursive Types and Type Constraints in Second-Order Lambda Calculus. 1986.Google Scholar
- [10]Smyth, M. B. and Plotkin, G. D.: The Category-Theoretic Solution of Recursive Domain Equations. SIAM Journal of Computing, Volume 11, 1982.Google Scholar
- [11]Stenlund, S.: Combinators, λ-Terms and Proof Theory. D. Reidel, Dordrecht, 1972.Google Scholar
- [12]Tait, W.: Intentional Interpretation of Functionals of Finite Type I. Journal of Symbolic Logic, 32, pp. 198–212, 1967.Google Scholar
- [13]Troelstra, A. S.: Mathematical Investigation of Intuitionistic Arithmetic and Analysis. Lecture Notes in Mathematics, Volume 344, Springer-Verlag, 1973.Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1987