c^T      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None9;AOT'Enables programmatic construction of triples where it is not known in advance which parts of the triple will be variables and which will be Nodes.&Convert most query-related types to a , most importantly s..Restriction of TermLike to the role of object.1Restriction of TermLike to the role of predicate./Restriction of TermLike to the role of subject.CPermit variables and values to seemlessly be put into argument for $ and similar functionsThe  monad applied to . Execute a ! action, starting with the empty , then process the resulting ./Execute a 'Select Query' action, returning the  representation of the query.2Execute a 'Construct Query' action, returning the  representation of the query.,Execute a 'Ask Query' action, returning the  representation of the query. /Execute a 'Update Query' action, returning the  representation of the query.!1Execute a 'Describe Query' action, returning the  representation of the query."AAdd a prefix to the query, given an IRI reference, and return it.#GCreate and return a variable to the query, usable in later expressions.$~Restrict the query to only results for which values match constants in this triple, or for which the variables can be bound.)Add optional constraints on matches. Variable bindings within the optional action are lost, so variables must always be defined prior to opening the optional block.*4Add a union structure to the query pattern. As with )G blocks, variables must be defined prior to the opening of any block.+FRestrict results to only those for which the given expression is true.-Form a Node , with the  and reference name..Set duplicate handling to &. By default, there are no reductions./Set duplicate handling to &. By default, there are no reductions.0Set limit handling to the given value. By default, there are no limits. Note: negative numbers cause no query results to be returned.1 Alias of 2.2XOrder the results, after any previous ordering, based on the term, in ascending order.3YOrder the results, after any previous ordering, based on the term, in descending order.4Add two terms.5&Find the difference between two terms.6Multiply two terms.7Divide two terms.8"Combine two boolean terms with AND9!Combine two boolean terms with OR:fCreate an expression which tests the relationship of the two operands, evaluating their equivalence.;fCreate an expression which tests the relationship of the two operands, evaluating their equivalence.<iCreate an expression which tests the relationship of the two operands, evaluating their relative value.=iCreate an expression which tests the relationship of the two operands, evaluating their relative value.>iCreate an expression which tests the relationship of the two operands, evaluating their relative value.?iCreate an expression which tests the relationship of the two operands, evaluating their relative value.@=Negate any term-like expression, for use, e.g., in filtering.     !"#$%&'()*+,-./0123 456789 :;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~O  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNO !"#$M%&'()*+,./0123-N456789:;<=>?@ABCDEFGHIJKL           !"#$%&'()*+,-./0123 456789 :;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~465667778392None9;OT.Local representations of incoming XML results.RDF Node (UNode, BNode, LNode)Unbound result valueURI of the SPARQL endpoint.Base 0 for results with a SPARQL-result URI specified.Transform the p result from the HTTP request into a two-dimensional table storing the bindings for each variable in each row.QParses the response from a SPARQL ASK query. Either "true" or "false" is expectedJParses the response from a SPARQL UPDATE query. An empty body is expectedConnect to remote * and find all possible bindings for the  s in the  action.Connect to remote * and find all possible bindings for the  s in the  action.Connect to remote * and find all possible bindings for the  s in the  action.Connect to remote  and construct  TriplesGraph from given   action. Provisional implementation.Connect to remote  and construct  TriplesGraph from given   action. Provisional implementation.fTakes a generated uri and makes simple HTTP request, asking for RDF N3 serialization. Returns either  ParseFailure or RDF         !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~     $hsparql-0.3.2-L8jGiw6LhoCG7CSazMPLONDatabase.HSparql.QueryGeneratorDatabase.HSparql.Connection DescribeQuery queryDescribe SelectQuery queryVars UpdateQuery queryUpdateAskQueryqueryAskConstructQueryqueryConstructsPattern VarOrNodeVar'RDFNodeBlankNodePatternVariableqshowObjectTermLikePredicateTermLikeSubjectTermLikeTermLike varOrTermexprQuerycreateSelectQuerycreateConstructQuerycreateAskQuerycreateUpdateQuerycreateDescribeQueryprefixvartripleconstructTriple askTriple updateTriple describeIRIoptionalunion filterExprbind.:.distinctreducedlimit orderNext orderNextAsc orderNextDesc.+..-..*../..&&..||..==..!=..<..>..<=..>=.notExprstrlang langMatchesdatatypeboundsameTermisIRIisURIisBlank isLiteralregex regexOptsmkPredicateObjectiriRef$fQueryShowQueryData$fQueryShowQueryForm$fQueryShowOrderBy$fQueryShowGroupGraphPattern $fQueryShow[]$fQueryShowPattern$fQueryShowExpr$fQueryShowFunction$fQueryShowRelation$fQueryShowNumericExpr$fQueryShowOperation$fQueryShow[]0$fQueryShowVarOrTerm$fQueryShowGraphTerm$fQueryShowMaybe$fQueryShowIRIRef$fQueryShow[]1$fQueryShowVariable$fQueryShow[]2$fQueryShowPrefix$fQueryShowLValue$fQueryShowNode$fQueryShowLimit$fQueryShowDuplicates$fQueryShow(,)$fQueryShow[]3$fShowDynamicObject$fShowDynamicPredicate$fObjectTermLikeNode$fObjectTermLikeVarOrNode$fObjectTermLikeBool$fObjectTermLike(,)$fObjectTermLike(,)0$fObjectTermLikeText$fObjectTermLikeInteger$fObjectTermLikeExpr$fObjectTermLike[]$fObjectTermLikeVariable$fObjectTermLikeIRIRef$fPredicateTermLikeVariable$fPredicateTermLikeIRIRef$fSubjectTermLike[]$fSubjectTermLikeVariable$fSubjectTermLikeIRIRef$fTermLikeVarOrNode$fTermLikeNode$fTermLikeBool $fTermLike(,)$fTermLike(,)0$fTermLikeText$fTermLikeInteger$fTermLikeExpr $fTermLike[]$fTermLikeIRIRef$fTermLikeVariable$fShowDuplicates $fShowLimit $fShowPrefix$fShowVariable $fShowIRIRef$fShowGraphTerm$fShowVarOrNode$fShowOperation$fShowRelation$fShowFunction $fShowExpr$fShowNumericExpr$fShowVarOrTerm BindingValueBoundUnboundEndPoint selectQueryaskQuery updateQueryconstructQuery describeQuery$fShowBindingValue$fEqBindingValuebaseGHC.BaseString QueryDatatransformers-0.5.2.0Control.Monad.Trans.State.LazyState execQuery queryDataPrefixDistinctReduced QueryForm SelectForm ConstructFormAskForm UpdateForm DescribeForm QueryType SelectType ConstructTypeAskType UpdateType DescribeType TypeNotSetprefixesvarsIdxvars queryTypepatternconstructTriples askTriples updateTriples describeURI duplicateslimitsorderingOrderByAscDescGroupGraphPatternQTripleFilterBindOptionalGraphPatternUnionGraphPatternExprOrExprAndExpr NegatedExprRelationalExpr NumericExpr BuiltinCall VarOrTermExprFunctionStrFuncLangFuncLangMatchesFunc DataTypeFunc BoundFunc SameTermFunc IsIRIFunc IsURIFunc IsBlankFunc IsLiteralFunc RegexFuncRelationEqualNotEqualLessThan GreaterThanLessThanOrEqualGreaterThanOrEqualNumericLiteralExpr OperationExpr OperationAddSubtractMultiplyDivideAndOr VarOrTermVarTermBlankNodePattern' GraphTerm IRIRefTermRDFLiteralTermNumericLiteralTermBooleanLiteralTermBNodeIRIRef AbsoluteIRI PrefixedNameDynamicPredicateObject DynamicObjectDynamicPredicateLimitNoLimit DuplicatesNoLimits QueryShow BuiltinFunc3 BuiltinFunc2 BuiltinFunc1 operationrelation builtinFunc1 builtinFunc2 builtinFunc3getFQN appendPattern appendTripleescapeSpecialChar sparqlResult!xml-1.3.14-77WblwctQve3ga6FJU7qUgText.XML.Light.TypesQNamestructureContentparseAsk parseUpdate$HTTP-4000.3.7-5lfT998Ke7C8SXfKF89f2r Network.TCPhttpCallForRdf