{ "items" : [
    { "id" : "http://dbpedia.org/resource/Combinatory_logic"
      "properties" : {
        "http://www.w3.org/2000/01/rdf-schema#comment" : [ "Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. It was introduced by Moses Schönfinkel and Haskell Curry, and has more recently been used in computer science as a theoretical model of computation and also as a basis for the design of functional programming languages. It is based on combinators. A combinator is a higher-order function that uses only function application and earlier defined combinators to define a result from its arguments." ] ,
        "http://www.w3.org/2002/07/owl#differentFrom" : [ "http://dbpedia.org/resource/Combinational_logic"] } } }
