Search results

• Talk:Package versioning policy
  How about describing the semantics of versions in the following way?
  2 KB (258 words) - 19:08, 5 January 2012
• HaskellImplementorsWorkshop/2012/deVries
  * A precise semantics of message passing and reliability guarantees, with special attention to re
  1 KB (203 words) - 13:43, 17 December 2012
• Talk:Books
  ...cs is listed under Foundations, but the book (published as ''Computational Semantics with Functional Programming'') is really about natural language processing.
  4 KB (622 words) - 01:04, 19 June 2012
• Reactive
  ..., following from the principle of [http://conal.net/blog/posts/simplifying-semantics-with-type-class-morphisms/ type class morphisms]. ...ute with values before they can be known, with a simple, purely functional semantics (no IO). Futures are polymorphic over both values ''and'' time, requiring
  4 KB (524 words) - 10:39, 17 July 2011
• HaRe
  ...gramatica front-end to parse full Haskell projects into an AST with static semantics, and a token stream. Programatica's token stream contains layout and commen ...formation is currently retrieved from the AST. In addition to this, static semantics are also vital for HaRe to identify particular expressions for refactoring
  4 KB (645 words) - 12:53, 4 August 2014
• Language and library specification
  :Core language operational semantics in Twelf. :A space semantics for the core language. Adam Bakewell. Proc. 2000 Haskell Workshop. Septembe
  7 KB (1,054 words) - 07:37, 12 June 2023
• Infinity and efficiency
  In a language with [[strict semantics]], these two functions are the same. But since the [[non-strict semantics]] of Haskell allows infinite data structures, there is a subtle difference,
  3 KB (422 words) - 21:22, 29 June 2021
• WikipediaArticleDesign
  3.8 Semantics * Static semantics
  3 KB (332 words) - 03:38, 14 August 2021
• Obfuscation
  very confusing. Finally, Haskell's clean semantics makes refactoring
  3 KB (208 words) - 18:50, 17 May 2008
• LGtk
  * [[LGtk/Semantics]]
  1 KB (194 words) - 21:08, 22 July 2023
• 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

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