About: Direct function     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

A direct function (dfn, pronounced "dee fun") is an alternative way to define a function and operator (a higher-order function) in the programming language APL. A direct operator can also be called a dop (pronounced "dee op"). They were invented by John Scholes in 1996. They are a unique combination of array programming, higher-order function, and functional programming, and are a major distinguishing advance of early 21st century APL over prior versions. PT← {(+/⍵*2)=2×(⌈/⍵)*2} PT 3 4 51 x 4 5 3 3 11 6 5 13 1217 16 811 12 417 15 8 PT x1 0 1 0 0 1 The factorial function as a dfn:

AttributesValues
rdf:type
rdfs:label
  • Direct function (en)
rdfs:comment
  • A direct function (dfn, pronounced "dee fun") is an alternative way to define a function and operator (a higher-order function) in the programming language APL. A direct operator can also be called a dop (pronounced "dee op"). They were invented by John Scholes in 1996. They are a unique combination of array programming, higher-order function, and functional programming, and are a major distinguishing advance of early 21st century APL over prior versions. PT← {(+/⍵*2)=2×(⌈/⍵)*2} PT 3 4 51 x 4 5 3 3 11 6 5 13 1217 16 811 12 417 15 8 PT x1 0 1 0 0 1 The factorial function as a dfn: (en)
dbp:wikiPageUsesTemplate
foaf:homepage
Subject
thumbnail
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/Cantor_set_in_seven_iterations.svg
prov:wasDerivedFrom
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
Link from a Wikipage to another Wikipage
has abstract
  • A direct function (dfn, pronounced "dee fun") is an alternative way to define a function and operator (a higher-order function) in the programming language APL. A direct operator can also be called a dop (pronounced "dee op"). They were invented by John Scholes in 1996. They are a unique combination of array programming, higher-order function, and functional programming, and are a major distinguishing advance of early 21st century APL over prior versions. A dfn is a sequence of possibly guarded expressions (or just a guard) between <span class="kt">{</span> and <span class="kt">}</span>, separated by <span class="p">⋄</span> or new-lines, wherein <span class="bp">⍺</span> denotes the left argument and <span class="bp">⍵</span> the right, and <span class="bp">∇</span> denotes recursion (function self-reference). For example, the function <span class="nv">PT</span> tests whether each row of <span class="bp">⍵</span> is a Pythagorean triplet (by testing whether the sum of squares equals twice the square of the maximum). PT← {(+/⍵*2)=2×(⌈/⍵)*2} PT 3 4 51 x 4 5 3 3 11 6 5 13 1217 16 811 12 417 15 8 PT x1 0 1 0 0 1 The factorial function as a dfn: fact← {0=⍵:1 ⋄ ⍵×∇ ⍵-1} fact 5120 fact¨ ⍳10 ⍝ fact applied to each element of 0 to 91 1 2 6 24 120 720 5040 40320 362880 (en)
foaf:isPrimaryTopicOf
is Wikipage redirect of
is Link from a Wikipage to another Wikipage of
Faceted Search & Find service v1.17_git151 as of Feb 20 2025


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software