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

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