Search results
Jump to navigation
Jump to search
Page title matches
- * 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
- 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
- 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</has16 KB (2,699 words) - 23:00, 7 June 2013
- ...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
Page text matches
- == 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
- 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
- ...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 eff3 KB (497 words) - 19:06, 11 February 2008
- '''Eager evaluation''' is an implementation of the [[strict semantics]] as can be found in [[OCaml]] and usually in [[imperative language]]s. A k207 bytes (30 words) - 08:26, 29 November 2007
- ...lthough Backpack is geared toward integration into Haskell, its design and semantics are largely agnostic with respect to the details of the underlying core lan2 KB (285 words) - 13:42, 16 March 2018
- ...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
- <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
- ...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 [[eval4 KB (643 words) - 23:33, 5 April 2021
- 0. Semantics Semantics,4 KB (583 words) - 10:26, 26 December 2017
- * A precise semantics of message passing and reliability guarantees, with special attention to re1 KB (203 words) - 13:43, 17 December 2012
- ..., 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, requiring4 KB (524 words) - 10:39, 17 July 2011
- ...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 refactoring4 KB (645 words) - 12:53, 4 August 2014
- :Core language operational semantics in Twelf. :A space semantics for the core language. Adam Bakewell. Proc. 2000 Haskell Workshop. Septembe7 KB (1,054 words) - 07:37, 12 June 2023
- 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
- 3.8 Semantics * Static semantics3 KB (332 words) - 03:38, 14 August 2021
- very confusing. Finally, Haskell's clean semantics makes refactoring3 KB (208 words) - 18:50, 17 May 2008
- * [[LGtk/Semantics]]1 KB (194 words) - 21:08, 22 July 2023
- ...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.u6 KB (809 words) - 07:56, 12 June 2023
- ...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 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
- has for discussing time and space usage: the cost semantics for profiling.1,004 bytes (152 words) - 06:35, 16 September 2013
- ...connect and reconnect, and a more precisely defined semantics (see section Semantics, below) == Semantics ==12 KB (1,725 words) - 07:44, 10 August 2022
- 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
- ...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
- * 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
- ...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
- ...fined via lambda abstraction. However, the distinction does not matter to semantics. If a lambda abstraction is applied to "too few arguments", then evaluatin2 KB (253 words) - 22:16, 5 April 2021
- 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
- ...'</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
- * By "purely functional" we mean a language that has value semantics; that is, there is no function such that after evaluation of the function t1 KB (200 words) - 12:50, 31 May 2022
- ...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 F11 KB (1,615 words) - 05:58, 7 November 2022
- ...imization rules; all others cause a compilation error. Finally, the XQuery semantics requires duplicate elimination and sorting by document order for every XPat2 KB (389 words) - 12:16, 18 August 2008
- Since Haskell is [[non-strict semantics|non-strict]], the occurence of an error within an expression is not necessa2 KB (296 words) - 15:56, 7 August 2022
- 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 rei8 KB (1,325 words) - 18:23, 21 February 2007
- 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 expressi6 KB (1,007 words) - 15:57, 22 May 2016
- == Semantics-related nitpicks ==7 KB (1,033 words) - 01:16, 27 September 2021
- ...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 is4 KB (593 words) - 15:07, 5 November 2011
- == 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 transformat10 KB (1,576 words) - 22:57, 30 November 2013
- This is in many cases the best semantics and the most efficient implementation.2 KB (342 words) - 09:27, 9 June 2023
- ...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 publ15 KB (2,211 words) - 16:44, 1 August 2021
- Try Haskell. Haskell's lazy semantics are simpler to reason with than ML's.4 KB (703 words) - 06:43, 24 January 2006
- '''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|co9 KB (1,362 words) - 14:23, 26 January 2010
- * [[/Fixpoint|Fixpoint semantics]]3 KB (338 words) - 19:39, 16 October 2016
- Too much syntactic sugar can make the underlying semantics unclear, but too little can obscure what is being expressed. The author of3 KB (490 words) - 01:44, 27 October 2017
- ...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 details8 KB (1,153 words) - 13:18, 2 December 2008
- I think the inheritance semantics are more useful and also more had inheritance semantics, then I could start a thread early on when9 KB (1,433 words) - 17:48, 9 August 2006
- 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
- ...functional hardware description language that borrows both its syntax and semantics from the functional programming language Haskell. It provides a familiar st3 KB (503 words) - 18:18, 4 April 2017
- ...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 w mailing list, in which the type and semantics of onCommit and24 KB (3,463 words) - 05:20, 12 July 2021