Search results

Jump to: navigation, search

Page title matches

  • ...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
  • == Semantics of IO: A Free Approach == ...uation-presentation/ Luke Palmer's post]. This only describes one possible semantics of <hask>IO a</hask>; your actually implementation may vary.
    4 KB (627 words) - 21:57, 8 May 2010
  • 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) - 16:54, 28 December 2008
  • 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

Page text matches

  • :Core language operational semantics in Twelf. :A space semantics for the core language. Adam Bakewell. Proc. 2000 Haskell Workshop. Septembe
    7 KB (1,055 words) - 01:33, 1 March 2020
  • ...l programs tend to be shorter (usually between 2 to 10 times shorter). The semantics are most often a lot closer to the problem than an imperative version, whic
    33 KB (5,620 words) - 21:41, 4 October 2015
  • ...ored as a thunk, not fully, because the programmer read about [[non-strict semantics]] and [[lazy vs. non-strict]]. The programmer explicitly wrote <hask>sum</h ...d of strictness annotations as above can have unexpected impact on program semantics, in particular when certain optimizations are performed by the compiler. Se
    7 KB (1,160 words) - 16:59, 23 March 2019
  • ...ernel line buffering is disabled. So GHC tries its best to get NoBuffering semantics by turning off the kernel line buffering, but as a result you lose Ctrl-D. ...ul. These criteria are not rigorous in any real sense (you'd need a formal semantics for Haskell in order to give a proper answer to this question), but should
    36 KB (5,957 words) - 21:29, 26 August 2018
  • Try Haskell. Haskell's lazy semantics are simpler to reason with than ML's.
    4 KB (703 words) - 06:43, 24 January 2006
  • ...'well-defined' part of the Statecharts found in UML -- in that they have a semantics and, via the Z translation, a logic too. ZooM is a tool which takes the .m for functional programming and formal semantics, but in fact we have
    14 KB (2,253 words) - 01:06, 29 October 2016
  • Semantics / Other Applicative Languages / Implications for Parallelism / Functional P ...ble to readers familiar with basic notations and techniques of operational semantics and type systems -- the material covered in the first half of the earlier b
    48 KB (6,950 words) - 01:21, 1 March 2020
  • plus history, semantics and implementation issues. These courses deal with the advanced issues such as semantics, type
    40 KB (6,259 words) - 07:47, 1 March 2020
  • semantics specifically geared to the domain of the application. Much
    5 KB (796 words) - 20:31, 25 January 2006
  • very confusing. Finally, Haskell's clean semantics makes refactoring
    3 KB (208 words) - 18:50, 17 May 2008
  • .../www.cs.chalmers.se/~aarne/course-langtech/lectures/lang09.html Lecture 9. Semantics and pragmatics of text and dialogue] dicsusses these concepts in the contex
    6 KB (878 words) - 11:37, 22 December 2018
  • ...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,213 words) - 11:19, 27 December 2016
  • ...cia Johann, SAIG 2001: Proceedings of the Second International Workshop on Semantics, Applications, and Implementation of Program Generation, 2001, 3-540-42558- ...t/TCS.pdf Selective strictness and parametricity in structural operational semantics, inequationally]
    18 KB (2,524 words) - 13:34, 6 June 2014
  • ==Haskell semantics== ...://research.microsoft.com/~simonpj/Papers/static-semantics.dvi.gz A static semantics for Haskell]
    25 KB (3,474 words) - 15:15, 12 October 2013
  • ...kell.readscheme.org/servlets/cite.ss?pattern=erkok-launchbury-moran-tia-02 Semantics of Value Recursion for Monadic Input/Output] ;[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.736 Semantics of fixIO]
    17 KB (2,312 words) - 15:10, 12 October 2013
  • ;[http://www.cs.kent.ac.uk/pubs/2001/1810/index.html A semantics for tracing. Olaf Chitil]
    11 KB (1,484 words) - 12:29, 10 January 2016
  • ...teseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.455.1434&rep=rep1&type=pdf Semantics of Context-Free Languages].
    4 KB (598 words) - 07:06, 26 January 2018
  • ...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
  • ...ariables. If this guess is wrong, an optimization can change the program's semantics! To avoid this kind of disaster, C optimizers are conservative in their gue # Is it possible to duplicate calls? In Haskell semantics - yes, but real compilers never duplicate work in such simple cases (otherw
    67 KB (10,784 words) - 10:24, 8 March 2020
  • 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
  • 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
  • ...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) - 03:37, 14 April 2016
  • :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
  • 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
  • I think the inheritance semantics are more useful and also more had inheritance semantics, then I could start a thread early on when
    9 KB (1,433 words) - 17:48, 9 August 2006
  • The semantics of typeclass constraint satisfaction are basicly strict. That
    10 KB (1,651 words) - 20:14, 30 June 2007
  • However, that should not distract from its deerper OO semantics.
    30 KB (4,681 words) - 01:47, 18 November 2014
  • ...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
  • ...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,320 words) - 05:15, 10 January 2017
  • 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 ...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
  • symposium includes all aspects of the design, semantics, theory,
    5 KB (731 words) - 19:01, 12 February 2018
  • ...sion does not use a separate manager thread. It employs STM to ensure the semantics of "meet". The code is not easy to follow, especially since I tweaked thin {- meet holds most of the semantics of the thread interactions
    37 KB (4,961 words) - 07:55, 13 December 2009
  • ...replaces the (>>) that sequence_ folds into the list with different abort semantics
    133 KB (20,540 words) - 08:31, 13 December 2009
  • will just assume "neil" semantics, and might ask for more help in person
    11 KB (1,778 words) - 15:53, 8 October 2006
  • There is some debate about whether the imprecisely defined semantics of <hask>Int</hask> breaks referential transparency.
    2 KB (356 words) - 03:06, 29 March 2009
  • 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
  • * Changing the semantics of an existing function is almost certainly controversial
    19 KB (2,988 words) - 02:42, 4 February 2019
  • semantics, but an extra set of coercion rules.
    41 KB (6,592 words) - 21:23, 29 October 2011
  • ...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
  • '''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
  • all aspects of the design, semantics, theory, application, implementation,
    93 KB (13,836 words) - 23:40, 14 August 2019
  • ...e. The Helper Thread code is a very close attempt to simulate the correct semantics. The Single Thread code is flawed since it will get caught in a busy wait mailing list, in which the type and semantics of onCommit and
    24 KB (3,447 words) - 14:22, 25 February 2007
  • 0. Semantics Semantics,
    4 KB (583 words) - 10:26, 26 December 2017
  • are combined by `orElse` which gives the semantics one wants: on each
    8 KB (1,050 words) - 06:19, 21 February 2010
  • It is used in Haskell systems, that implement [[non-strict semantics]] by [[lazy evaluation]].
    3 KB (450 words) - 20:21, 10 June 2019
  • === Semantics of Yhc Core === are semantics-preserving. As part of another project, we have
    28 KB (4,378 words) - 13:10, 8 April 2007
  • ...s Cox touts that was written 20 years ago by Pike implements Posix or Perl semantics. If it finds the longest match (Posix) then it is no help in replacing the
    18 KB (2,819 words) - 19:20, 15 August 2019
  • ...is evaluated, all of them are - we also call this a ''parallel evaluation semantics''. Moreover, ''segmented'' means that all operations come in two flavours:
    6 KB (885 words) - 11:09, 21 August 2007
  • ...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
  • ...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 (226 words) - 01:34, 28 June 2014
  • A definition of the semantics of such bindings via a translation to haskell building on the work of recur is accessed through the runOnceIO function. Its semantics are:
    29 KB (4,567 words) - 18:36, 31 January 2016
  • ...ional language L. 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 (183 words) - 06:27, 21 May 2007
  • 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
  • ...he signatures so that they don't define two functions with different types/semantics under the same name. Second, they provide a set of reusable type signatures
    10 KB (1,679 words) - 23:28, 2 April 2017
  • ...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
  • ...e are a few nits in the above implementation. It doesn't exactly match the semantics of the OCaml parser. For more information on this topic, see the linked mai
    24 KB (3,977 words) - 09:04, 21 January 2013
  • ...ro</hask> or <hask>get</hask>. This is close to specifying the operational semantics of <hask>>>=</hask> directly and can hence be used to implement the monad i
    6 KB (996 words) - 20:17, 12 August 2015
  • ...ar and highlight the key design decisions that were made to preserve GHC's semantics on the JVM. Additionally, I will discuss future directions of GHCVM includi
    16 KB (2,520 words) - 06:08, 16 October 2016
  • ...." ... "So monads are about talking about effects in the context of a pure semantics."
    22 KB (3,102 words) - 19:06, 28 November 2015
  • ...n event with a single occurrence. This one doesn't quite fit the original semantics, as the occurrence is delivered immediately on "listening" to an event (dis
    13 KB (2,149 words) - 10:44, 17 July 2011
  • '''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
  • diagrams, to give them a semantics based on computing fixed points of
    7 KB (1,077 words) - 14:56, 12 June 2014
  • Formal syntax and semantics of programming languages: a laboratory 2.Programming languages (Electronic computers)--Semantics.
    8 KB (1,173 words) - 08:03, 17 February 2015
  • ...in detail at four case studies from different areas: programming language semantics, machine architectures, graphics and formal languages.
    31 KB (4,576 words) - 16:54, 12 March 2020
  • == Semantics-related nitpicks ==
    6 KB (878 words) - 22:30, 12 September 2019
  • ...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) - 03:52, 3 September 2015
  • ...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
  • 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
  • ...e'', if their interfaces are equal and all exported entities have the same semantics. ...er any changes to its interface, including type signatures (of course) and semantics.
    27 KB (4,434 words) - 20:29, 19 February 2015
  • Since Haskell is [[non-strict semantics|non-strict]], the occurence of an error within an expression is not necessa
    2 KB (295 words) - 10:01, 8 July 2011
  • # Is it possible to duplicate calls? In Haskell semantics - yes, but real compilers never duplicate work in such simple cases (otherw in as much as either of those have any semantics at all.
    64 KB (6,037 words) - 11:39, 4 April 2012
  • Haskell semantics</blockquote>
    4 KB (523 words) - 14:19, 29 November 2012
  • ...he language. The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell.</p></li> ....1.0 vs. 2.0.1 include switching to Cabal, and slight changes to the error semantics.</p></li>
    78 KB (11,405 words) - 03:19, 11 February 2008
  • ...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,063 words) - 02:50, 1 October 2010
  • its author said, "Lua provides Modula syntax but Scheme semantics". We already mentioned that Lua semantics is rather close, may be a bit
    13 KB (2,016 words) - 18:34, 20 August 2017
  • As in the implicit case, the semantics of linear implicit parameters can be described in terms of a "monad", which So the semantics of the program depends on whether or not foo has a type
    35 KB (5,673 words) - 20:05, 7 July 2015
  • line 34...43. The semantics of the constructed Score is to be added
    14 KB (2,261 words) - 19:12, 11 August 2008
  • semantics and in particular synchronization were more ''ad hoc'' than
    8 KB (1,374 words) - 00:14, 10 May 2008
  • Attribute grammars add semantics to a context free grammar. Although it is accurately describing a language's semantics is notoriously
    22 KB (3,706 words) - 06:42, 26 January 2018
  • ...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
  • == Semantics of IO: A Free Approach == ...uation-presentation/ Luke Palmer's post]. This only describes one possible semantics of <hask>IO a</hask>; your actually implementation may vary.
    4 KB (627 words) - 21:57, 8 May 2010
  • ...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
  • 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 (420 words) - 18:41, 25 April 2009
  • ...read (non-exclusive) lock. Using a write lock makes no difference to the semantics of the transaction: It is just as atomic if you use a read lock. But, wri
    15 KB (2,390 words) - 11:44, 27 January 2010
  • ..., 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
  • 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) - 16:54, 28 December 2008
  • 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,285 words) - 12:03, 21 October 2012
  • ...The inline would eliminate all the bugs, but it would also enforce strict semantics — that is, it will fail to do the thing we had hoped to achieve by using ...nd then does output, and all the messy interleaving is handled by the lazy semantics of the language. It’s as if you’ve defined a collection of cooperating
    20 KB (3,408 words) - 04:10, 1 October 2011
  • This is in many cases the best semantics and the most efficient implementation.
    2 KB (320 words) - 16:21, 21 September 2011
  • principle: All legal regular expressions should remain correct and their semantics
    22 KB (3,427 words) - 16:46, 1 October 2010
  • Note that the matchAll semantics changed in regex-posix with version
    26 KB (3,619 words) - 03:30, 10 March 2017
  • ...he STG machine is the abstract machine at the core of GHC. The operational semantics used in Ministg is taken from the paper [http://research.microsoft.com/en- 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,394 words) - 07:56, 10 April 2012
  • ...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
  • ...d to allow peekAvail to query the amount of content in the semaphore. The semantics of QSem are slightly extended to allow a new MSem to be initialized with ne
    21 KB (3,241 words) - 13:06, 12 April 2011
  • ...s: categories, monads, modular data structures in Haskell, modular monadic semantics, The Expression Problem, pearls like Functional Pearls, algebraic terms and
    20 KB (3,023 words) - 14:21, 18 February 2015
  • <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
  • Then, in the definition of the operational semantics, the ENTER rule is:
    8 KB (1,253 words) - 21:53, 12 June 2009
  • ...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
  • ...plementation of <code>(>>)</code>, it would not correspond to the intended semantics: the intention is that <code>m >> n</code> ignores the ''result'' of <code> ...code>maybeFix</code> has the right type, it does ''not'' have the intended semantics. If we think about how <code>(>>=)</code> works for the <code>Maybe</code>
    179 KB (29,428 words) - 19:21, 15 August 2019
  • 3.8 Semantics * Static semantics
    3 KB (328 words) - 16:21, 4 August 2009
  • Monad operations (bind and return) have to be [[Non-strict semantics|non-strict]] in fact, always! However
    6 KB (1,018 words) - 17:17, 26 July 2014
  • ** That the semantics are missing. Interaction with type inference, polymorphism, type classes, G
    7 KB (1,192 words) - 18:52, 4 April 2019
  • ...ny one-element set is final. Initial objects play an important role in the semantics of algebraic datatypes. For a datatype like:
    13 KB (2,245 words) - 17:49, 3 March 2010
  • ...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
  • ...ype|subtle difference]] between <hask>data</hask> and <hask>newtype</hask> semantics, which is why the <hask>newtype</hask> optimization is not applied automati Briefly: concurrency describes semantics; parallelism describes an implementation property.
    35 KB (5,569 words) - 19:46, 4 April 2019
  • ...iativity law for <code>>>=</code>. Obeying the three laws ensures that the semantics of the do-notation using the monad will be consistent. ...s in other languages do not require them in Haskell, due to Haskell's lazy semantics.
    165 KB (25,873 words) - 14:04, 3 November 2019
  • ...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
  • ...om/gsoc/project/google/gsoc2011/lazard/8001 David Lazar: Formal Executable Semantics of Haskell]
    8 KB (1,152 words) - 13:09, 24 March 2018
  • ...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
  • ...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
  • ...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
  • ...ronous Lint Engine) is a plugin for providing linting (checking syntax and semantics) in NeoVim 0.2.0+ and Vim 8 while you edit your text files, and acts as a V
    2 KB (311 words) - 17:19, 7 March 2020
  • ...e annotations, and breakpoints in the GHCi debugger. I'm working on a new semantics for cost centre stacks, which will allow us to track call stacks at runtime
    12 KB (1,833 words) - 12:53, 17 December 2012
  • ...identify a set of primitive instructions and to specify their operational semantics. Then, the library makes sure that the monad laws hold automatically. In th
    3 KB (376 words) - 14:28, 4 December 2013
  • ...tuations, but with state involved things like checkpoints and exactly once semantics make it more involved.
    6 KB (961 words) - 22:24, 11 April 2012
  • [[Category:ro]][[Category:tree]][[Category:monad]][[Category:semantics]]
    2 KB (338 words) - 07:55, 10 May 2012
  • * [[/Fixpoint|Fixpoint semantics]]
    3 KB (338 words) - 19:39, 16 October 2016
  • ...L, not Haskell→JS. Works. Not ''very'' annoying to program in, but is JS semantics, not Haskell. Hackage package [http://hackage.haskell.org/package/HJScript [http://roy.brianmckenna.org/ Roy]: meld JavaScript semantics with functional languages. Experimental, but has many bread-and-butter Hask
    11 KB (1,610 words) - 05:11, 25 September 2017
  • == 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
  • ...schedulers and blocking actions is motivated through actions on MVars.The semantics of takeMVar is to block the calling thread if the MVar is empty, and eventu ...created by the RTS to inherit a scheduler, so that they will have sensible semantics when they block on a blackhole, for example.
    19 KB (2,841 words) - 18:41, 22 May 2012
  • This implementation of the above API is intended to give its semantics.
    7 KB (1,192 words) - 06:36, 29 June 2012
  • == 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
  • Semantics can be subtly or not-so-sublty different between FRP libraries and sometime
    25 KB (4,168 words) - 15:10, 24 October 2017
  • * A precise semantics of message passing and reliability guarantees, with special attention to re
    1 KB (203 words) - 13:43, 17 December 2012
  • ...connect and reconnect, and a more precisely defined semantics (see section Semantics, below) == Semantics ==
    12 KB (1,725 words) - 21:48, 13 November 2017
  • 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
  • The original semantics we choose for arrows was for only the shaft length to
    8 KB (1,340 words) - 13:19, 29 March 2014
  • * [[LGtk/Semantics]]
    2 KB (200 words) - 19:41, 14 May 2014
  • 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
  • ...'</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
  • has for discussing time and space usage: the cost semantics for profiling.
    1,004 bytes (152 words) - 06:35, 16 September 2013
  • The design and semantics of HdpH and HdpH-RS will be presented at the Haskell Sympo-
    22 KB (3,305 words) - 01:20, 30 September 2014
  • (10:46) < byorgey> so that would actually give us the wrong semantics.
    9 KB (1,383 words) - 16:48, 18 November 2013
  • ...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
  • ...ou to be importing a function with the same name, same type, and different semantics, which I don't think is common. Likewise, it relies on having mistakes in y
    9 KB (1,515 words) - 23:39, 23 October 2014
  • The goal of the talk is to introduce the audience into the operational semantics of Haskell, by executing a couple of small programs everyone should be fami
    13 KB (1,982 words) - 10:32, 8 September 2016
  • ...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
  • ...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
  • ...functional hardware description language that borrows both its syntax and semantics from the functional programming language Haskell. It provides a familiar st
    3 KB (503 words) - 18:18, 4 April 2017