Search results

Page title matches

• Marshall Lochbaum
  '''Marshall Ward Lochbaum''' of Raleigh, North Carolina, is a software developer and pr
  3 KB (478 words) - 08:35, 22 January 2024

Page text matches

• I
  | developer = [[Marshall Lochbaum]] ...nguage)|Factor]], [[wikipedia:SKI combinator calculus|SKI calculus]]<ref>[[Marshall Lochbaum]]. [https://github.com/mlochbaum/ILanguage/blob/master/doc/influen
  3 KB (371 words) - 22:35, 16 March 2024
• Sort
  ...ged array, can more easily be set with a dedicated sorting function.<ref>[[Marshall Lochbaum]]. [https://mlochbaum.github.io/BQN/implementation/primitive/flags
  3 KB (441 words) - 15:06, 6 March 2024
• Group (K)
  ...array corresponds to a dictionary with natural numbers for its keys.<ref>[[Marshall Lochbaum]]. [https://mlochbaum.github.io/BQN/commentary/history.html#group
  1 KB (199 words) - 23:29, 17 March 2024
• Compose
  ...and [[Over]] (<syntaxhighlight lang=apl inline>⍥</syntaxhighlight>).<ref>[[Marshall Lochbaum]]. [https://dyalog.tv/Dyalog19/?v=czWC4tjwzOQ Tacit Techniques wit
  2 KB (272 words) - 22:22, 10 September 2022
• BQN
  | developer = [[Marshall Lochbaum]] ..., [[wikipedia:C (programming language)|C]], or others<ref name="running">[[Marshall Lochbaum]]. [https://mlochbaum.github.io/BQN/running.html "How to run BQN"]
  11 KB (1,330 words) - 15:35, 6 March 2024
• Under
  Structural Under was developed by [[Marshall Lochbaum]] around 2017,<ref>[[Marshall Lochbaum]]. [https://mlochbaum.github.io/BQN/commentary/history.html#struct
  5 KB (664 words) - 13:35, 17 February 2024
• Jay Foad
  ...Marshall Lochbaum]] with help from Foad.<ref>[[Marshall Lochbaum|Lochbaum, Marshall]]. [https://dyalog.tv/Dyalog17/?v=2KnrDmZov4U "Moving Bits Faster in Dyalog
  6 KB (887 words) - 14:50, 4 March 2024
• Co-dfns
  | influenced = [[BQN]]<ref>[[Marshall Lochbaum]]. [https://mlochbaum.github.io/BQN/implementation/codfns.html Co-
  2 KB (220 words) - 03:01, 21 February 2024
• Withe
  ...∘</syntaxhighlight>) and in [[BQN]] as '''After''' (<code>⟜</code>).<ref>[[Marshall Lochbaum]]. ''Tutorial: Combinators''. [https://mlochbaum.github.io/BQN/tut
  2 KB (307 words) - 06:17, 28 February 2024
• Array Cast
  ...Therriault. After appearing multiple times, twice as a guest panellist, [[Marshall Lochbaum]] joined the regular panel with the 22 July 2022 episode. Various ...ycast.com/episodes/episode-07-marshall-lochbaum-and-the-bqn-array-language Marshall Lochbaum and the BQN array language]
  16 KB (1,910 words) - 01:19, 16 April 2024
• Function-operator overloading
  ...re is a [[dyadic operator]] to its left.<ref>[[Marshall Lochbaum|Lochbaum, Marshall]]. [https://dyalog.tv/Dyalog19/?v=czWC4tjwzOQ "Tacit Techniques with Dyalog
  6 KB (797 words) - 12:53, 13 February 2024
• Jsoftware conferences
  |[[Marshall Lochbaum]] || [https://code.jsoftware.com/wiki/Community/Conference2012/Tal |[[Marshall Lochbaum]] || [https://code.jsoftware.com/wiki/Community/Con
  6 KB (800 words) - 23:52, 15 April 2024
• List of language developers
  * [[Marshall Lochbaum]]: [[I]], [[BQN]]
  3 KB (308 words) - 19:26, 20 February 2024
• APL Farm
  ...y Cast]]. Some array language veterans and implementors like [[dzaima]], [[Marshall Lochbaum]], [[Adám Brudzewsky]], [[Morten Kromberg]], [[Michal J Wallace]]
  3 KB (393 words) - 12:53, 31 August 2023
• Boolean
  * [[Dyalog '17]] D08: [[Marshall Lochbaum]], [https://dyalog.tv/Dyalog17/?v=2KnrDmZov4U "Moving Bits Faster * Dyalog Blog: [[Marshall Lochbaum]], [https://www.dyalog.com/blog/2018/06/expanding-bits-in-shrinkin
  9 KB (1,140 words) - 22:10, 10 September 2022
• Marshall Lochbaum
  '''Marshall Ward Lochbaum''' of Raleigh, North Carolina, is a software developer and pr
  3 KB (478 words) - 08:35, 22 January 2024
• Henry Rich
  ...those who had some knowledge of C or BASIC. His students there included [[Marshall Lochbaum]].<ref name="cast"/>
  3 KB (533 words) - 22:27, 10 September 2022
• Comparison tolerance
  ...ps://www.dyalog.com/blog/2019/06/tolerated-comparison-part-2/ part 2] by [[Marshall Lochbaum]]
  4 KB (601 words) - 13:30, 26 February 2024
• Jsoftware
  In 2012 [[Marshall Lochbaum]], then a summer intern at [[wikipedia:Thomasnet|ThomasNet]], bega
  4 KB (598 words) - 23:35, 7 May 2024
• Ranking poker hands
  [[Marshall Lochbaum]] showed the following code in a presentation (D04: "Tacit Techniq ...d is better, 1 if the right is better, and 0 if they are tied. In the talk Marshall calls it by inverting a display function (a task which Dyalog's [[Inverse]]
  13 KB (1,398 words) - 22:22, 10 September 2022

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