Mathematical Structures in Computer Science · 1995 · 18 citations · 9 references
Natural SciencesComputer ScienceMathematicsAlgebraFormal MethodsSyntaxCategory TheoryModel TheoryType SystemsCategorical SemanticsClosed CategoriesCompletenessCompleteness ResultsHigher CategoriesModel CategoriesSlice CategoriesTyped Lambda Calculus
Lambek used categories with indeterminates to capture explicit variables in simply typed λ-calculus. He observed that such categories with indeterminates can be described as Kleisli categories for suitable comonads. They account for ‘functional completeness’ for Cartesian (closed) categories. Here we refine this analysis, by distinguishing ‘contextual’ and ‘functional’ completeness, and extend it to polymorphic λ-calculi. Since the latter are described as certain fibrations, we are lead to consider indeterminates, not only for ordinary categories, but also for fibred categories. Following a 2-categorical generalisation of Lambek's approach, such fibrations with indeterminates are presented as 'simple slices' in suitable 2-categories of fibrations; more precisely, as Kleisli objects. It allows us to establish contextual and functional completeness results for some polymorphic calculi.
9
Introduction to Higher Order Categorical Logic.
J. L. Bell, J. Lambek, Philip Scott · Journal of Symbolic Logic · 1989 · 1.1K citations
Humanities, Mathematics, Logic +11
The formal theory of monads II
Stephen Lack, Ross Street · Journal of Pure and Applied Algebra · 2002 · 521 citations
Introduction to higher order categorical logic
Gian‐Carlo Rota · Advances in Mathematics · 1988 · 401 citations
Ross Street · Journal of Pure and Applied Algebra · 1972 · 340 citations