Search results

Page title matches

• LGtk/Semantics
  The semantics of LGtk is given by a reference implementation. ...be implemented efficiently? Although this question is not relevant for the semantics, we will see that there is an efficient implementation with <hask>MVar</has
  16 KB (2,699 words) - 23:00, 7 June 2013
• IO Semantics
  * For simplicity, the examples here only gives semantics for teletype I/O. * These are only some of the various ways to describe the semantics of </i><code>IO a</code><i>; your actual implementation may vary.
  11 KB (1,628 words) - 10:36, 5 April 2024
• Strict semantics
  Is the opposite of ... yeah guess what? ... the opposite of [[non-strict semantics]]. [[Strict semantics]] is used e.g. in [[OCaml]] and [[LISP]].
  363 bytes (53 words) - 15:18, 6 February 2021
• Non-strict semantics
  ...non-strict semantics by default: nearly every other language has [[strict semantics]], in which if any subexpression fails to have a value, the whole expressio ...guage uses innermost-first evaluation, it correspondingly must have strict semantics.
  9 KB (1,503 words) - 13:55, 15 December 2019

Page text matches

• Diagrams/Migrate0.5
  == Semantics of beside == The semantics of <code>beside</code>---and hence also of <code>(|||)</code> and <code>(==
  3 KB (570 words) - 03:31, 6 March 2012
• Strict semantics
  Is the opposite of ... yeah guess what? ... the opposite of [[non-strict semantics]]. [[Strict semantics]] is used e.g. in [[OCaml]] and [[LISP]].
  363 bytes (53 words) - 15:18, 6 February 2021
• Simonpj/Talk:LwConc
  ...ld be reflected in the notation. This got me thinking a bit more about the semantics. ...when an exception is thrown. The paper includes the slightly different STM semantics in which <math>\Delta</math> is built as redundant record of allocation eff
  3 KB (497 words) - 19:06, 11 February 2008
• Eager evaluation
  '''Eager evaluation''' is an implementation of the [[strict semantics]] as can be found in [[OCaml]] and usually in [[imperative language]]s. A k
  207 bytes (30 words) - 08:26, 29 November 2007
• Backpack
  ...lthough Backpack is geared toward integration into Haskell, its design and semantics are largely agnostic with respect to the details of the underlying core lan
  2 KB (285 words) - 13:42, 16 March 2018
• Lazy evaluation
  ...hat'' a Haskell program computes, is called [[Non-strict semantics]]. This semantics allows one to bypass undefined values (e.g. results of infinite loops) and ...How it works, how it makes code more modular, how it relates to non-strict semantics, and other things.
  2 KB (291 words) - 15:20, 6 February 2021
• PPT in ENgleza
  <br>[http://csg.csail.mit.edu/6.827/handouts/L19-BS5-Semantics.pdf] L19-BS5-Semantics.pdf<br>28-Nov-2006 11:14<br>144K<br> ...br>[http://csg.csail.mit.edu/6.827/handouts/L19-BS5-Semantics.ppt] L19-BS5-Semantics.ppt<br>28-Nov-2006 11:12<br>0<br>
  5 KB (746 words) - 16:08, 13 March 2011
• Lazy vs. non-strict
  ...ver, the language specification simply states that Haskell is [[Non-strict semantics|non-strict]], which is not quite the same thing as [[lazy evaluation|lazy]] [[Non-strict semantics|Non-strictness]] means that [[reduction]] (the mathematical term for [[eval
  4 KB (643 words) - 23:33, 5 April 2021
• Wadler's Law
  0. Semantics Semantics,
  4 KB (583 words) - 10:26, 26 December 2017
• HaskellImplementorsWorkshop/2012/deVries
  * A precise semantics of message passing and reliability guarantees, with special attention to re
  1 KB (203 words) - 13:43, 17 December 2012
• Reactive
  ..., following from the principle of [http://conal.net/blog/posts/simplifying-semantics-with-type-class-morphisms/ type class morphisms]. ...ute with values before they can be known, with a simple, purely functional semantics (no IO). Futures are polymorphic over both values ''and'' time, requiring
  4 KB (524 words) - 10:39, 17 July 2011
• HaRe
  ...gramatica front-end to parse full Haskell projects into an AST with static semantics, and a token stream. Programatica's token stream contains layout and commen ...formation is currently retrieved from the AST. In addition to this, static semantics are also vital for HaRe to identify particular expressions for refactoring
  4 KB (645 words) - 12:53, 4 August 2014
• Language and library specification
  :Core language operational semantics in Twelf. :A space semantics for the core language. Adam Bakewell. Proc. 2000 Haskell Workshop. Septembe
  7 KB (1,054 words) - 07:37, 12 June 2023
• Infinity and efficiency
  In a language with [[strict semantics]], these two functions are the same. But since the [[non-strict semantics]] of Haskell allows infinite data structures, there is a subtle difference,
  3 KB (422 words) - 21:22, 29 June 2021
• WikipediaArticleDesign
  3.8 Semantics * Static semantics
  3 KB (332 words) - 03:38, 14 August 2021
• Obfuscation
  very confusing. Finally, Haskell's clean semantics makes refactoring
  3 KB (208 words) - 18:50, 17 May 2008
• LGtk
  * [[LGtk/Semantics]]
  1 KB (194 words) - 21:08, 22 July 2023
• Opting for oracles
  ...The oracle, by seeming to contain the prediction, limits the effect on the semantics of the language being used. * Jennifer Hackett and Graham Hutton use them as the basis for an alternate semantics (rather than the more common stateful effects) in [https://www.cs.nott.ac.u
  6 KB (809 words) - 07:56, 12 June 2023
• GHC/CloudAndHPCHaskell/Transport
  ...a simple elegant API developed at Sandia with very rich delivery and event semantics. Portals was used (and forked) by the Lustre project (who call it LNET). ...of new features. Has a driver for UDP already. Very low latency, simple semantics.
  5 KB (710 words) - 12:38, 11 October 2011
• Non-strict semantics
  ...non-strict semantics by default: nearly every other language has [[strict semantics]], in which if any subexpression fails to have a value, the whole expressio ...guage uses innermost-first evaluation, it correspondingly must have strict semantics.
  9 KB (1,503 words) - 13:55, 15 December 2019

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