Search results

From Maths
Jump to: navigation, search
  • ...the [[Cartesian product]] of two sets{{rAPIKM}}<ref name="TAPL">Types and Programming Languages - Benjamin C. Peirce</ref>, that is:
    4 KB (762 words) - 20:07, 20 April 2016
  • (This is similar to scopes in programming languages)<br/>
    4 KB (832 words) - 21:22, 11 August 2015
  • |header6=Programming registers
    745 B (109 words) - 13:53, 14 February 2016
  • | colspan="16" | '''Programming registers'''
    3 KB (438 words) - 14:30, 14 February 2016
  • ...{{M|P}} is true of {{M|x\in X}}" if {{M|x\in P}}<ref name="TAPL">Types and Programming Languages - Benjamin C. Peirce</ref>
    916 B (160 words) - 18:44, 18 March 2016
  • ...in a page. I used it because of the parallels between refactoring code (in programming) and refactoring pages (when moving the contents about, re-writing chunks,
    2 KB (425 words) - 02:21, 12 April 2016
  • * [[Singleton (programming)]] - a name given to a type of which there can only be one global instance {{Definition|Programming|Set Theory|Elementary Set Theory}}
    360 B (53 words) - 17:53, 17 February 2017
  • [[Category:Systems programming]]
    3 KB (417 words) - 14:17, 7 September 2017
  • ...used and DFAs are usually implicitly acceptors. In the wider practice of "programming" DFAs are a very useful model and are neither "pure" acceptors or transduce
    2 KB (373 words) - 03:23, 21 January 2018
  • ...b{N} }} "{{M|a}} ''modulo'' {{M|b}}", written usually as {{C|a%b}} in most programming languages or using a {{C|mod(a,b)}} {{link|function|Computer Science}} is t
    986 B (148 words) - 17:48, 7 January 2018