Programming Computable Functions: Difference between revisions

Revision as of 16:24, 25 November 2005

Revision as of 18:43, 25 November 2005

Line 1:

'''PCF''' or [[Programming language for Computable Functions]] is a typed functional language introduced by [[Gordon Plotkin]] in [[1977]]. It is based on the Logic of Computable Function ([[LCF]]) by [[Dana Scott]]. It can be considered as a simplified version of modern typed functional languages such as [[ML programming language|ML]].

{{stub}}

{{comp-stub}}

The programming language [[Programming language for Computable Functions]] (or '''PCF''' for short) is a call-by-name typed functional language.

== Syntax ==

Its types ''A'' are given by the following grammar

: <tt>A ::= exp | A → A</tt>

and its terms by

: <tt>M ::= x | λx:A.M | MM | n | succ M | pred M | cond M M M | Y_A M</tt>

where ''x'' is a variable and ''n'' an integer.

== Typing rules ==

== Semantics ==

[[Category:Programming languages]]