Search results

• 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
• Budapest Hackathon 2016/Projects
  ...me circumstances. It would also be beneficial to work out the exact formal semantics of the fusion operator for infinite loops.
  5 KB (679 words) - 14:07, 5 August 2016
• Maintaining laziness
  One of Haskell's main features is [[non-strict semantics]], which is implemented by [[lazy evaluation]] in all popular Haskell compi ...o unnecessary inefficiencies, [[memory leak]]s and, we suspect, unintended semantics.
  20 KB (3,325 words) - 12:02, 19 April 2024
• Research papers/Parallelism and concurrency
  ...ww.macs.hw.ac.uk/~gnik/apset/transitionsystem.ps.gz Towards an operational semantics for a parallel non-strict functional language] ...://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.8875 An Operational Semantics for Parallel Lazy Evaluation]
  9 KB (1,361 words) - 06:20, 12 June 2023
• Contstuff
  ...just like in other transformer libraries, but this one has very different semantics and also takes an additional parameter: ...hat <hask>bracket</hask> and <hask>bracket_</hask> have slightly different semantics than the corresponding functions from <hask>Control.Exception</hask>. If a
  12 KB (2,067 words) - 05:43, 9 March 2021
• Parallel/Glossary
  ...d most direct way to write the program. Since the threads perform I/O, the semantics of the program is necessarily non-deterministic.
  4 KB (606 words) - 16:32, 17 April 2014
• List function suggestions
  ...is to reach some kind of reasonable consensus, specifically on naming and semantics. Even if we need pairs of functions to satisfy various usage and algebraic
  8 KB (1,277 words) - 11:14, 16 June 2012
• MaxBolingbroke/Talk:TypesAreCallingConventions
  Then, in the definition of the operational semantics, the ENTER rule is:
  8 KB (1,253 words) - 21:53, 12 June 2009
• The Monad.Reader/Issue4/Solving Sudoku
  ...eturn values in the `Maybe` monad from the `State` monad, and gives us the semantics of both monads combined in a useful way: ...to write simple recursive solvers in Haskell, with state and backtracking semantics layered into the program using monads and monad transformers. In terms of f
  18 KB (2,751 words) - 00:55, 10 May 2008
• Diagrams/Dev/Migrate1.2
  ...d the proper choice of line weight depends on the context, because the old semantics was not very sensible).
  5 KB (807 words) - 19:36, 30 June 2014
• O mica introducere in Haskell 98
  ...her, and the community, well -- one with all the gory detail of syntax and semantics, the other serving more as a tutorial for someone who is familiar with at l
  6 KB (919 words) - 14:03, 7 September 2011
• Referential transparency
  [9] There is some debate about whether the imprecisely-defined semantics of <code>Int</code> breaks referential transparency. For instance, <code>ev
  5 KB (774 words) - 10:59, 15 August 2023
• Applications and libraries/Compilers and interpreters
  ...unctional language derived from Haskell, although with a strict evaluation semantics. The Timber compiler currently runs on Linux and MacOS X platforms, but use :An interpreter for a high-level, small-step, operational semantics for the STG machine. Features execution tracing, rendered in HTML. Useful f
  12 KB (1,707 words) - 07:27, 10 March 2020
• Parallel GHC Project
  ...cess/blob/master/doc/semantics/CloudHaskellSemantics.pdf precisely defined semantics]; supports [http://hackage.haskell.org/package/distributed-static composabl ...ki/Important-Open-Issues important open issues] of the implementation; the semantics document mentioned above lists some important open semantic issues.
  15 KB (2,160 words) - 09:39, 13 November 2012
• Applications and libraries/Generic programming/Strafunski
  The set of generic function combinators of Strafunski has a well-understood semantics that does not rely on very advanced typing features. As a result, reasoning
  7 KB (931 words) - 03:51, 10 December 2011

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