Search results

• Reactive-banana
  ...semantics''' with a working implementation. The library stays close to the semantics pioneered by Conal Elliott.
  5 KB (615 words) - 21:05, 4 January 2016
• Weak head normal form
  ...fined via lambda abstraction. However, the distinction does not matter to semantics. If a lambda abstraction is applied to "too few arguments", then evaluatin
  2 KB (253 words) - 22:16, 5 April 2021
• Correctness of short cut fusion
  The two sides are interchangeable in any program without affecting semantics. ...stance of <hask>destroy</hask>/<hask>unfoldr</hask>-fusion will change the semantics of a program.
  15 KB (2,468 words) - 01:17, 8 April 2016
• LGtk/ADT lenses
  ...'</hask> can be kept in sync is an important but separate question. [[LGtk/Semantics#Dependent_reference_creation]] describes a possible solution.
  9 KB (1,506 words) - 18:10, 8 June 2013
• Open research problems
  * By "purely functional" we mean a language that has value semantics; that is, there is no function such that after evaluation of the function t
  1 KB (200 words) - 12:50, 31 May 2022
• Functional Reactive Programming
  ...arly implementation of Fran represented behaviors as implied in the formal semantics: ...-Time Programming: The Language Ruth And Its Semantics], some parts of the semantics Dave Harrison gives for ''Ruth'' bears a curious resemblance to those for F
  11 KB (1,615 words) - 05:58, 7 November 2022
• HXQ
  ...imization rules; all others cause a compilation error. Finally, the XQuery semantics requires duplicate elimination and sorting by document order for every XPat
  2 KB (389 words) - 12:16, 18 August 2008
• Error
  Since Haskell is [[non-strict semantics|non-strict]], the occurence of an error within an expression is not necessa
  2 KB (296 words) - 15:56, 7 August 2022
• Regular expressions/Bounded space proposal
  If O(orbits) fails to produce Posix semantics then this failing might take a few forms: ...T and 18 of them are listed as getting the Posix *-operator disambiguation semantics correct. But as this is my hobby I decided that I preferred to try and rei
  8 KB (1,325 words) - 18:23, 21 February 2007
• Newtype
  This is intrinsic to Haskell's lazy, non-total semantics. The problem is that this means tracking whether a value is wrapped in a co ...at <hask>Identity' ⊥</hask> really means <hask>Identity' $! ⊥</hask> - the semantics of the type are fundamentally the same, and in particular the case expressi
  6 KB (1,007 words) - 15:57, 22 May 2016
• 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

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