Search results

Jump to navigation Jump to search

Page title matches

  • In mathematical logic and computer science, the '''lambda calculus''' (also '''λ-calculus''') is a formal system designed to investigate func ...ymbols that can change from one instruction to the next. By contrast, the lambda calculus is stateless, it deals exclusively with functions which accept and return d
    3 KB (449 words) - 15:23, 12 August 2008
  • #REDIRECT [[Lambda calculus]]
    29 bytes (3 words) - 11:42, 20 February 2008
  • #REDIRECT [[Lambda calculus]]
    29 bytes (3 words) - 11:42, 20 February 2008
  • #REDIRECT [[Lambda calculus]]
    29 bytes (3 words) - 11:43, 20 February 2008
  • 12 bytes (1 word) - 10:52, 20 February 2008
  • 100 bytes (12 words) - 14:37, 15 June 2008
  • 91 bytes (11 words) - 13:19, 1 February 2009

Page text matches

  • ** [[Lambda calculus]]
    478 bytes (48 words) - 09:33, 31 December 2008
  • {{rpl|Lambda calculus}}
    173 bytes (22 words) - 05:17, 26 September 2013
  • #REDIRECT [[Lambda calculus]]
    29 bytes (3 words) - 11:42, 20 February 2008
  • #REDIRECT [[Lambda calculus]]
    29 bytes (3 words) - 11:42, 20 February 2008
  • #REDIRECT [[Lambda calculus]]
    29 bytes (3 words) - 11:43, 20 February 2008
  • #REDIRECT [[Lambda calculus]]
    29 bytes (3 words) - 11:44, 20 February 2008
  • #REDIRECT [[Lambda calculus]]
    29 bytes (3 words) - 11:41, 20 February 2008
  • #REDIRECT [[Lambda calculus]]
    29 bytes (3 words) - 11:41, 20 February 2008
  • In mathematical logic and computer science, the '''lambda calculus''' (also '''λ-calculus''') is a formal system designed to investigate func ...ymbols that can change from one instruction to the next. By contrast, the lambda calculus is stateless, it deals exclusively with functions which accept and return d
    3 KB (449 words) - 15:23, 12 August 2008
  • {{r|Lambda calculus}}
    222 bytes (25 words) - 12:25, 11 November 2009
  • {{r|Lambda calculus}}
    661 bytes (87 words) - 17:04, 11 January 2010
  • ...eme was designed to more faithfully implement [[Alonzo Church|Church's]] [[lambda calculus]] than did comparable languages at the time. ...on of built-in functions such as addition (delta rules are not part of the lambda calculus)
    3 KB (422 words) - 07:12, 8 August 2009
  • {{r|Lambda calculus}}
    888 bytes (123 words) - 17:03, 13 July 2008
  • ...literal implementation of that formalism. Features in the spirit of the [[lambda calculus]] are probably easiest to see in [[Scheme]].
    9 KB (1,405 words) - 08:29, 2 March 2024
  • ...that first-order logic is undecidable; Church's thesis; creation of the [[lambda calculus]]
    4 KB (515 words) - 09:39, 10 November 2008
  • ...ore. A functional language is one that is based on [[Lambda_calculus]]. In lambda calculus variables have single assignment and behave like mathematical functions and
    6 KB (903 words) - 15:28, 24 August 2009
  • * [[Lambda calculus]]
    21 KB (2,958 words) - 05:06, 8 March 2024
  • ...s to solve the [[halting problem]], inventing the [[Turing Machine]] and [[lambda calculus]] respectively.
    26 KB (3,913 words) - 06:51, 7 April 2014
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)