Search results
Jump to navigation
Jump to search
- ...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
- ...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
- ...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 V4 KB (508 words) - 22:01, 20 November 2022
- ...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
- ...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
- 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
- ...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. Se7 KB (1,162 words) - 17:16, 8 June 2022
- It is used in Haskell systems that implement [[non-strict semantics]] by [[lazy evaluation]].3 KB (450 words) - 20:07, 19 October 2020
- ...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]18 KB (2,331 words) - 09:02, 1 September 2022
- 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
- ...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
- This implementation of the above API is intended to give its semantics.7 KB (1,192 words) - 06:36, 29 June 2012
- Haskell semantics<br>4 KB (621 words) - 05:56, 26 April 2021
- :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
- *:"Denotational semantics and its foundations provide an extremely helpful mathematical understanding4 KB (506 words) - 06:17, 20 April 2024
- ...he STG machine is the abstract machine at the core of GHC. The operational semantics used in Ministg is taken from the paper [https://citeseerx.ist.psu.edu/vie Due to the fact that Ministg implements a small-step semantics, even short computations can yield a large number of trace files. To avoid15 KB (2,396 words) - 07:19, 10 August 2022
- semantics specifically geared to the domain of the application. Much5 KB (796 words) - 20:31, 25 January 2006
- 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, becau9 KB (1,711 words) - 20:19, 31 August 2014
- ==Haskell semantics== ...peytonjones.org/publications-1999/#a-static-semantics-for-haskell A static semantics for Haskell]26 KB (3,569 words) - 10:04, 1 September 2022
- ...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
- 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,325 words) - 12:02, 19 April 2024
- ...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,361 words) - 06:20, 12 June 2023
- ...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 a12 KB (2,067 words) - 05:43, 9 March 2021
- ...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
- ...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 algebraic8 KB (1,277 words) - 11:14, 16 June 2012
- Then, in the definition of the operational semantics, the ENTER rule is:8 KB (1,253 words) - 21:53, 12 June 2009
- ...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 f18 KB (2,751 words) - 00:55, 10 May 2008
- ...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
- ...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 l6 KB (919 words) - 14:03, 7 September 2011
- [9] There is some debate about whether the imprecisely-defined semantics of <code>Int</code> breaks referential transparency. For instance, <code>ev5 KB (774 words) - 10:59, 15 August 2023
- ...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 f12 KB (1,707 words) - 07:27, 10 March 2020
- ...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
- 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, reasoning7 KB (931 words) - 03:51, 10 December 2011
- ...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]19 KB (2,599 words) - 00:14, 15 June 2023
- ...DSL, 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 Hask11 KB (1,601 words) - 18:02, 26 October 2020
- * [https://axellang.github.io/ Axel] - Haskell's semantics, plus Lisp's macros; a purely functional, extensible, and powerful programm5 KB (799 words) - 16:55, 23 March 2021
- ...'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 have14 KB (2,263 words) - 06:31, 10 August 2022
- are combined by `orElse` which gives the semantics one wants: on each8 KB (1,050 words) - 06:19, 21 February 2010
- will just assume "neil" semantics, and might ask for more help in person11 KB (1,778 words) - 15:53, 8 October 2006
- .../www.cs.chalmers.se/~aarne/course-langtech/lectures/lang09.html Lecture 9. Semantics and pragmatics of text and dialogue] dicsusses these concepts in the contex6 KB (884 words) - 16:00, 19 April 2021
- ...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 i6 KB (995 words) - 23:51, 16 April 2021
- its author said, "Lua provides Modula syntax but Scheme semantics". We already mentioned that Lua semantics is rather close, may be a bit13 KB (2,016 words) - 18:34, 20 August 2017
- ...om/gsoc/project/google/gsoc2011/lazard/8001 David Lazar: Formal Executable Semantics of Haskell]8 KB (1,152 words) - 13:09, 24 March 2018