The following pages link to Functorial polymorphism (Q753948):
Displaying 50 items.
- Functorial semantics of first-order views (Q344796) (← links)
- Fixed-point operations on ccc's. I (Q672122) (← links)
- A characterization of the least-fixed-point operator by dinaturality (Q685386) (← links)
- Structural polymorphism (Q685400) (← links)
- Linear logic, coherence and dinaturality (Q685406) (← links)
- Softness of hypercoherences and MALL full completeness (Q705530) (← links)
- Functorial polymorphism (Q753948) (← links)
- An exactification of the monoid of primitive recursive functions (Q817674) (← links)
- A principled approach to programming with nested types in Haskell (Q848745) (← links)
- A categorical semantics for polarized MALL (Q866570) (← links)
- Core algebra revisited (Q879364) (← links)
- The Girard-Reynolds isomorphism (second edition) (Q879366) (← links)
- A modest model of records, inheritance, and bounded quantification (Q922718) (← links)
- On the algebraic structure of declarative programming languages (Q1035699) (← links)
- Dinatural numbers (Q1295522) (← links)
- Formal parametric polymorphism (Q1314344) (← links)
- Parametricity as isomorphism (Q1349670) (← links)
- Covariant types (Q1390953) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- G-dinaturality. (Q1400601) (← links)
- A sequent calculus for subtyping polymorphic types (Q1854408) (← links)
- The Girard-Reynolds isomorphism (Q1887154) (← links)
- Linear Läuchli semantics (Q1919529) (← links)
- Composing dinatural transformations: towards a calculus of substitution (Q2031559) (← links)
- The naturality of natural deduction. II: on atomic polymorphism and generalized propositional connectives (Q2118979) (← links)
- Parametricity for primitive nested types (Q2233419) (← links)
- On paradoxes in normal form (Q2288281) (← links)
- Selective strictness and parametricity in structural operational semantics, inequationally (Q2464947) (← links)
- The naturality of natural deduction (Q2631649) (← links)
- Game Semantics for Bounded Polymorphism (Q2811332) (← links)
- Functors are type refinement systems (Q2819783) (← links)
- Event domains, stable functions and proof-nets (Q2864146) (← links)
- (Q3483291) (← links)
- Bunched polymorphism (Q3545274) (← links)
- Least fixpoints of endofunctors of cartesian closed categories (Q4279245) (← links)
- Categorical data types in parametric polymorphism (Q4286531) (← links)
- Games and full completeness for multiplicative linear logic (Q4302352) (← links)
- Notions of computation as monoids (Q4625158) (← links)
- POLYMORPHISM AND THE OBSTINATE CIRCULARITY OF SECOND ORDER LOGIC: A VICTIMS’ TALE (Q4637941) (← links)
- Baby Modula-3 and a theory of objects (Q4764620) (← links)
- Proof Nets, Coends and the Yoneda Isomorphism (Q5018492) (← links)
- (Q5028445) (← links)
- Types as parameters (Q5044771) (← links)
- On Compositionality of Dinatural Transformations (Q5079758) (← links)
- Parametricity of extensionally collapsed term models of polymorphism and their categorical properties (Q5096235) (← links)
- An extension of system F with subtyping (Q5096247) (← links)
- On dinaturality, typability and \(\beta\eta\)-stable models (Q5111327) (← links)
- Introduction to Type Theory (Q5191087) (← links)
- Inversion, Iteration, and the Art of Dual Wielding (Q5237212) (← links)
- Relational Parametricity for Control Considered as a Computational Effect (Q5262944) (← links)
