Search results

Page title matches

• Anonymous function
  An anonymous function is a [[function]] without a name. It is a [[Lambda abstraction]] ...ted to add one to each element of a list, here's one way to do it (without anonymous functions):
  2 KB (296 words) - 06:56, 12 April 2021

Page text matches

• Anonymous function
  An anonymous function is a [[function]] without a name. It is a [[Lambda abstraction]] ...ted to add one to each element of a list, here's one way to do it (without anonymous functions):
  2 KB (296 words) - 06:56, 12 April 2021
• Lambda abstraction
  A ''lambda abstraction'' is another name for an [[anonymous function]]. It gets its name from the usual notation for writing it: for ex
  1 KB (200 words) - 19:54, 13 July 2007
• Jmacro
  ...n in a considerably more functional style, akin to Haskell or ML. Notably, anonymous functions may be introduced with a single backslash, and function applicati ...ate. Typically, this is resolved by placing these blocks of code within an anonymous function to provide namespacing. When two blocks of jmacro code are compose
  8 KB (1,206 words) - 23:52, 29 July 2011
• Functional dependencies vs. type families
  === Anonymous type function values ===
  6 KB (936 words) - 20:35, 27 January 2014
• The Monadic Way
  function that takes a monad and an anonymous function. application, not an anonymous function.
  9 KB (1,615 words) - 15:16, 6 February 2021
• OCaml
  | Anonymous functions
  2 KB (293 words) - 16:34, 15 May 2023
• Show instance for functions
  [[Lambda abstraction|Lambda expression]]s are just [[anonymous function]]s.
  3 KB (430 words) - 00:30, 1 February 2016
• Shootout/Healthcare
  1 anonymous patient 3 anonymous patient
  23 KB (3,171 words) - 02:29, 8 October 2006
• The Monadic Way/Part I
  an anonymous function: argument of "getIntFromType" is an anonymous function that takes the
  60 KB (9,727 words) - 17:00, 25 February 2010
• RuHaskell
  # Nikita Volkov. Anonymous records.
  3 KB (397 words) - 10:26, 1 May 2017
• Import modules properly
  ...ectness:''' I once found a bug in the StorableVector package by converting anonymous imports to explicit imports. I found out that the function <hask>Foreign.Pt
  5 KB (816 words) - 08:28, 2 May 2015
• BayHac2018
  ** Alexander Thiemann: '''SuperRecord: Anonymous Records in Haskell'''
  5 KB (649 words) - 06:32, 29 April 2018
• Ghent Functional Programming Group
  * Anonymous - "An introduction to PHunctional Programming"
  8 KB (1,102 words) - 12:57, 17 December 2012
• Hpaste.el
  for one if that is NIL. You can still appear as (anonymous) by
  10 KB (1,198 words) - 04:06, 19 September 2010
• Applications and libraries/Concurrency and parallelism
  ...oured Petri Nets (HCPN) are an instance of high-level Petri Nets, in which anonymous tokens are replaced by Haskell data objects (and transitions can operate on
  7 KB (998 words) - 06:02, 12 June 2023
• A brief introduction to Haskell
  Anonymous functions like this can be very useful. Also, functions can In Haskell, we can use ''section'' syntax for more concise anonymous
  41 KB (6,592 words) - 22:27, 3 May 2024
• HWN/es/2006-10-31
  * Anonymous: Es bastante posible que 'el último lenguaje para enseñar' no fuera de he
  11 KB (1,674 words) - 08:26, 2 November 2007
• HStringTemplate
  Template references, template application and anonymous templates work as in the Java version. Note that you will need to create t
  12 KB (1,726 words) - 15:16, 6 February 2021
• The Monad.Reader/Issue5/Different Language
  ...lying the part on the right. Functions declared like this are often called anonymous functions because they are never bound to a name.
  19 KB (3,237 words) - 01:33, 10 May 2008
• Yhc/Javascript/Programmers guide/Echo demo source
  -- wrap the Haskell handler function into an anonymous function which checks
  12 KB (2,023 words) - 22:51, 5 April 2021

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)