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,493 words) - 21:28, 14 September 2013
  • == 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,042 words) - 19:06, 4 April 2019
  • ...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
    47 KB (6,888 words) - 17:44, 5 March 2019
  • plus history, semantics and implementation issues. These courses deal with the advanced issues such as semantics, type
    39 KB (6,049 words) - 14:59, 19 September 2016
  • 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,700 words) - 07:24, 11 May 2015
  • 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

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