Search results

Jump to navigation Jump to search

Page title matches

  • Talk:IO Semantics
    I don't understand in what sense this IO definition is a "semantics". [[User:Conal|Conal]] 04:49, 12 December 2008 (UTC) Maybe so. Thanks. For a semantics, I think I'd want a lot more equalities than the representation by itself p
    1 KB (179 words) - 04:22, 19 February 2010
  • 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
  • Strict semantics
    Is the opposite of ... yeah guess what? ... the opposite of [[non-strict semantics]]. [[Strict semantics]] is used e.g. in [[OCaml]] and [[LISP]].
    363 bytes (53 words) - 15:18, 6 February 2021
  • Talk:Non-strict semantics
    ...nate successfully, precisely because || has non-strict ("short-circuited") semantics in C.
    259 bytes (40 words) - 18:02, 28 November 2011
  • 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
  • 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
  • User talk:Benmachine/Non-strict semantics
    2 KB (232 words) - 17:07, 7 May 2012
  • User:Benmachine/Non-strict semantics
    #REDIRECT [[Non-strict semantics]]
    34 bytes (3 words) - 21:29, 14 September 2013

Page text matches

  • File:RodinV08-xmax-exe-surse.zip
    ...ems. From the lazy evaluation, from the semantics, from the GHC , from the semantics implementation ? ? Anyway, please do not try to use a ”pentru” (en. for
    (337 KB) - 23:42, 10 October 2008
  • Diagrams/Migrate0.5
    == Semantics of beside == The semantics of <code>beside</code>---and hence also of <code>(|||)</code> and <code>(==
    3 KB (570 words) - 03:31, 6 March 2012
  • Strict semantics
    Is the opposite of ... yeah guess what? ... the opposite of [[non-strict semantics]]. [[Strict semantics]] is used e.g. in [[OCaml]] and [[LISP]].
    363 bytes (53 words) - 15:18, 6 February 2021
  • User:Benmachine/Non-strict semantics
    #REDIRECT [[Non-strict semantics]]
    34 bytes (3 words) - 21:29, 14 September 2013
  • Simonpj/Talk:LwConc
    ...ld be reflected in the notation. This got me thinking a bit more about the semantics. ...when an exception is thrown. The paper includes the slightly different STM semantics in which <math>\Delta</math> is built as redundant record of allocation eff
    3 KB (497 words) - 19:06, 11 February 2008
  • Talk:IO Semantics
    I don't understand in what sense this IO definition is a "semantics". [[User:Conal|Conal]] 04:49, 12 December 2008 (UTC) Maybe so. Thanks. For a semantics, I think I'd want a lot more equalities than the representation by itself p
    1 KB (179 words) - 04:22, 19 February 2010
  • Talk:Non-strict semantics
    ...nate successfully, precisely because || has non-strict ("short-circuited") semantics in C.
    259 bytes (40 words) - 18:02, 28 November 2011
  • Eager evaluation
    '''Eager evaluation''' is an implementation of the [[strict semantics]] as can be found in [[OCaml]] and usually in [[imperative language]]s. A k
    207 bytes (30 words) - 08:26, 29 November 2007
  • Backpack
    ...lthough Backpack is geared toward integration into Haskell, its design and semantics are largely agnostic with respect to the details of the underlying core lan
    2 KB (285 words) - 13:42, 16 March 2018
  • Lazy evaluation
    ...hat'' a Haskell program computes, is called [[Non-strict semantics]]. This semantics allows one to bypass undefined values (e.g. results of infinite loops) and ...How it works, how it makes code more modular, how it relates to non-strict semantics, and other things.
    2 KB (291 words) - 15:20, 6 February 2021
  • Category:Syntax
    Some people argue that syntax is less important than semantics.
    26 members (0 subcategories, 0 files) - 09:49, 13 January 2007
  • PPT in ENgleza
    <br>[http://csg.csail.mit.edu/6.827/handouts/L19-BS5-Semantics.pdf] L19-BS5-Semantics.pdf<br>28-Nov-2006 11:14<br>144K<br> ...br>[http://csg.csail.mit.edu/6.827/handouts/L19-BS5-Semantics.ppt] L19-BS5-Semantics.ppt<br>28-Nov-2006 11:12<br>0<br>
    5 KB (746 words) - 16:08, 13 March 2011
  • Talk:MonadPlus reform proposal
    Parsec already has operators <tt>(<|>)</tt> and <tt>choice</tt> with fitting semantics. Simply calling <tt>morelse (<|>)</tt> and <tt>mchoice choice</tt> might b
    517 bytes (82 words) - 12:17, 20 January 2006
  • Talk:Git
    ...icit XReference types. Due to the immutable core (and Haskell's non-strict semantics), I think we can do without them and directly put the types there.
    380 bytes (56 words) - 10:29, 10 September 2012
  • User:DekuDekuplex
    Interests: Virtual worlds, formal semantics of programming languages, programming language theory, algorithms
    615 bytes (77 words) - 02:46, 20 November 2008
  • File:Paper-v5.sxw
    ...f the programmer. A new vision of monadic semantics is now introduced. The semantics is not a function:interp :: Term -> Environment -> Monad but more likely a
    (328 KB) - 08:40, 10 January 2009
  • User:Benmachine
    ...ki.haskell.org/index.php?title=Non-strict_semantics&oldid=63164 Non-strict semantics]
    961 bytes (127 words) - 14:45, 15 December 2019
  • Lazy vs. non-strict
    ...ver, the language specification simply states that Haskell is [[Non-strict semantics|non-strict]], which is not quite the same thing as [[lazy evaluation|lazy]] [[Non-strict semantics|Non-strictness]] means that [[reduction]] (the mathematical term for [[eval
    4 KB (643 words) - 23:33, 5 April 2021
  • Wadler's Law
    0. Semantics Semantics,
    4 KB (583 words) - 10:26, 26 December 2017
  • User:Zzo38/Proposal for more-notation
    ==Semantics== A statement in a do-block may be replaced by a more-notation. Semantics of more-declarations becomes as follows:
    9 KB (1,472 words) - 19:55, 16 September 2011
  • 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
  • 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 50 | next 50) (20 | 50 | 100 | 250 | 500)

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