Search results

Page title matches

• Ternary operator
  With a bit of work, we can define a ternary conditional operator in
  847 bytes (121 words) - 23:08, 24 July 2021
• Infix operator
  Putting parentheses around an infix operator converts it into a prefix function: * [[section of an infix operator]]
  1 KB (159 words) - 23:45, 25 June 2021
• Unary operator
  A unary operator is an operator with one parameter. Haskell only has one built-in unary operator, namely the negation operator <hask>-</hask>.
  3 KB (397 words) - 20:54, 24 February 2024
• Relative infix operator precedences
  This would force the use of parentheses in cases where the operator name designers
  1 KB (141 words) - 16:48, 9 April 2009
• Cum pot afla cu ce date opereaza un operator ?
  367 bytes (52 words) - 09:35, 8 February 2010
• Section of an infix operator
  ...tuitively takes an argument and puts it on the "missing" side of the infix operator. Note: as an exception, the "-" (subtraction) operator cannot do a right section, because that would be interpreted as unary negat
  2 KB (233 words) - 17:58, 31 March 2017
• Cu functiile foldl, foldr, map putem sa aplicam un operator utilizator pe o lista ?
  Da. Dar el ar trebui sa fie un operator unar. Puteti aplica si un operator binar la nevoie , in cazul cand , probabil doriti sa obtineti o lista de fu
  157 bytes (29 words) - 15:37, 10 June 2009

Page text matches

• Cu functiile foldl, foldr, map putem sa aplicam un operator utilizator pe o lista ?
  Da. Dar el ar trebui sa fie un operator unar. Puteti aplica si un operator binar la nevoie , in cazul cand , probabil doriti sa obtineti o lista de fu
  157 bytes (29 words) - 15:37, 10 June 2009
• Haskell Quiz/Numeric Maze/Solution Ninju
  data Operator = AddTwo | Double | Halve apply :: Operator -> Integer -> Integer
  1 KB (161 words) - 08:23, 27 November 2009
• La ce serveste apostroful invers (`) ?
  Apostroful invers (`) transforma o functie cu doua argumente intr-un operator infixat. Functia se poate folosi acum si ca un operator: 1 `g` 2
  1,008 bytes (147 words) - 20:38, 18 October 2009
• Unary operator
  A unary operator is an operator with one parameter. Haskell only has one built-in unary operator, namely the negation operator <hask>-</hask>.
  3 KB (397 words) - 20:54, 24 February 2024
• Function composition
  Mathematically, this is most often represented by the <math>\circ</math> operator, where <math>f\circ g</math> (often read as ''f of g'') is the composition In haskell, the type of the <hask>.</hask> operator is <math>(\beta \to \gamma) \to (\alpha \to \beta) \to \alpha \to \gamma</m
  1 KB (233 words) - 23:59, 10 October 2006
• Section of an infix operator
  ...tuitively takes an argument and puts it on the "missing" side of the infix operator. Note: as an exception, the "-" (subtraction) operator cannot do a right section, because that would be interpreted as unary negat
  2 KB (233 words) - 17:58, 31 March 2017
• 99 questions/Solutions/47
  ...ion in the more natural way, as in the example: A and (A or not B). Define operator precedence as usual; i.e. as in Java. Java operator precedence (descending) as far as I could fathom it:
  682 bytes (109 words) - 19:50, 18 January 2014
• Exista o functie cons ca in LISP ?
  Da, numai ca nu se numeste 'cons'. Si este un operator binar infixat - dar in esenta este tot o functie. Despre acest operator se spune ca ar fi provocat mari discutii in comitetul Haskell. Unii vorbito
  846 bytes (132 words) - 19:05, 10 June 2009
• Infix operators
  #redirect [[Infix operator]]
  63 bytes (8 words) - 06:47, 8 June 2023
• $
  ...s the function on its left to the value on its right. At first glance this operator appears redundant, since ordinary application <hask>(f x)</hask> means the ...askell splice and not the infix operator described above. To get the infix operator be sure to separate the $ from the right argument by at least one white spa
  1 KB (208 words) - 00:09, 1 October 2016
• Cum sa scriu impartirea numerelor intregi ?
  ...e apostrofuri inverse si cu minuscula. Primele il fac sa se comporte ca un operator infixat. Nu uitati ca numele functiilor se scriu in Haskell totdeauna cu mi ...apostrofului invers este sa transforme un nume de functie intr-un nume de operator infixat. Deci scrieti:
  2 KB (271 words) - 15:24, 13 March 2011
• De ce numim unii operatori supraincarcati ?
  Acelasi operator se foloseste la doua trei
  287 bytes (45 words) - 09:30, 8 February 2010
• Unary minus
  #REDIRECT [[Unary operator]]
  83 bytes (10 words) - 12:30, 8 June 2023
• Associative operation
  ...ession containing two or more occurrences in a row of the same associative operator, the order in which the operations are performed does not matter as long as
  358 bytes (58 words) - 13:51, 19 April 2011
• Diagrams/Dev/Migrate1.0
  === <code>&</code> operator renamed to <code>^&</code> === ...iagrams-0.7 (for constructing literal points and vectors) clashes with the operator of the same name from <code>lens</code>. Thus <code>&</code> has been rena
  2 KB (336 words) - 18:41, 18 February 2014
• Use of infix operators
  ...mail/haskell-cafe/2006-October/018884.html deriving precedences from infix operator characters]
  375 bytes (47 words) - 14:54, 19 March 2007
• DDC/DestructiveUpdate
  Values can be updated with the <hask>(:=)</hask> operator, which copies its second argument over its first. The structure of algebraic data can be modified with the <hask>(#=)</hask> operator. This replaces the constructor at a particular node with a new one.
  3 KB (430 words) - 00:46, 24 February 2018
• Cum definim asocierea si prioritatea operatorilor ?
  ...ix''' urmat de '''numarul ''' nivelului de prioritate urmat de simbolul '''operator'''ului.
  502 bytes (62 words) - 05:43, 31 May 2009
• 99 questions/Solutions/3
  This is (almost) the infix operator !! in Prelude, which is defined as: Or without using the infix operator:
  2 KB (298 words) - 02:32, 15 June 2016
• List notation
  ...n easily mix elements and lists into a list by appending the corresponding operator in each line: ...ingleton list with a [[Section of an infix operator|section]] of the colon operator: <haskell>(:[]) :: a -> [a]</haskell>.
  2 KB (312 words) - 17:33, 10 January 2014
• Cum se concateneaza elementele unei liste de liste ?
  Are si multe alte utilizari: De exemplu e folosit la scrierea acelui celebru operator >>= (citeste bind) din monada parserelor.
  512 bytes (83 words) - 19:34, 10 June 2009
• Infix operator
  Putting parentheses around an infix operator converts it into a prefix function: * [[section of an infix operator]]
  1 KB (159 words) - 23:45, 25 June 2021
• Regular expressions/Bounded space proposal
  The data for a *-operator is either Nothing or consists of a boolean flag "inOrbit" and a sequence of Initially the *-operator data is Nothing.
  8 KB (1,325 words) - 18:23, 21 February 2007
• Relative infix operator precedences
  This would force the use of parentheses in cases where the operator name designers
  1 KB (141 words) - 16:48, 9 April 2009
• Rational
  ...nstruct <hask>Rational</hask> values explicitly using the <hask>(%)</hask> operator. For example, the fraction <code>2/3</code> is constructed using <hask>2 %
  564 bytes (84 words) - 08:48, 11 May 2015
• Monada listelor
  Impreuna cu un operator <code>(>>=)</code> bine ales formeaza o monada care se poate folosi la simu
  462 bytes (69 words) - 22:35, 5 April 2021
• Monad laws
  ...ion operator <code>(>=>)</code> (also known as the ''Kleisli-composition'' operator) is defined in <code>Control.Monad</code>: Using this operator, the three laws can be expressed like this:
  5 KB (788 words) - 10:40, 1 February 2024
• Physical equality
  Haskell has only one equality operator unlike Unlike Scheme or ML, C& operator = (const C& c)
  7 KB (971 words) - 06:34, 2 April 2009
• Variable
  The operator <hask>=</hask> is used to assign a value to a variable, e.g. <hask>phi = 1.
  1 KB (173 words) - 00:15, 11 October 2006
• Polymorphism
  ...a separate definition for each of those types. For example, the <tt>+</tt> operator essentially does something entirely different when applied to floating-poin ...e, and I gain the ability to use all sorts of functions defined using that operator, e.g. checking if a value of my type is present in a list, or looking up a
  5 KB (912 words) - 00:50, 21 January 2015
• Case
  ==== infix operator ====
  3 KB (411 words) - 11:36, 11 June 2020
• Ce deosebire este intre && si and ?
  Si-ul invatat la logica, operator binar, se scrie ca in Oberon: &&.
  1,005 bytes (155 words) - 05:59, 11 February 2011
• Function
  Haskell supports a [[Function composition]] operator: ...what we need now is a function that can automatically put the composition operator between every element of <hask>map insert myList</hask>. Such code is inclu
  4 KB (739 words) - 17:28, 10 November 2011
• DDC/EvaluationOrder
  ...default, any function application may be suspended with the <hask>@</hask> operator, so long as the application does not cause visible side effects. The attemp The suspension operator <hask>@</hask> accepts a variable number of arguments. Uses of <hask>@</has
  2 KB (378 words) - 00:47, 24 February 2018
• Cum transform un numar intreg intr-un numar real ?
  '''Exercitiu:''' Definiti un operator, sa-i zicem /// pentru impartirea unui real la un intreg. Ce prioritete tre '''Indicatie:''' Prioritate 7 ca si impartirea si inmultirea. Operator infixat - adica plasat intre operanzi. Asociativitate la stanga deci se dec
  3 KB (448 words) - 17:49, 1 November 2009
• Cum definim operatorii binari ?
  Varianta: puteti folosi o functie binara obisnuita ca un operator infixat punandu-i numele intre `apostroafe inverse`.
  527 bytes (82 words) - 04:18, 14 August 2021
• Un exemplu cu operatorul de succesiune a doua calcule unde gasim ?
  Insa acest operator >>= se foloseste de fapt ascuns
  1 KB (183 words) - 09:17, 8 February 2010
• Lens
  * [http://intolerable.me/lens-operators-intro/ basic lens operator examples]
  1 KB (171 words) - 08:05, 17 November 2014
• Cum introduceti multimea perechilor de numere reale (Float,Float) in clasa Eq ?
  2. Ne gandim cum definim un operator (==) pentru perechi de valori Float. ideea este ca
  1 KB (187 words) - 12:20, 6 February 2011
• Ce deosebire este intre
  Deci: && este un operator care poate prmi doar doua (cel mult) argumente de tip Bool si calculeaza co
  1 KB (193 words) - 05:58, 11 February 2011
• Ce sunt Monad respectiv MonadPlus ?
  *Monada poate fi inzestrata uneori cu un operator "+" ba chiar si cu un "zero" caz in care structura sa algebrica va avea mai
  1 KB (187 words) - 22:38, 24 January 2008
• Ternary operator
  With a bit of work, we can define a ternary conditional operator in
  847 bytes (121 words) - 23:08, 24 July 2021
• Rodin/Examples
  expecting space, operator or ";" expecting space, operator or ";"
  30 KB (4,465 words) - 17:37, 13 March 2011
• Ce functiii are clasa Num ?
  ...ara sa listati codul clasei si al instantelor este sa intrebati la fiecare operator aritmetic ce tip are:
  1 KB (237 words) - 12:34, 6 February 2011
• Cum se scrie conjunctia, "si" de la logica ?
  <h2> '''Si''-ul invatat la logica, operator binar, se scrie ca in Oberon: &&. </h2>
  1 KB (230 words) - 06:12, 3 July 2009
• Blog articles/Parsing
  * [http://nickmudge.info/?post=56 Do Notation and Sequence Operator]
  3 KB (311 words) - 22:56, 2 April 2015
• Kind
  ...e of a type constructor or, less commonly, the type of a higher-order type operator. A kind system is essentially a simply typed lambda calculus 'one level up,
  2 KB (234 words) - 19:05, 28 September 2017
• DDC/FieldProjections
  When data types are defined using field names, we can use the projection operator <hask>(.)</hask> to select the fields. ...projection function to use. Alternatively, we can use the <hask>(&)</hask> operator to specify the projection type manually.
  3 KB (430 words) - 11:59, 19 April 2021
• Lub
  It provides a <hask>lub</hask> function that is consistent with the [[unamb]] operator but has a more liberal precondition.
  1 KB (187 words) - 21:38, 4 February 2014
• Cum sa introduc in program combinatorul Y ?
  '''Nu uitati''' ca i se mai spune ''operator de punct fix''. Si ca serveste la rezolvarea unor ecuatii functionale (acel
  2 KB (319 words) - 15:49, 13 March 2011
• Simple monad examples
  All you really need to know, is that the <code>(>>=)</code> operator either returns <code>Nothing</code> if it is passed <code>Nothing</code> on
  1 KB (188 words) - 11:16, 22 October 2022
• Amb
  ...tp://www.randomhacks.net/articles/2005/10/11/amb-operator <code>amb</code> operator] in Haskell. Interestingly, it is identical to the list monad: remove 'amb'
  3 KB (385 words) - 22:05, 17 April 2008
• Record access
  'get' as infix operator. 'modify' as infix operator.
  6 KB (1,022 words) - 13:33, 17 January 2012
• Rodin/Ro/PRodin/2009abcd
  expecting letter or digit, "_", operator or ";" expecting letter or digit, "_", operator or ";"
  16 KB (1,992 words) - 13:27, 8 March 2009
• Functional differentiation
  In functional analysis <math> D </math> is called a (linear) function operator, because it maps functions to functions.
  3 KB (357 words) - 08:32, 19 December 2010
• Cum se scrie negatia ?
  ...mpla egalitate intre numele nou si cel vechi. Atentie, daca e un simbol de operator puneti-l in paranteze, cam asa cum este pe pagina cu glume, inlocuirea lui
  1 KB (180 words) - 02:48, 9 April 2021
• Haskell Quiz/Bytecode Compiler/Solution Michael Sloan
  This implementation's only deficiancy is no handling of the negation operator. Proper handling isn't implemented in the ruby quiz tests/solns, however a
  3 KB (450 words) - 10:43, 13 January 2007
• Cn/十分钟学会 Haskell
  ** [[Operator]]s ** [[Infix operator |(+) and `foo`]]
  14 KB (1,168 words) - 07:39, 12 February 2012
• Parsing expressions and statements
  Operator precedence from high to low: <tt>~</tt>, <tt>&amp;</tt>, <tt>=</tt>. Both b ...dOp ":="</hask> checks that the next token is the <hask>:=</hask> reserved operator.
  8 KB (1,033 words) - 02:43, 21 March 2018
• Rodin/Lista de sugestii si subtilitati cunoscute
  expecting operator, space or "atat cat" s12) Nu aveam operator modulo, pina la RodinV05-Ro si RodinV05-En.
  4 KB (632 words) - 10:03, 29 January 2010
• Budapest Hackathon 2016/Projects
  ...ld 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
• New monads/MonadSplit
  "mplus" and a new decomposition operator: "msplit" such that
  4 KB (668 words) - 23:15, 17 December 2006
• MonadCont under the hood
  * The bind operator <hask>(>>=)</hask> takes a <hask>Cont</hask> object, and a ''function that Why? The code <hask>($ a)</hask> is a ''slice'' of the operator <hask>$</hask>, which represents application. In other words, <hask>($ a)</
  11 KB (1,891 words) - 23:02, 4 December 2012
• Partial application
  The important property here is that the <hask>-></hask> operator is right associative, and function application is left associative, meaning
  1 KB (248 words) - 20:05, 13 May 2020
• Parsing a simple imperative language
  > reservedOp = Token.reservedOp lexer -- parses an operator Now we have to define the lists with operator precedence, associativity and
  11 KB (1,437 words) - 00:04, 1 September 2017
• Performance/Arrays
  ...and individual elements are not mutable. In particular, the <tt>(//)</tt> operator copies the entire array, so it is rarely what you want. ([http://www.haske
  3 KB (539 words) - 10:37, 23 June 2011
• Parameter order
  using the function composition operator <hask>.</hask>. However when using [[Section of an infix operator|section]], in most cases the first argument is omitted.
  9 KB (1,413 words) - 20:10, 11 January 2013
• Nitpicks
  ...mathematical papers. Conversely <hask>::</hask> should be used as the cons operator. See https://neilmitchell.blogspot.com/2018/11/counting-cost-of-colons-in-h * The kind for inhabited types <hask>*</hask> is not an operator. See https://ghc.haskell.org/trac/ghc/wiki/DependentHaskell/Phase1#ishardto
  7 KB (1,033 words) - 01:16, 27 September 2021
• TypeDirectedNameResolution
  ...'think'' using '.' won't be too confusing (we all separate the composition operator from the functions by a space anyway, don't we?), so I'd go with that. But ...ently end up using (=<<) instead. Anyway, executive summary: TDNR yea, dot operator nay. --[[User:Illissius|Illissius]] 20:57, 7 August 2010 (UTC)
  7 KB (1,198 words) - 05:55, 10 December 2020
• 99 questions/Solutions/49
  ...t the algorithm just crawls one time over the input-list and uses the (++) operator in a way that it just has a running time of O(1).
  2 KB (298 words) - 03:02, 7 June 2021
• Zipper monad/TravelBTree
  ...ask> goes down to the first child. This is consistent with the list-access operator, <hask>(!!)</hask>.
  3 KB (559 words) - 03:51, 8 October 2006
• 99 questions/Solutions/6
  Using Control.Arrows (&&&) fan out operator.
  2 KB (320 words) - 00:08, 8 July 2019
• Diagrams/Dev/Migrate0.7
  ...es</code> module (which contains, among other things, the <code>(&)</code> operator for constructing literal points and vectors) is no longer exported from <co
  2 KB (297 words) - 06:13, 3 August 2013
• 10分で学ぶHaskell
  ** [[Operator]]s ** [[Infix operator |(+) and `foo`]]
  17 KB (1,020 words) - 07:22, 9 June 2023
• Anonymous function
  using a [[Section of an infix operator|section]], in [[pointfree]] style:
  2 KB (296 words) - 06:56, 12 April 2021
• Integers too big for floats
  the <hask>%</hask> operator will cancel the fraction precisely.
  4 KB (652 words) - 02:04, 7 February 2009
• Unamb
  '''unamb''' is a package containing the ''unambiguous choice'' operator <hask>unamb</hask>, which wraps thread racing up in a purely functional, se
  2 KB (356 words) - 21:36, 4 February 2014
• Memoization
  === Memoizing fix point operator === ...will use ordinary function composition <code>(.)</code> and the fix point operator <code>fix</code> (cf. <code>Data.Function</code>):
  12 KB (1,702 words) - 16:05, 28 April 2014
• Mathematical prelude discussion
  ...here could be a uniform treatment of linear algebra, polynomial equations, operator algebra, etc.''
  2 KB (310 words) - 06:04, 10 December 2020
• Jmacro
  JMacro has an infix application operator, and a reversed infix application operator. <hask>foo <| bar <| baz</hask> desugars to <hask>foo(bar(baz))</hask>. Mea
  8 KB (1,206 words) - 23:52, 29 July 2011
• Pronunciation
  ...n can be quite brief and a link provided to the relevant wiki page for the operator.
  3 KB (532 words) - 23:05, 24 July 2021
• The Monad.Reader/Issue5/Software Testing With Haskell
  -- this operator ==>
  4 KB (683 words) - 03:10, 10 May 2008
• The Monad.Reader/Issue5/Different Language
  ...standard input as a string. getContents is an IO action, so we use the <- operator to cause c to represent the result of evaluating the action. The period is a function composition operator. In general terms, where f and g are functions, (f . g) x means the same as
  19 KB (3,237 words) - 01:33, 10 May 2008
• 99 questions/Solutions/17
  Or (ab)using the "&&&" arrow operator for tuples:
  3 KB (452 words) - 21:07, 10 March 2019
• Reactive
  ...ues are implemented on top of a semantically simple ''unambiguous choice'' operator, [[unamb]]. Although unamb is built on [[GHC/Concurrency|Concurrent Haskel
  4 KB (524 words) - 10:39, 17 July 2011
• Pointfree
  ...onception is that the 'points' of pointfree style are the <hask>(.)</hask> operator (function composition, as an ASCII symbol), which uses the same identifier <hask>(.)</hask> operator.
  10 KB (1,782 words) - 14:44, 5 June 2011
• If-then-else
  ...lly, Church booleans can be represented compactly by [[Section of an infix operator|sectioning]] on (?), i.e. <hask>(True?) = const; (False?) = flip const</has
  6 KB (937 words) - 05:34, 10 December 2020
• Keywords
  This operator token is magic/irregular in the sense that ...tor [[Section of an infix operator|section]], as it would be for any other operator:
  22 KB (3,350 words) - 04:31, 8 June 2023
• 99 questions/Solutions/10
  Or (ab)using the "&&&" arrow operator for tuples:
  3 KB (470 words) - 03:45, 19 May 2021
• Es/Teoría de Categorías y Programación Funcional @ Stanford: Clase 1
  ...to a path, you'll get nonsense, and so any statement about the composition operator has an implicit "whenever defined" attached to it. The definition is not quite done yet - this composition operator, and the identity arrows both have a few rules to fulfill, and before I sta
  21 KB (3,823 words) - 14:25, 4 August 2011
• Accessible layout proposal
  ...> in EBNF. It is important to realise that <code>#$</code> above is not an operator: it's part of the grammar itself, and should be thought of as a syntactic s
  5 KB (774 words) - 02:11, 5 February 2007
• Haskell Quiz/Dice Roller/Solution Abhinav
  import Text.Parsec.Expr (Assoc(..), Operator(..), buildExpressionParser)
  4 KB (618 words) - 14:33, 26 October 2012
• Web/Literature/Practical web programming in Haskell
  The <code><<</code> operator is used for nesting HTML. Attributes are added to tags using the <code>!</code> operator.
  16 KB (2,503 words) - 14:59, 6 June 2011
• Power function
  ...astically complicate type inference. In some other languages such as C++, operator overloading is used to work around this problem, but [https://stackoverflow
  4 KB (574 words) - 21:34, 10 March 2016
• Import modules properly
  ...the origin of <hask>printf</hask> according to its name, but for the infix operator <hask><|></hask> you will certainly have no idea.
  5 KB (816 words) - 08:28, 2 May 2015
• Diagrams/Dev/Migrate1.3
  ...</code> has moved to <code>(.&gt;&gt;)</code> to make room for lens's snoc operator <code>(|&gt;)</code> (which now works on <code>Line</code>s).
  11 KB (1,707 words) - 01:06, 1 May 2015
• Regular expressions for XML Schema
  and ''Alt'' the choice operator. can be added just by adding the operator to the ''Regex'' data type, add a rule for ''delta'' with
  22 KB (3,425 words) - 22:34, 29 June 2021
• Research area
  * it did not use a fixpoint operator !!
  6 KB (867 words) - 08:50, 26 July 2011
• Currying
  * [[Section of an infix operator]]
  4 KB (669 words) - 02:17, 3 November 2023
• Prelude extensions
  ...s which allows us to process both pairs and non-empty lists using the same operator:
  4 KB (684 words) - 02:22, 18 May 2020

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