"PCF is a programming language for computable functions, based on LCF, Scott’s logic of computable functions." Programming Computable Functions is used...

Computable functions are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion...

recursive numbers, effective numbers or the computable reals or recursive reals. The concept of a computable real number was introduced by Émile Borel in...

Logic for Computable Functions (LCF), theorem proving logic by Robin Milner. Programming Computable Functions (PCF), small theoretical programming language...

closely with our intuition of what a computable function must be. Certainly the initial functions are intuitively computable (in their very simplicity), and...

foundation of logic of computable functions previously proposed by Dana Scott. Work on the LCF system introduced the general-purpose programming language ML to...

In computer programming, a function, procedure, method, subroutine, routine, or subprogram is a callable unit of software logic that has a well-defined...

with the study of computable functions and Turing degrees. The field has since expanded to include the study of generalized computability and definability...

class of programming languages now known as function-level programming languages. In 1977, Gordon Plotkin introduces Programming Computable Functions, an abstract...

abstract machine or programming language): Turing completeness A computational system that can compute every Turing-computable function is called Turing-complete...