Search results

• 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
• User:Thsutton/Teaching
  I'm also going to see if I can work out a way to make PL semantics accessible to high school students, probably as an challenging project for
  2 KB (280 words) - 14:50, 13 June 2006
• 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
• Old-reactive
  A target denotational semantics for Data.Future -- simple, precise, and deterministic, in terms of time/val ...The rewrite rules and their justification in terms of simple denotational semantics will be described in an upcoming paper.
  10 KB (1,586 words) - 10:40, 17 July 2011
• HaskellImplementorsWorkshop/2013/Yang
  has for discussing time and space usage: the cost semantics for profiling.
  1,004 bytes (152 words) - 06:35, 16 September 2013
• Cloud Haskell
  ...connect and reconnect, and a more precisely defined semantics (see section Semantics, below) == Semantics ==
  12 KB (1,725 words) - 07:44, 10 August 2022
• Physical equality
  semantics on equality. This is also problematic for partial evaluation; When we rely less on operational semantics of equality,
  7 KB (971 words) - 06:34, 2 April 2009
• Research area
  ...nadic replacements for data constructors are simultaneously '''syntax and semantics''' and works with every monad ! ...le in a large sort of projects involving modular trees and modular monadic semantics (on every monad)
  6 KB (867 words) - 08:50, 26 July 2011
• 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
• 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

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