Functorial polymorphism (Q753948): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q753947 / rank
Normal rank
 
Property / author
 
Property / author: Andrej Scedrov / rank
Normal rank
 
Property / author
 
Property / author: Philip J. Scott / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Véra Kůrková-Pohlová / rank
Normal rank
 
Property / author
 
Property / author: Peter J. Freyd / rank
 
Normal rank
Property / author
 
Property / author: Andrej Scedrov / rank
 
Normal rank
Property / author
 
Property / author: Philip J. Scott / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Véra Kůrková-Pohlová / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Miranda / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Forsythe / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Nuprl / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(90)90151-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2914837968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functorial polymorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus, its syntax and semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3945549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic synthesis of typed \(\Lambda\)-programs on term algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensional models for polymorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: The semantics of second-order lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain theoretic models of polymorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dinatural transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the functorial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The system \({\mathcal F}\) of variable types, fifteen years later / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edinburgh LCF. A mechanized logic of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A small complete category / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Discrete Objects in the Effective Topos / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5654206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3727946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The next 700 programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: CLU reference manual / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive natural deduction and its ‘ω-set’ interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive mathematics and computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On functors expressible in the polymorphic typed lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3204459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3486543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5649639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Types as Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categorical semantics for higher order polymorphic lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Category-Theoretic Solution of Recursive Domain Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental concepts in programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3721784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547635 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:34, 21 June 2024

scientific article
Language Label Description Also known as
English
Functorial polymorphism
scientific article

    Statements

    Functorial polymorphism (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    The authors study two semantic approximations to Strachey's parametric polymorphism. The first one insists on certain naturality conditions on indexed families of functions and therefore interprets universal type abstraction as only a part of the product over all types. Types are approximated by functors and terms by natural transformations between types, all defined over some cartesian closed category of ``ground'' types. The second approximation is based on a version of Reynold's invariance condition.
    0 references
    higher-order lambda calculus
    0 references
    semantic approximations to Strachey's parametric polymorphism
    0 references
    cartesian closed category
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references