Search results

• Thread-local storage
  I think the inheritance semantics are more useful and also more had inheritance semantics, then I could start a thread early on when
  9 KB (1,433 words) - 17:48, 9 August 2006
• BayHac2017/Clash
  ...functional hardware description language that borrows both its syntax and semantics from the functional programming language Haskell. It provides a familiar st
  3 KB (503 words) - 18:18, 4 April 2017
• New monads/MonadAdvSTM
  ...The ''Helper Thread'' code is a very close attempt to simulate the correct semantics. The ''Single Thread'' code is flawed since it will get caught in a busy w mailing list, in which the type and semantics of onCommit and
  24 KB (3,463 words) - 05:20, 12 July 2021
• Vim
  ...ronous Lint Engine) is a plugin for providing linting (checking syntax and semantics) in NeoVim 0.2.0+ and Vim 8 while you edit your text files, and acts as a V
  4 KB (508 words) - 22:01, 20 November 2022
• The Monad.Reader/Issue2/EternalCompatibilityInTheory
  ...e'', if their interfaces are equal and all exported entities have the same semantics. ...er any changes to its interface, including type signatures (of course) and semantics.
  27 KB (4,434 words) - 20:29, 19 February 2015
• Attribute grammar
  ...teseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.455.1434&rep=rep1&type=pdf Semantics of Context-Free Languages].
  4 KB (598 words) - 07:06, 26 January 2018
• 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
• Performance/Strictness
  ...ored as a thunk, not fully, because the programmer read about [[non-strict semantics]] and [[lazy vs. non-strict]]. The programmer explicitly wrote <hask>sum</h ...d of strictness annotations as above can have unexpected impact on program semantics, in particular when certain optimizations are performed by the compiler. Se
  7 KB (1,162 words) - 17:16, 8 June 2022
• Thunk
  It is used in Haskell systems that implement [[non-strict semantics]] by [[lazy evaluation]].
  3 KB (450 words) - 20:07, 19 October 2020
• Research papers/Monads and arrows
  ...kell.readscheme.org/servlets/cite.ss?pattern=erkok-launchbury-moran-tia-02 Semantics of Value Recursion for Monadic Input/Output] ;[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.736 Semantics of fixIO]
  18 KB (2,331 words) - 09:02, 1 September 2022
• Programare functionala
  Formal syntax and semantics of programming languages: a laboratory 2.Programming languages (Electronic computers)--Semantics.
  8 KB (1,173 words) - 08:03, 17 February 2015
• GHC/Data Parallel Haskell/Package NDP
  ...is evaluated, all of them are - we also call this a ''parallel evaluation semantics''. Moreover, ''segmented'' means that all operations come in two flavours:
  6 KB (885 words) - 11:09, 21 August 2007
• APL
  This implementation of the above API is intended to give its semantics.
  7 KB (1,192 words) - 06:36, 29 June 2012
• Haiku
  Haskell semantics<br>
  4 KB (621 words) - 05:56, 26 April 2021
• Libraries and tools/Linguistics/Applicative universal grammar
  :because it does ''not'' follow a “grammar vs semantics” view, and has a relational approach to understand sign and meaning === Formal semantics ===
  5 KB (703 words) - 12:09, 4 September 2006
• Denotative programming timeline
  *:"Denotational semantics and its foundations provide an extremely helpful mathematical understanding
  4 KB (506 words) - 06:17, 20 April 2024
• Ministg
  ...he STG machine is the abstract machine at the core of GHC. The operational semantics used in Ministg is taken from the paper [https://citeseerx.ist.psu.edu/vie Due to the fact that Ministg implements a small-step semantics, even short computations can yield a large number of trace files. To avoid
  15 KB (2,396 words) - 07:19, 10 August 2022
• Humor/Enron
  semantics specifically geared to the domain of the application. Much
  5 KB (796 words) - 20:31, 25 January 2006
• GHC/Typed holes
  This is the purpose of a hole: it has similar semantics to <tt>undefined</tt>, in that evaluating it is an error (you can replace a ...tt>, meaning I can prove <i>anything</i> with it. In the domain of Haskell semantics, this expression is in fact equivalent to <tt>undefined</tt> as well, becau
  9 KB (1,711 words) - 20:19, 31 August 2014
• Research papers/Type systems
  ==Haskell semantics== ...peytonjones.org/publications-1999/#a-static-semantics-for-haskell A static semantics for Haskell]
  26 KB (3,569 words) - 10:04, 1 September 2022

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