Was (wer) ist Logic for Computable Functions - definition
1973 FORMALISM BY ROBIN MILNER
LCF theorem prover; LCF (theorem prover)
Logic for Computable Functions
<language> (LCF) Part of the Edinburgh proof assistant.
[What is it? Address? ]
(1995-01-06)
Logic for Computable Functions
Logic for Computable Functions (LCF) is an interactive automated theorem prover developed at Stanford and Edinburgh by Robin Milner and collaborators in early 1970s, based on the theoretical foundation of logic of computable functions previously proposed by Dana Scott. Work on the LCF system introduced the general-purpose programming language ML to allow users to write theorem-proving tactics, supporting algebraic data types, parametric polymorphism, abstract data types, and exceptions.
Programming Computable Functions
TYPED FUNCTIONAL LANGUAGE
Programming language for Computable Functions; Programming with Computable Functions
In computer science, Programming Computable Functions (PCF) is a typed functional language introduced by Gordon Plotkin in 1977, based on previous unpublished material by Dana Scott. Programming Computable Functions is used by .
Wikipedia
Logic for Computable Functions
Logic for Computable Functions (LCF) is an interactive automated theorem prover developed at Stanford and Edinburgh by Robin Milner and collaborators in early 1970s, based on the theoretical foundation of logic of computable functions previously proposed by Dana Scott. Work on the LCF system introduced the general-purpose programming language ML to allow users to write theorem-proving tactics, supporting algebraic data types, parametric polymorphism, abstract data types, and exceptions.
