An internal language for autonomous categories
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3959364 (Why is no real title available?)
- scientific article; zbMATH DE number 4010480 (Why is no real title available?)
- scientific article; zbMATH DE number 4071154 (Why is no real title available?)
- scientific article; zbMATH DE number 4103051 (Why is no real title available?)
- scientific article; zbMATH DE number 46995 (Why is no real title available?)
- scientific article; zbMATH DE number 177812 (Why is no real title available?)
- scientific article; zbMATH DE number 512773 (Why is no real title available?)
- A note on natural numbers objects in monoidal categories
- An internal language for autonomous categories
- Cartesian categories with natural numbers object
- Coherence in closed categories
- Computational interpretations of linear logic
- Languages for monoidal categories
- Linear logic
- Linear logic, coherence and dinaturality
- Monoidal categories with natural numbers object
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Why commutative diagrams coincide with equivalent proofs
Cited in
(18)- A note on natural numbers objects in monoidal categories
- scientific article; zbMATH DE number 860038 (Why is no real title available?)
- Natural number objects in Dialectica categories
- Relating categorical semantics for intuitionistic linear logic
- The power of closed reduction strategies
- An internal language for autonomous categories
- The syntactic side of autonomous categories enriched over generalised metric spaces
- Gödel's system T revisited
- Logical systems. I: Internal calculi.
- Partial recursive functions and finality
- The logic of message-passing
- GS\(\cdot \Lambda \) theories: a syntax for higher-order graphs
- Strong typed Böhm theorem and functional completeness on the linear lambda calculus
- Internal diagrams and archetypal reasoning in category theory
- Lilac: a functional programming language based on linear logic
- Aspects of categorical recursion theory
- Covert movement in logical grammar
- Linearity and iterator types for Gödel's system \(\mathcal T\)
This page was built for publication: An internal language for autonomous categories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1320337)