An Entity of Type: Abstraction100002137, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In computer science and computer programming, a function f is said to be strict if, when applied to a non-terminating expression, it also fails to terminate. A strict function in the denotational semantics of programming languages is a function f where . The entity , called bottom, denotes an expression that does not return a normal value, either because it loops endlessly or because it aborts due to an error such as division by zero. A function that is not strict is called non-strict. A strict programming language is one in which user-defined functions are always strict.

Property Value
dbo:abstract
  • In der Informatik heißt eine einstellige Funktion strikt, wenn gilt:Ist ihr Argument undefiniert , so ist das Funktionsresultat ebenfalls undefiniert.Also wenn: . Eine mehrstellige Funktion kann jeweils in einzelnen Argumenten oder in allen Argumenten strikt sein. Sind alle Argumente strikt, dann ist die Funktion strikt. (de)
  • In computer science and computer programming, a function f is said to be strict if, when applied to a non-terminating expression, it also fails to terminate. A strict function in the denotational semantics of programming languages is a function f where . The entity , called bottom, denotes an expression that does not return a normal value, either because it loops endlessly or because it aborts due to an error such as division by zero. A function that is not strict is called non-strict. A strict programming language is one in which user-defined functions are always strict. Intuitively, non-strict functions correspond to control structures. Operationally, a strict function is one that always evaluates its argument; a non-strict function is one that might not evaluate some of its arguments. Functions having more than one parameter can be strict or non-strict in each parameter independently, as well as jointly strict in several parameters simultaneously. As an example, the if-then-else expression of many programming languages, called <a href="/wiki/%3F:" class="mw-redirect" title="?:">?:</a> in languages inspired by C, may be thought of as a function of three parameters. This function is strict in its first parameter, since the function must know whether its first argument evaluates to true or to false before it can return; but it is non-strict in its second parameter, because (for example) if(false,<span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"> <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \perp }"> <semantics> <mrow class="MJX-TeXAtom-ORD"> <mstyle displaystyle="true" scriptlevel="0"> <mo> ⊥ <!-- ⊥ --> </mo> </mstyle> </mrow> <annotation encoding="application/x-tex"> {\displaystyle \perp } </annotation> </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/afb90d6db42aa12f9e2f31176a4ed4e741c69eca" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.808ex; height:2.176ex;" alt="\perp "></span>,1) = 1, as well as non-strict in its third parameter, because (for example) if(true,2,<span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"> <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \perp }"> <semantics> <mrow class="MJX-TeXAtom-ORD"> <mstyle displaystyle="true" scriptlevel="0"> <mo> ⊥ <!-- ⊥ --> </mo> </mstyle> </mrow> <annotation encoding="application/x-tex"> {\displaystyle \perp } </annotation> </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/afb90d6db42aa12f9e2f31176a4ed4e741c69eca" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.808ex; height:2.176ex;" alt="\perp "></span>) = 2. However, it is jointly strict in its second and third parameters, since if(true,<span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"> <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \perp }"> <semantics> <mrow class="MJX-TeXAtom-ORD"> <mstyle displaystyle="true" scriptlevel="0"> <mo> ⊥ <!-- ⊥ --> </mo> </mstyle> </mrow> <annotation encoding="application/x-tex"> {\displaystyle \perp } </annotation> </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/afb90d6db42aa12f9e2f31176a4ed4e741c69eca" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.808ex; height:2.176ex;" alt="\perp "></span>,<span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"> <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \perp }"> <semantics> <mrow class="MJX-TeXAtom-ORD"> <mstyle displaystyle="true" scriptlevel="0"> <mo> ⊥ <!-- ⊥ --> </mo> </mstyle> </mrow> <annotation encoding="application/x-tex"> {\displaystyle \perp } </annotation> </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/afb90d6db42aa12f9e2f31176a4ed4e741c69eca" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.808ex; height:2.176ex;" alt="\perp "></span>) = <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"> <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \perp }"> <semantics> <mrow class="MJX-TeXAtom-ORD"> <mstyle displaystyle="true" scriptlevel="0"> <mo> ⊥ <!-- ⊥ --> </mo> </mstyle> </mrow> <annotation encoding="application/x-tex"> {\displaystyle \perp } </annotation> </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/afb90d6db42aa12f9e2f31176a4ed4e741c69eca" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.808ex; height:2.176ex;" alt="\perp "></span> and if(false,<span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"> <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \perp }"> <semantics> <mrow class="MJX-TeXAtom-ORD"> <mstyle displaystyle="true" scriptlevel="0"> <mo> ⊥ <!-- ⊥ --> </mo> </mstyle> </mrow> <annotation encoding="application/x-tex"> {\displaystyle \perp } </annotation> </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/afb90d6db42aa12f9e2f31176a4ed4e741c69eca" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.808ex; height:2.176ex;" alt="\perp "></span>,<span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"> <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \perp }"> <semantics> <mrow class="MJX-TeXAtom-ORD"> <mstyle displaystyle="true" scriptlevel="0"> <mo> ⊥ <!-- ⊥ --> </mo> </mstyle> </mrow> <annotation encoding="application/x-tex"> {\displaystyle \perp } </annotation> </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/afb90d6db42aa12f9e2f31176a4ed4e741c69eca" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.808ex; height:2.176ex;" alt="\perp "></span>) = <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"> <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \perp }"> <semantics> <mrow class="MJX-TeXAtom-ORD"> <mstyle displaystyle="true" scriptlevel="0"> <mo> ⊥ <!-- ⊥ --> </mo> </mstyle> </mrow> <annotation encoding="application/x-tex"> {\displaystyle \perp } </annotation> </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/afb90d6db42aa12f9e2f31176a4ed4e741c69eca" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.338ex; width:1.808ex; height:2.176ex;" alt="\perp "></span>. In a non-strict functional programming language, strictness analysis refers to any algorithm used to prove the strictness of a function with respect to one or more of its arguments. Such functions can be compiled to a more efficient calling convention, such as call by value, without changing the meaning of the enclosing program. (en)
dbo:wikiPageID
  • 319252 (xsd:integer)
dbo:wikiPageLength
  • 2867 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 985184858 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdf:type
rdfs:comment
  • In der Informatik heißt eine einstellige Funktion strikt, wenn gilt:Ist ihr Argument undefiniert , so ist das Funktionsresultat ebenfalls undefiniert.Also wenn: . Eine mehrstellige Funktion kann jeweils in einzelnen Argumenten oder in allen Argumenten strikt sein. Sind alle Argumente strikt, dann ist die Funktion strikt. (de)
  • In computer science and computer programming, a function f is said to be strict if, when applied to a non-terminating expression, it also fails to terminate. A strict function in the denotational semantics of programming languages is a function f where . The entity , called bottom, denotes an expression that does not return a normal value, either because it loops endlessly or because it aborts due to an error such as division by zero. A function that is not strict is called non-strict. A strict programming language is one in which user-defined functions are always strict. (en)
rdfs:label
  • Strikte Funktion (de)
  • Strict function (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License