Search results

Jump to navigation Jump to search

  • Nitpicks
    == Semantics-related nitpicks ==
    7 KB (1,033 words) - 01:16, 27 September 2021
  • Lucid
    ...h of reading further, because a detailed description of Lucid's syntax and semantics is hiding inside this paper (section 3.1.2 on pages 22--38). This paper is
    4 KB (593 words) - 15:07, 5 November 2011
  • Diagrams/Dev/Freezing
    == Semantics of 'freeze' == ...me places and thinner in others). It might be nice to define an alternate semantics defined in terms of, e.g. an "average scale factor" for a given transformat
    10 KB (1,576 words) - 22:57, 30 November 2013
  • Laziness is not always good
    This is in many cases the best semantics and the most efficient implementation.
    2 KB (342 words) - 09:27, 9 June 2023
  • Applications and libraries/Linguistics
    ...ography.html publications] on natural language processing, parsing, formal semantics. Many of them use Haskell, and there are [http://www.ling.gu.se/~peb/softwa ...st order terms), and produces the set of sentences associated to the input semantics by the grammar. See also [http://www.loria.fr/~kow/ Eric Kow]'s recent publ
    15 KB (2,211 words) - 16:44, 1 August 2021
  • Humor/Flakes
    Try Haskell. Haskell's lazy semantics are simpler to reason with than ML's.
    4 KB (703 words) - 06:43, 24 January 2006
  • Playing by the rules
    '''Note:''' In general it's a bad idea for rules to change the semantics (meaning) of your code in such a way. Consider someone using <tt>reverse . ...d of rewrite rules the above mentioned problem of potentially changing the semantics of programs occurs. Read further under [[Correctness of short cut fusion|co
    9 KB (1,362 words) - 14:23, 26 January 2010
  • Diagrams/Dev
    * [[/Fixpoint|Fixpoint semantics]]
    3 KB (338 words) - 19:39, 16 October 2016
  • Syntactic sugar
    Too much syntactic sugar can make the underlying semantics unclear, but too little can obscure what is being expressed. The author of
    3 KB (490 words) - 01:44, 27 October 2017
  • GHC/Data Parallel Haskell/References
    ...ating support for nested data parallelism into Haskell; in particular, the semantics of parallel arrays and the idea of distinguishing between the parallel and ...2006/1286/pdf/leshchinskiy_roman.pdf Higher-order nested data parallelism: semantics and implementation], PhD Thesis, Roman Leshchinskiy. This deals in details
    8 KB (1,153 words) - 13:18, 2 December 2008
  • 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

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

Retrieved from "https://wiki.haskell.org/Special:Search"