parametricity
Look at other dictionaries:
Parametricity — In the theory of programming languages in computer science, parametricity is a theoretical result that states that functions that have types that are related to each other share certain properties in common. Theory of parametricity The… … Wikipedia
Generic programming — is a style of computer programming in which algorithms are written in terms of to be specified later types that are then instantiated when needed for specific types provided as parameters and was pioneered by Ada which appeared in 1983. This… … Wikipedia
F-algebra — In mathematics, specifically in category theory, an F algebra for an endofunctor :F : mathbf{C}longrightarrow mathbf{C} is an object A of mathbf{C} together with a mathbf{C} morphism :alpha : FA longrightarrow A. In this sense F algebras are dual … Wikipedia
John C. Reynolds — is an American computer scientist (born June 1, 1935).John Reynolds studied at Purdue University and then earned a PhD in theoretical physics from Harvard University in 1961. He was Professor of Information science at Syracuse University from… … Wikipedia
Initial algebra — In mathematics, an initial algebra is an initial object in the category of F algebras for a given endofunctor F . The initiality provides a general framework for induction and recursion. For instance, consider the endofunctor 1+( ) on the… … Wikipedia
parametric — adjective of, relating to, or defined using parameters See Also: parametrical, parametricity … Wiktionary
Polymorphism (computer science) — This article is about the programming language theory concepts with direct application to functional programming languages. For a gentler introduction of these notions as commonly implemented in object oriented programming, see Polymorphism in… … Wikipedia
