Programming Language Theory: Difference between revisions

Revision as of 07:14, 7 December 2009 view source Dank (talk \| contribs) Bureaucrats, Administrators 11,302 edits →Combinatory Logic ← Older edit		Revision as of 07:14, 7 December 2009 view source Dank (talk \| contribs) Bureaucrats, Administrators 11,302 edits No edit summary Newer edit →
Line 1:		Line 1:
	The Church-Turing thesis equates a vaguely-defined set of "computable" functions with the [http://en.wikipedia.org/wiki/Computable_function partial recursive functions]. Several systems are only as powerful as the partial recursives (''Turing-complete''): Turing machines and the λ-calculus are two. Programming languages provide further syntaxes and semantics.		The Church-Turing thesis equates a vaguely-defined set of "computable" functions with the [http://en.wikipedia.org/wiki/Computable_function partial recursive functions]. Several systems are only as powerful as the partial recursives (''Turing-complete''): Turing machines and the λ-calculus are two. Programming languages provide further syntaxes and semantics, but all you really need in life is combinatory logic.

	==Applicative/Functional Programming==		==Applicative/Functional Programming==