Search results
Jump to navigation
Jump to search
- Some people argue that syntax is less important than semantics.26 members (0 subcategories, 0 files) - 09:49, 13 January 2007
- <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
- Parsec already has operators <tt>(<|>)</tt> and <tt>choice</tt> with fitting semantics. Simply calling <tt>morelse (<|>)</tt> and <tt>mchoice choice</tt> might b517 bytes (82 words) - 12:17, 20 January 2006
- ...icit XReference types. Due to the immutable core (and Haskell's non-strict semantics), I think we can do without them and directly put the types there.380 bytes (56 words) - 10:29, 10 September 2012
- Interests: Virtual worlds, formal semantics of programming languages, programming language theory, algorithms615 bytes (77 words) - 02:46, 20 November 2008
File:Paper-v5.sxw ...f the programmer. A new vision of monadic semantics is now introduced. The semantics is not a function:interp :: Term -> Environment -> Monad but more likely a(328 KB) - 08:40, 10 January 2009- ...ki.haskell.org/index.php?title=Non-strict_semantics&oldid=63164 Non-strict semantics]961 bytes (127 words) - 14:45, 15 December 2019
- ...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
- ==Semantics== A statement in a do-block may be replaced by a more-notation. Semantics of more-declarations becomes as follows:9 KB (1,472 words) - 19:55, 16 September 2011
- How about describing the semantics of versions in the following way?2 KB (258 words) - 19:08, 5 January 2012
- * A precise semantics of message passing and reliability guarantees, with special attention to re1 KB (203 words) - 13:43, 17 December 2012
- ...cs is listed under Foundations, but the book (published as ''Computational Semantics with Functional Programming'') is really about natural language processing.4 KB (622 words) - 01:04, 19 June 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