Functorial polymorphism
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4181330 (Why is no real title available?)
- scientific article; zbMATH DE number 3882404 (Why is no real title available?)
- scientific article; zbMATH DE number 4158597 (Why is no real title available?)
- scientific article; zbMATH DE number 3825806 (Why is no real title available?)
- scientific article; zbMATH DE number 3902022 (Why is no real title available?)
- scientific article; zbMATH DE number 3928956 (Why is no real title available?)
- scientific article; zbMATH DE number 3951980 (Why is no real title available?)
- scientific article; zbMATH DE number 3959364 (Why is no real title available?)
- scientific article; zbMATH DE number 4033057 (Why is no real title available?)
- scientific article; zbMATH DE number 4049849 (Why is no real title available?)
- scientific article; zbMATH DE number 4050971 (Why is no real title available?)
- scientific article; zbMATH DE number 4061468 (Why is no real title available?)
- scientific article; zbMATH DE number 3763259 (Why is no real title available?)
- scientific article; zbMATH DE number 3780545 (Why is no real title available?)
- scientific article; zbMATH DE number 3485174 (Why is no real title available?)
- scientific article; zbMATH DE number 195199 (Why is no real title available?)
- scientific article; zbMATH DE number 3261673 (Why is no real title available?)
- scientific article; zbMATH DE number 3379785 (Why is no real title available?)
- scientific article; zbMATH DE number 3384257 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- A generalization of the functorial calculus
- A small complete category
- Automatic synthesis of typed \(\Lambda\)-programs on term algebras
- CLU reference manual
- Categorical semantics for higher order polymorphic lambda calculus
- Constructive mathematics and computer programming
- Constructive natural deduction and its ‘ω-set’ interpretation
- Data Types as Lattices
- Dinatural transformations
- Domain theoretic models of polymorphism
- Edinburgh LCF. A mechanized logic of computation
- Extensional models for polymorphism
- Functorial polymorphism
- Fundamental concepts in programming languages
- LCF considered as a programming language
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- On functors expressible in the polymorphic typed lambda calculus
- The Category-Theoretic Solution of Recursive Domain Equations
- The Discrete Objects in the Effective Topos
- The lambda calculus, its syntax and semantics
- The next 700 programming languages
- The semantics of second-order lambda calculus
- The system \({\mathcal F}\) of variable types, fifteen years later
Cited in
(56)- Intensional harmony as isomorphism
- A logical aspect of parametric polymorphism
- Game semantics for bounded polymorphism
- Parametricity for primitive nested types
- Event domains, stable functions and proof-nets
- G-dinaturality.
- Baby Modula-3 and a theory of objects
- A modest model of records, inheritance, and bounded quantification
- Functorial semantics of first-order views
- On paradoxes in normal form
- The naturality of natural deduction. II: on atomic polymorphism and generalized propositional connectives
- Games and full completeness for multiplicative linear logic
- The Girard-Reynolds isomorphism (second edition)
- Types as parameters
- Composing dinatural transformations: towards a calculus of substitution
- On the algebraic structure of declarative programming languages
- On Compositionality of Dinatural Transformations
- Inversion, iteration, and the art of dual wielding
- An exactification of the monoid of primitive recursive functions
- An extension of system \(F\) with subtyping
- The equational logic of fixed points
- Relational parametricity for control considered as a computational effect
- Bunched polymorphism
- Functors are type refinement systems
- A characterization of the least-fixed-point operator by dinaturality
- Linear logic, coherence and dinaturality
- Structural polymorphism
- Core algebra revisited
- Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
- A sequent calculus for subtyping polymorphic types
- Dinatural numbers
- A principled approach to programming with nested types in Haskell
- scientific article; zbMATH DE number 7471683 (Why is no real title available?)
- Parametricity as isomorphism
- Types, abstraction, and parametric polymorphism, part 2
- Softness of hypercoherences and MALL full completeness
- Selective strictness and parametricity in structural operational semantics, inequationally
- Bifibrational functorial semantics of parametric polymorphism
- Fixed-point operations on ccc's. I
- The naturality of natural deduction
- scientific article; zbMATH DE number 4154448 (Why is no real title available?)
- Introduction to Type Theory
- Polymorphism and the obstinate circularity of second order logic: a victims' tale
- Formal parametric polymorphism
- The Girard-Reynolds isomorphism
- General Homomorphic Overloading
- Notions of computation as monoids
- A representation theorem for second-order functionals
- Covariant types
- A categorical semantics for polarized MALL
- scientific article; zbMATH DE number 7204448 (Why is no real title available?)
- Least fixpoints of endofunctors of cartesian closed categories
- Categorical data types in parametric polymorphism
- Proof nets, coends and the Yoneda isomorphism
- Linear Läuchli semantics
- Functorial polymorphism
This page was built for publication: Functorial polymorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753948)
