Functorial polymorphism
From MaRDI portal
Publication:753948
DOI10.1016/0304-3975(90)90151-7zbMATH Open0717.18005OpenAlexW2914837968MaRDI QIDQ753948FDOQ753948
Authors: E. S. Bainbridge, Peter J. Freyd, Andre Scedrov, Philip Scott 
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(90)90151-7
Recommendations
cartesian closed categoryhigher-order lambda calculussemantic approximations to Strachey's parametric polymorphism
Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Semantics in the theory of computing (68Q55)
Cites Work
- Title not available (Why is that?)
- Edinburgh LCF. A mechanized logic of computation
- Title not available (Why is that?)
- LCF considered as a programming language
- Title not available (Why is that?)
- Title not available (Why is that?)
- Categorical semantics for higher order polymorphic lambda calculus
- The Category-Theoretic Solution of Recursive Domain Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- The system \({\mathcal F}\) of variable types, fifteen years later
- Data Types as Lattices
- Fundamental concepts in programming languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- The lambda calculus, its syntax and semantics
- Title not available (Why is that?)
- A small complete category
- Title not available (Why is that?)
- Title not available (Why is that?)
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- The Discrete Objects in the Effective Topos
- Title not available (Why is that?)
- A generalization of the functorial calculus
- Constructive natural deduction and its ‘ω-set’ interpretation
- The next 700 programming languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automatic synthesis of typed \(\Lambda\)-programs on term algebras
- Extensional models for polymorphism
- The semantics of second-order lambda calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Functorial polymorphism
- Dinatural transformations
- CLU reference manual
- On functors expressible in the polymorphic typed lambda calculus
- Domain theoretic models of polymorphism
- Title not available (Why is that?)
- Constructive mathematics and computer programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (56)
- A logical aspect of parametric polymorphism
- Intensional harmony as isomorphism
- A modest model of records, inheritance, and bounded quantification
- Structural polymorphism
- Types, abstraction, and parametric polymorphism, part 2
- Covariant types
- A categorical semantics for polarized MALL
- G-dinaturality.
- Introduction to Type Theory
- A sequent calculus for subtyping polymorphic types
- Formal parametric polymorphism
- The naturality of natural deduction. II: on atomic polymorphism and generalized propositional connectives
- A representation theorem for second-order functionals
- Linear Läuchli semantics
- Parametricity for primitive nested types
- Title not available (Why is that?)
- The equational logic of fixed points
- Game semantics for bounded polymorphism
- Core algebra revisited
- On the algebraic structure of declarative programming languages
- Relational parametricity for control considered as a computational effect
- Composing dinatural transformations: towards a calculus of substitution
- Dinatural numbers
- Selective strictness and parametricity in structural operational semantics, inequationally
- The Girard-Reynolds isomorphism (second edition)
- Functors are type refinement systems
- Bifibrational functorial semantics of parametric polymorphism
- An extension of system \(F\) with subtyping
- Title not available (Why is that?)
- Softness of hypercoherences and MALL full completeness
- The Girard-Reynolds isomorphism
- Proof nets, coends and the Yoneda isomorphism
- Functorial semantics of first-order views
- Types as parameters
- A principled approach to programming with nested types in Haskell
- Notions of computation as monoids
- Least fixpoints of endofunctors of cartesian closed categories
- Categorical data types in parametric polymorphism
- Games and full completeness for multiplicative linear logic
- Parametricity as isomorphism
- Fixed-point operations on ccc's. I
- Polymorphism and the obstinate circularity of second order logic: a victims' tale
- The naturality of natural deduction
- Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
- General Homomorphic Overloading
- Event domains, stable functions and proof-nets
- On paradoxes in normal form
- Inversion, iteration, and the art of dual wielding
- An exactification of the monoid of primitive recursive functions
- Bunched polymorphism
- Title not available (Why is that?)
- Baby Modula-3 and a theory of objects
- On Compositionality of Dinatural Transformations
- A characterization of the least-fixed-point operator by dinaturality
- Linear logic, coherence and dinaturality
- Functorial polymorphism
Uses Software
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)
