Search results

Page title matches

Talk:IO Semantics
I don't understand in what sense this IO definition is a "semantics". [[User:Conal|Conal]] 04:49, 12 December 2008 (UTC) Maybe so. Thanks. For a semantics, I think I'd want a lot more equalities than the representation by itself p

1 KB (179 words) - 04:22, 19 February 2010
IO Semantics
* 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 <code>IO a</code>; your actual implementation may vary.

11 KB (1,628 words) - 10:36, 5 April 2024
Strict semantics
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
Talk:Non-strict semantics
...nate successfully, precisely because || has non-strict ("short-circuited") semantics in C.

259 bytes (40 words) - 18:02, 28 November 2011
LGtk/Semantics
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
User talk:Benmachine/Non-strict semantics

2 KB (232 words) - 17:07, 7 May 2012
Non-strict semantics
...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
User:Benmachine/Non-strict semantics
#REDIRECT [[Non-strict semantics]]

34 bytes (3 words) - 21:29, 14 September 2013

Page text matches

...ems. From the lazy evaluation, from the semantics, from the GHC , from the semantics implementation ? ? Anyway, please do not try to use a ”pentru” (en. for

(337 KB) - 23:42, 10 October 2008

Diagrams/Migrate0.5
== 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
Strict semantics
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
User:Benmachine/Non-strict semantics
#REDIRECT [[Non-strict semantics]]

34 bytes (3 words) - 21:29, 14 September 2013
Simonpj/Talk:LwConc
...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 eff

3 KB (497 words) - 19:06, 11 February 2008
Talk:IO Semantics
I don't understand in what sense this IO definition is a "semantics". [[User:Conal|Conal]] 04:49, 12 December 2008 (UTC) Maybe so. Thanks. For a semantics, I think I'd want a lot more equalities than the representation by itself p

1 KB (179 words) - 04:22, 19 February 2010
Talk:Non-strict semantics
...nate successfully, precisely because || has non-strict ("short-circuited") semantics in C.

259 bytes (40 words) - 18:02, 28 November 2011
Eager evaluation
'''Eager evaluation''' is an implementation of the [[strict semantics]] as can be found in [[OCaml]] and usually in [[imperative language]]s. A k

207 bytes (30 words) - 08:26, 29 November 2007
Backpack
...lthough Backpack is geared toward integration into Haskell, its design and semantics are largely agnostic with respect to the details of the underlying core lan

2 KB (285 words) - 13:42, 16 March 2018
Lazy evaluation
...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
Category:Syntax
Some people argue that syntax is less important than semantics.

26 members (0 subcategories, 0 files) - 09:49, 13 January 2007
PPT in ENgleza
 [http://csg.csail.mit.edu/6.827/handouts/L19-BS5-Semantics.pdf] L19-BS5-Semantics.pdf 28-Nov-2006 11:14 144K ...br>[http://csg.csail.mit.edu/6.827/handouts/L19-BS5-Semantics.ppt] L19-BS5-Semantics.ppt 28-Nov-2006 11:12 0 

5 KB (746 words) - 16:08, 13 March 2011
Talk:MonadPlus reform proposal
Parsec already has operators <tt>(<|>)</tt> and <tt>choice</tt> with fitting semantics. Simply calling <tt>morelse (<|>)</tt> and <tt>mchoice choice</tt> might b

517 bytes (82 words) - 12:17, 20 January 2006
Talk:Git
...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
User:DekuDekuplex
Interests: Virtual worlds, formal semantics of programming languages, programming language theory, algorithms

615 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

User:Benmachine
...ki.haskell.org/index.php?title=Non-strict_semantics&oldid=63164 Non-strict semantics]

961 bytes (127 words) - 14:45, 15 December 2019
Lazy vs. non-strict
...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) - 23:33, 5 April 2021
Wadler's Law
0. Semantics Semantics,

4 KB (583 words) - 10:26, 26 December 2017
User:Zzo38/Proposal for more-notation
==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
Talk:Package versioning policy
How about describing the semantics of versions in the following way?

2 KB (258 words) - 19:08, 5 January 2012
HaskellImplementorsWorkshop/2012/deVries
* A precise semantics of message passing and reliability guarantees, with special attention to re

1 KB (203 words) - 13:43, 17 December 2012
Talk:Books
...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
Reactive
..., 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, requiring

4 KB (524 words) - 10:39, 17 July 2011
HaRe
...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 refactoring

4 KB (645 words) - 12:53, 4 August 2014
Language and library specification
:Core language operational semantics in Twelf. :A space semantics for the core language. Adam Bakewell. Proc. 2000 Haskell Workshop. Septembe

7 KB (1,054 words) - 07:37, 12 June 2023
Infinity and efficiency
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
WikipediaArticleDesign
3.8 Semantics * Static semantics

3 KB (332 words) - 03:38, 14 August 2021
Obfuscation
very confusing. Finally, Haskell's clean semantics makes refactoring

3 KB (208 words) - 18:50, 17 May 2008
LGtk
* [[LGtk/Semantics]]

1 KB (194 words) - 21:08, 22 July 2023
Opting for oracles
...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.u

6 KB (809 words) - 07:56, 12 June 2023
User:Thsutton/Teaching
I'm also going to see if I can work out a way to make PL semantics accessible to high school students, probably as an challenging project for

2 KB (280 words) - 14:50, 13 June 2006
GHC/CloudAndHPCHaskell/Transport
...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
...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
Old-reactive
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
HaskellImplementorsWorkshop/2013/Yang
has for discussing time and space usage: the cost semantics for profiling.

1,004 bytes (152 words) - 06:35, 16 September 2013
Cloud Haskell
...connect and reconnect, and a more precisely defined semantics (see section Semantics, below) == Semantics ==

12 KB (1,725 words) - 07:44, 10 August 2022
Physical equality
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
Research area
...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
IO Semantics
* 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 <code>IO a</code>; your actual implementation may vary.

11 KB (1,628 words) - 10:36, 5 April 2024
Reactive-banana
...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
Weak head normal form
...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 (253 words) - 22:16, 5 April 2021
Correctness of short cut fusion
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
LGtk/ADT lenses
...'</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
Open research problems
* By "purely functional" we mean a language that has value semantics; that is, there is no function such that after evaluation of the function t

1 KB (200 words) - 12:50, 31 May 2022
Functional Reactive Programming
...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 F

11 KB (1,615 words) - 05:58, 7 November 2022
HXQ
...imization rules; all others cause a compilation error. Finally, the XQuery semantics requires duplicate elimination and sorting by document order for every XPat

2 KB (389 words) - 12:16, 18 August 2008
Error
Since Haskell is [[non-strict semantics|non-strict]], the occurence of an error within an expression is not necessa

2 KB (296 words) - 15:56, 7 August 2022
Regular expressions/Bounded space proposal
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
Newtype
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 expressi

6 KB (1,007 words) - 15:57, 22 May 2016
Nitpicks
== Semantics-related nitpicks ==

7 KB (1,033 words) - 01:16, 27 September 2021
Lucid
...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
Diagrams/Dev/Freezing
== 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 transformat

10 KB (1,576 words) - 22:57, 30 November 2013
Laziness is not always good
This is in many cases the best semantics and the most efficient implementation.

2 KB (342 words) - 09:27, 9 June 2023
Applications and libraries/Linguistics
...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,211 words) - 16:44, 1 August 2021
Humor/Flakes
Try Haskell. Haskell's lazy semantics are simpler to reason with than ML's.

4 KB (703 words) - 06:43, 24 January 2006
Playing by the rules
'''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
Diagrams/Dev
* [[/Fixpoint|Fixpoint semantics]]

3 KB (338 words) - 19:39, 16 October 2016
Syntactic sugar
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
GHC/Data Parallel Haskell/References
...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
Thread-local storage
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
BayHac2017/Clash
...functional hardware description language that borrows both its syntax and semantics from the functional programming language Haskell. It provides a familiar st

3 KB (503 words) - 18:18, 4 April 2017
New monads/MonadAdvSTM
...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 and

24 KB (3,463 words) - 05:20, 12 July 2021
Vim
...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 V

4 KB (508 words) - 22:01, 20 November 2022
The Monad.Reader/Issue2/EternalCompatibilityInTheory
...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
Attribute grammar
...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
LGtk/Semantics
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
Performance/Strictness
...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,162 words) - 17:16, 8 June 2022
Thunk
It is used in Haskell systems that implement [[non-strict semantics]] by [[lazy evaluation]].

3 KB (450 words) - 20:07, 19 October 2020
Research papers/Monads and arrows
...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
Programare functionala
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
GHC/Data Parallel Haskell/Package NDP
...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
APL
This implementation of the above API is intended to give its semantics.

7 KB (1,192 words) - 06:36, 29 June 2012
Haiku
Haskell semantics 

4 KB (621 words) - 05:56, 26 April 2021
Libraries and tools/Linguistics/Applicative universal grammar
: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
Denotative programming timeline
*:"Denotational semantics and its foundations provide an extremely helpful mathematical understanding

4 KB (506 words) - 06:17, 20 April 2024
Ministg
...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 avoid

15 KB (2,396 words) - 07:19, 10 August 2022
Humor/Enron
semantics specifically geared to the domain of the application. Much

5 KB (796 words) - 20:31, 25 January 2006
GHC/Typed holes
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 anything with it. In the domain of Haskell semantics, this expression is in fact equivalent to <tt>undefined</tt> as well, becau

9 KB (1,711 words) - 20:19, 31 August 2014
Research papers/Type systems
==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
User:Michiexile/SU09 Lecture 2
...h arrows - apply to more familiar situations. And we'll talk about how the semantics of some of the more wellknown ideas in mathematics are captured by these no

8 KB (1,285 words) - 22:54, 22 September 2009
Budapest Hackathon 2016/Projects
...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
Maintaining laziness
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
Research papers/Parallelism and concurrency
...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
Contstuff
...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 a

12 KB (2,067 words) - 05:43, 9 March 2021
Parallel/Glossary
...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
List function suggestions
...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
MaxBolingbroke/Talk:TypesAreCallingConventions
Then, in the definition of the operational semantics, the ENTER rule is:

8 KB (1,253 words) - 21:53, 12 June 2009
The Monad.Reader/Issue4/Solving Sudoku
...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 f

18 KB (2,751 words) - 00:55, 10 May 2008
Diagrams/Dev/Migrate1.2
...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
O mica introducere in Haskell 98
...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 l

6 KB (919 words) - 14:03, 7 September 2011
Referential transparency
[9] There is some debate about whether the imprecisely-defined semantics of <code>Int</code> breaks referential transparency. For instance, <code>ev

5 KB (774 words) - 10:59, 15 August 2023
Applications and libraries/Compilers and interpreters
...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
Parallel GHC Project
...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
Applications and libraries/Generic programming/Strafunski
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, reasoning

7 KB (931 words) - 03:51, 10 December 2011
Research papers/Compilation
...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
The JavaScript Problem
...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 Hask

11 KB (1,601 words) - 18:02, 26 October 2020
Haskell Lisp
* [https://axellang.github.io/ Axel] - Haskell's semantics, plus Lisp's macros; a purely functional, extensible, and powerful programm

5 KB (799 words) - 16:55, 23 March 2021
Haskell in practice
...'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,263 words) - 06:31, 10 August 2022
Concurrency demos/Graceful exit
are combined by `orElse` which gives the semantics one wants: on each

8 KB (1,050 words) - 06:19, 21 February 2010

Search results

Page title matches

Page text matches

Navigation menu

Search