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 ]