Faster access than browser!
16 relations: Cartesian closed category, Computer science, Dana Scott, Denotational semantics, Domain theory, Functional programming, Game semantics, Gordon Plotkin, Haskell (programming language), Least fixed point, ML (programming language), Robin Milner, Scott continuity, Theoretical Computer Science (journal), Type system, Typed lambda calculus.
Cartesian closed category
In category theory, a category is considered Cartesian closed if, roughly speaking, any morphism defined on a product of two objects can be naturally identified with a morphism defined on one of the factors.
New!!: Programming Computable Functions and Cartesian closed category · See more »
Computer science
Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.
New!!: Programming Computable Functions and Computer science · See more »
Dana Scott
Dana Stewart Scott (born October 11, 1932) is the emeritus Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic at Carnegie Mellon University; he is now retired and lives in Berkeley, California.
New!!: Programming Computable Functions and Dana Scott · See more »
Denotational semantics
In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach of formalizing the meanings of programming languages by constructing mathematical objects (called denotations) that describe the meanings of expressions from the languages.
New!!: Programming Computable Functions and Denotational semantics · See more »
Domain theory
Domain theory is a branch of mathematics that studies special kinds of partially ordered sets (posets) commonly called domains.
New!!: Programming Computable Functions and Domain theory · See more »
Functional programming
In computer science, functional programming is a programming paradigm—a style of building the structure and elements of computer programs—that treats computation as the evaluation of mathematical functions and avoids changing-state and mutable data.
New!!: Programming Computable Functions and Functional programming · See more »
Game semantics
Game semantics (dialogische Logik, translated as dialogical logic) is an approach to formal semantics that grounds the concepts of truth or validity on game-theoretic concepts, such as the existence of a winning strategy for a player, somewhat resembling Socratic dialogues or medieval theory of Obligationes.
New!!: Programming Computable Functions and Game semantics · See more »
Gordon Plotkin
Gordon David Plotkin, FRS, FRSE (born 9 September 1946) is a theoretical computer scientist in the School of Informatics at the University of Edinburgh.
New!!: Programming Computable Functions and Gordon Plotkin · See more »
Haskell (programming language)
Haskell is a standardized, general-purpose compiled purely functional programming language, with non-strict semantics and strong static typing.
New!!: Programming Computable Functions and Haskell (programming language) · See more »
Least fixed point
In order theory, a branch of mathematics, the least fixed point (lfp or LFP, sometimes also smallest fixed point) of a function from a partially ordered set to itself is the fixed point which is less than each other fixed point, according to the set's order.
New!!: Programming Computable Functions and Least fixed point · See more »
ML (programming language)
ML (Meta Language) is a general-purpose functional programming language.
New!!: Programming Computable Functions and ML (programming language) · See more »
Robin Milner
Arthur John Robin Gorell Milner (13 January 1934 – 20 March 2010), known as Robin Milner or A. J. R. G. Milner, was a British computer scientist, and a Turing Award winner.
New!!: Programming Computable Functions and Robin Milner · See more »
Scott continuity
In mathematics, given two partially ordered sets P and Q, a function f \colon P \rightarrow Q between them is Scott-continuous (named after the mathematician Dana Scott) if it preserves all directed suprema, i.e. if for every directed subset D of P with supremum in P its image has a supremum in Q, and that supremum is the image of the supremum of D: that is, \sqcup f.
New!!: Programming Computable Functions and Scott continuity · See more »
Theoretical Computer Science (journal)
Theoretical Computer Science (TCS) is a computer science journal published by Elsevier, started in 1975 and covering theoretical computer science.
New!!: Programming Computable Functions and Theoretical Computer Science (journal) · See more »
Type system
In programming languages, a type system is a set of rules that assigns a property called type to the various constructs of a computer program, such as variables, expressions, functions or modules.
New!!: Programming Computable Functions and Type system · See more »
Typed lambda calculus
A typed lambda calculus is a typed formalism that uses the lambda-symbol (\lambda) to denote anonymous function abstraction.
New!!: Programming Computable Functions and Typed lambda calculus · See more »
Redirects here:
Programming language for Computable Functions, Programming with Computable Functions.
References
[1] https://en.wikipedia.org/wiki/Programming_Computable_Functions
