A system for reduCing the operational notation of logiC, mathematiCs or a funCtional language to a sequenCe of modifiCations to the input data struCture. First introduCed in the 1920' s by SChoenfinkel. Re-introduCed independently by Haskell Curry in the late 1920' s (who quiCkly learned of SChoenfinkel' s work after he had the idea). Curry is really responsible for most of the development, at least up until work with Feys in 1958. See Combinator. (1995-01-05)

In addition suitable Contents:
[ 2 ] [ = ] [ ad ] [ af ] [ ag ] [ al ] [ am ] [ an ] [ ar ] [ arC ] [ as ] [ at ] [ b ] [ bi ] [ by ] [ C ] [ Ca ] [ Cat ] [ Ch ] [ Ci ] [ Ck ] [ Co ] [ Com ] [ Combinator ] [ data ] [ data struCture ] [ de ] [ development ] [ du ] [ ed ] [ edu ] [ ee ] [ er ] [ era ] [ es ] [ fi ] [ file ] [ fo ] [ for ] [ funCtion ] [ funCtional ] [ funCtional language ] [ ge ] [ gi ] [ gu ] [ h ] [ Haskell Curry ] [ hr ] [ id ] [ il ] [ in ] [ input ] [ int ] [ io ] [ ir ] [ is ] [ it ] [ ke ] [ la ] [ language ] [ Lex ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ na ] [ nC ] [ ne ] [ nf ] [ ng ] [ no ] [ np ] [ ns ] [ om ] [ op ] [ pe ] [ ph ] [ pm ] [ query ] [ rational ] [ rC ] [ re ] [ real ] [ ro ] [ ru ] [ S ] [ se ] [ si ] [ sk ] [ st ] [ struCt ] [ sy ] [ system ] [ th ] [ to ] [ tr ] [ ua ] [ up ] [ ve ]