CINXE.COM

<!DOCTYPE html PUBLIC "-//WAPFORUM//DTD XHTML Mobile 1.0//EN" "http://www.wapforum.org/DTD/xhtml-mobile10.dtd"><html xmlns="http://www.w3.org/1999/xhtml" lang="en-SG"><head><meta content="application/xhtml+xml; charset=UTF-8" http-equiv="Content-Type"/><meta content="no-cache" name="Cache-Control"/><title>define:Recursive Functional Algorithmic Language - Google Search</title><style>a{text-decoration:none;color:inherit}a:hover{text-decoration:underline}a img{border:0}body{font-family:arial,sans-serif;padding:8px;margin:0 auto;max-width:700px;min-width:240px;}.FbhRzb{border-left:thin solid #dadce0;border-right:thin solid #dadce0;border-top:thin solid #dadce0;height:40px;overflow:hidden}.n692Zd{margin-bottom:10px}.cvifge{height:40px;border-spacing:0}.QvGUP{height:40px;padding:0 8px 0 8px;vertical-align:top}.O4cRJf{height:40px;width:100%;padding:0;padding-right:16px}.O1ePr{height:40px;padding:0;vertical-align:top}.kgJEQe{height:36px;width:98px;vertical-align:top;margin-top:4px}.lXLRf{vertical-align:top}.MhzMZd{border:0;vertical-align:middle;font-size:14px;height:40px;padding:0;width:100%;padding-left:16px}.xB0fq{height:40px;border:none;font-size:14px;background-color:#1a73e8;color:#fff;padding:0 16px;margin:0;vertical-align:top;cursor:pointer}.xB0fq:focus{border:1px solid #1a73e8}.M7pB2{border:thin solid #dadce0;margin:0 0 3px 0;font-size:13px;font-weight:500;height:40px}.euZec{width:100%;height:40px;text-align:center;border-spacing:0}table.euZec td{padding:0;width:25%}.QIqI7{display:inline-block;padding-top:4px;font-weight:bold;color:#4285f4}.EY24We{border-bottom:2px solid #4285f4}.CsQyDc{display:inline-block;color:#70757a}.TuS8Ad{font-size:14px}.HddGcc{padding:8px;color:#70757a}.dzp8ae{font-weight:bold;color:#3c4043}.rEM8G{color:#70757a}.bookcf{table-layout:fixed;width:100%;border-spacing:0}.InWNIe{text-align:center}.uZgmoc{border:thin solid #dadce0;color:#70757a;font-size:14px;text-align:center;table-layout:fixed;width:100%}.frGj1b{display:block;padding:12px 0 12px 0;width:100%}.BnJWBc{text-align:center;padding:6px 0 13px 0;height:35px}</style></head><body><style>.ezO2md{border:thin solid #dadce0;padding:12px 16px 12px 16px;margin-bottom:10px;font-family:arial,sans-serif}.lIMUZd{font-family:arial,sans-serif}.Dks9wf{width:100%}.KZhhub{border-spacing:0;width:100%}.udTCfd{vertical-align:top;width:100%}.fYyStc{word-break:break-word}.ynsChf{display:block;white-space:nowrap;overflow:hidden;text-overflow:ellipsis}.Fj3V3b{color:#1967d2;font-size:14px;line-height:20px}.FrIlee{color:#202124;font-size:13px;line-height:20px}.F9iS2e{color:#70757a;font-size:13px;line-height:20px}.WMQ2Le{color:#70757a;font-size:12px;line-height:16px}.x3G5ab{color:#202124;font-size:18px;line-height:24px}.fuLhoc{color:#1967d2;font-size:18px;line-height:24px}.epoveb{font-size:32px;line-height:40px;font-weight:400;color:#202124}.dXDvrc{color:#0d652d;font-size:14px;line-height:20px;word-wrap:break-word}.dloBPe{font-weight:bold}.YVIcad{color:#70757a}.JkVVdd{color:#ea4335}.oXZRFd{color:#ea4335}.MQHtg{color:#fbbc04}.pyMRrb{color:#1e8e3e}.EtTZid{color:#1e8e3e}.M3vVJe{color:#1967d2}.qXLe6d{display:block}.NHQNef{font-style:italic}.Cb8Z7c{white-space:pre}a.ZWRArf{text-decoration:none}a .CVA68e:hover{text-decoration:underline}.gNEi4d{table-layout:fixed}.Y0aAmf{text-align:center}.iUhyd{vertical-align:bottom}.CO79Sb{position:relative}.WQbFld{bottom:0;left:0;margin:auto;position:absolute;right:0;top:0;background-image:url(https://www.gstatic.com/search_trustx/visibility_off_icon_p0-7d897bf44bafe5436baa9009e8716337.png);background-repeat:no-repeat;background-position:center;background-size:20px}.CSfvHb{padding-bottom:8px}.GN4D8d{margin:0}</style><div class="n692Zd"><div class="BnJWBc"><a class="lXLRf" href="/?sa=X&sca_esv=e1e3193eddeaa204&output=search&tbm=bks&ved=0ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0QPAgC"><img class="kgJEQe" src="/images/branding/searchlogo/1x/googlelogo_desk_heirloom_color_150x55dp.gif" alt="Google"/></a></div><div class="FbhRzb"><form action="/search"><input name="sca_esv" value="e1e3193eddeaa204" type="hidden"/><input name="tbm" value="bks" type="hidden"/><input name="oq" type="hidden"/><input name="aqs" type="hidden"/><table class="cvifge"><tr><td class="O4cRJf"><input class="MhzMZd" value="define:Recursive Functional Algorithmic Language" name="q" type="text"/></td><td class="O1ePr"><input class="xB0fq" value="Search" type="submit"/></td></tr></table></form></div><div class="M7pB2"><table class="euZec"><tbody><tr><td><a class="CsQyDc" href="/search?q=define:Recursive+Functional+Algorithmic+Language&sca_esv=e1e3193eddeaa204&source=lnms&sa=X&ved=0ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q_AUIBCgA">ALL</a></td><td><a class="CsQyDc" href="/search?q=define:Recursive+Functional+Algorithmic+Language&sca_esv=e1e3193eddeaa204&tbm=isch&source=lnms&sa=X&ved=0ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q_AUIBSgB">IMAGES</a></td><td class="EY24We"><span class="QIqI7">BOOKS</span></td><td><a class="CsQyDc" href="/search?q=define:Recursive+Functional+Algorithmic+Language&sca_esv=e1e3193eddeaa204&tbm=vid&source=lnms&sa=X&ved=0ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q_AUIBygD">VIDEOS</a></td></tr></tbody></table></div></div><div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="https://books.google.com.sg/books?id=u1luCQAAQBAJ&pg=PA29&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6AF6BAgCEAE"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Implementation of Functional Languages: 11th International ...</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">books.google.com.sg › books</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td><div><a href="https://books.google.com.sg/books?id=u1luCQAAQBAJ&pg=PA29&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6wF6BAgCEAI"><table class="gNEi4d"><tbody><tr><td style="width:52px"> <div class="CO79Sb"> <img class="iUhyd" alt="define:Recursive Functional Algorithmic Language from books.google.com.sg" src="https://encrypted.google.com/books?id=u1luCQAAQBAJ&printsec=frontcover&img=1&zoom=5&edge=curl&h=80&w=52" style="width:52px;height:80px"/> </div> </td></tr></tbody></table></a></div></td><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc">... Recursively Defined Functions In all previous examples recursion was hidden by foldr . For recursive definitions we have to slightly modify the list abstraction algorithm . Consider the recursively defined function enumFrom which ...</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="https://books.google.com.sg/books?id=SWds5v8UUc4C&pg=PA199&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6AF6BAgJEAE"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Discrete Algorithmic Mathematics, Third Edition</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">books.google.com.sg › books</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td><div><a href="https://books.google.com.sg/books?id=SWds5v8UUc4C&pg=PA199&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6wF6BAgJEAI"><table class="gNEi4d"><tbody><tr><td style="width:60px"> <div class="CO79Sb"> <img class="iUhyd" alt="define:Recursive Functional Algorithmic Language from books.google.com.sg" src="https://encrypted.google.com/books?id=SWds5v8UUc4C&printsec=frontcover&img=1&zoom=5&edge=curl&h=72&w=60" style="width:60px;height:72px"/> </div> </td></tr></tbody></table></a></div></td><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc">... recursive definition of n ! using n and n + 1 instead of n - 1 and n . Let n = O be the basis case . 2. ( 1 ) Write n ! as a recursive function f ( n ) in our algorithmic language . Let n = O be the basis case . 3. ( 1 ) Using our ...</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="https://books.google.com.sg/books?id=Tnwr-4Wz6lIC&pg=PA100&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6AF6BAgDEAE"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Implementation of Functional Languages: 15th International ...</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">books.google.com.sg › books</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td><div><a href="https://books.google.com.sg/books?id=Tnwr-4Wz6lIC&pg=PA100&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6wF6BAgDEAI"><table class="gNEi4d"><tbody><tr><td style="width:52px"> <div class="CO79Sb"> <img class="iUhyd" alt="define:Recursive Functional Algorithmic Language from books.google.com.sg" src="https://encrypted.google.com/books?id=Tnwr-4Wz6lIC&printsec=frontcover&img=1&zoom=5&edge=curl&h=80&w=52" style="width:52px;height:80px"/> </div> </td></tr></tbody></table></a></div></td><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc">... algorithm to es- timate sizes and costs for a simple functional language with recursive , higher- order and ... defined recursive structures . This will ultimately allow us to address real languages such as our resource - bounded ...</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="https://books.google.com.sg/books?id=Z98mAAAAMAAJ&q=define:Recursive+Functional+Algorithmic+Language&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6AF6BAgFEAE"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Algorithmic Languages: Proceedings of the International ...</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">books.google.com.sg › books</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td><div><a href="https://books.google.com.sg/books?id=Z98mAAAAMAAJ&q=define:Recursive+Functional+Algorithmic+Language&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6wF6BAgFEAI"><table class="gNEi4d"><tbody><tr><td style="width:52px"> <div class="CO79Sb"> <img class="iUhyd" alt="define:Recursive Functional Algorithmic Language from books.google.com.sg" src="https://encrypted.google.com/books?id=Z98mAAAAMAAJ&printsec=frontcover&img=1&zoom=5&h=80&w=52" style="width:52px;height:80px"/> </div> </td></tr></tbody></table></a></div></td><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc">... function name # program # equation # function name program The first parameter names the function for which an iterative version is required . The third is the equation defining the iterative form implicitly in terms of the recursive ...</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="https://books.google.com.sg/books?id=-mMOEQAAQBAJ&pg=PA352&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6AF6BAgGEAE"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Introduction To The Theory Of Formal Languages</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">books.google.com.sg › books</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td><div><a href="https://books.google.com.sg/books?id=-mMOEQAAQBAJ&pg=PA352&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6wF6BAgGEAI"><table class="gNEi4d"><tbody><tr><td style="width:54px"> <div class="CO79Sb"> <img class="iUhyd" alt="define:Recursive Functional Algorithmic Language from books.google.com.sg" src="https://encrypted.google.com/books?id=-mMOEQAAQBAJ&printsec=frontcover&img=1&zoom=5&edge=curl&h=80&w=54" style="width:54px;height:80px"/> </div> </td></tr></tbody></table></a></div></td><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc">... recursive . This is useful for proving that the language LMA ̧ of all lMas over the alphabet B is also a primitive ... define a primitive recursive function alg ( for algorithm ) on the alphabet B such that for every IMa A there is ...</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="https://books.google.com.sg/books?id=ciYRBwAAQBAJ&pg=PA12&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6AF6BAgEEAE"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Implementation and Application of Functional Languages: 17th ...</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">books.google.com.sg › books</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td><div><a href="https://books.google.com.sg/books?id=ciYRBwAAQBAJ&pg=PA12&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6wF6BAgEEAI"><table class="gNEi4d"><tbody><tr><td style="width:52px"> <div class="CO79Sb"> <img class="iUhyd" alt="define:Recursive Functional Algorithmic Language from books.google.com.sg" src="https://encrypted.google.com/books?id=ciYRBwAAQBAJ&printsec=frontcover&img=1&zoom=5&edge=curl&h=80&w=52" style="width:52px;height:80px"/> </div> </td></tr></tbody></table></a></div></td><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc">... function definition , in the sense that the intermediate data structure should model its recursion tree . An algorithm that derives such hylomorphisms from explicitly recursive definitions has been pro- posed [ 9 ] . In the present ...</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="https://books.google.com.sg/books?id=wH3oDwAAQBAJ&pg=PA35&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6AF6BAgHEAE"><span class="CVA68e qXLe6d fuLhoc ZWRArf">7 Algorithm Design Paradigms</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">books.google.com.sg › books</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td><div><a href="https://books.google.com.sg/books?id=wH3oDwAAQBAJ&pg=PA35&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6wF6BAgHEAI"><table class="gNEi4d"><tbody><tr><td style="width:56px"> <div class="CO79Sb"> <img class="iUhyd" alt="define:Recursive Functional Algorithmic Language from books.google.com.sg" src="https://encrypted.google.com/books?id=wH3oDwAAQBAJ&printsec=frontcover&img=1&zoom=5&edge=curl&h=80&w=56" style="width:56px;height:80px"/> </div> </td></tr></tbody></table></a></div></td><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc">... Recursive. Programming. A function is conventionally written with two parts separated by an equal sign. The left side of a function equation contains the function name followed by parentheses contain- ing an ordered list of input ...</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="https://books.google.com.sg/books?id=pGrD8NtyR_EC&pg=PA77&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6AF6BAgIEAE"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Logics of Specification Languages</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">books.google.com.sg › books</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td><div><a href="https://books.google.com.sg/books?id=pGrD8NtyR_EC&pg=PA77&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6wF6BAgIEAI"><table class="gNEi4d"><tbody><tr><td style="width:50px"> <div class="CO79Sb"> <img class="iUhyd" alt="define:Recursive Functional Algorithmic Language from books.google.com.sg" src="https://encrypted.google.com/books?id=pGrD8NtyR_EC&printsec=frontcover&img=1&zoom=5&edge=curl&h=80&w=50" style="width:50px;height:80px"/> </div> </td></tr></tbody></table></a></div></td><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc">... define a general framework for stating the development of functions defined by primitive recursion using predicate diagrams. Modelling the Computation of a Primitive Recursive Function The first The event-B Modelling Method 77.</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="https://books.google.com.sg/books?id=oH9QAAAAMAAJ&q=define:Recursive+Functional+Algorithmic+Language&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6AF6BAgBEAE"><span class="CVA68e qXLe6d fuLhoc ZWRArf">Thinking Recursively</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">books.google.com.sg › books</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td><div><a href="https://books.google.com.sg/books?id=oH9QAAAAMAAJ&q=define:Recursive+Functional+Algorithmic+Language&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6wF6BAgBEAI"><table class="gNEi4d"><tbody><tr><td style="width:53px"> <div class="CO79Sb"> <img class="iUhyd" alt="define:Recursive Functional Algorithmic Language from books.google.com.sg" src="https://encrypted.google.com/books?id=oH9QAAAAMAAJ&printsec=frontcover&img=1&zoom=5&h=80&w=53" style="width:53px;height:80px"/> </div> </td></tr></tbody></table></a></div></td><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc">Concentrating on the practical value of recursion. this text, the first of its kind, is essential to computer science students’ education. In this text, students will learn the concept and programming applications of recursive thinking.</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div><div> <div> <div class="ezO2md"><div><div><a class="fuLhoc ZWRArf" href="https://books.google.com.sg/books?id=PahcDwAAQBAJ&printsec=frontcover&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6AF6BAgAEAE"><span class="CVA68e qXLe6d fuLhoc ZWRArf">How to Design Programs, second edition: An Introduction to ...</span> <span class="qXLe6d dXDvrc"> <span class="fYyStc">books.google.com.sg › books</span> </span> </a></div><div class="Dks9wf"><table class="KZhhub"><tr><td><div><a href="https://books.google.com.sg/books?id=PahcDwAAQBAJ&printsec=frontcover&dq=define:Recursive+Functional+Algorithmic+Language&hl=en&sa=X&ved=2ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Q6wF6BAgAEAI"><table class="gNEi4d"><tbody><tr><td style="width:60px"> <div class="CO79Sb"> <img class="iUhyd" alt="define:Recursive Functional Algorithmic Language from books.google.com.sg" src="https://encrypted.google.com/books?id=PahcDwAAQBAJ&printsec=frontcover&img=1&zoom=5&edge=curl&h=71&w=60" style="width:60px;height:71px"/> </div> </td></tr></tbody></table></a></div></td><td class="udTCfd"><div> <div> <span class="qXLe6d FrIlee"> <span class="fYyStc">The environment grows with readers as they master the material in the book until it supports a full-fledged language for the whole spectrum of programming tasks. This second edition has been completely revised.</span> </span> </div> </div></td></tr></table></div></div></div> </div> </div></div><table class="uZgmoc"><tbody><td><a class="frGj1b" href="/search?q=define:Recursive+Functional+Algorithmic+Language&sca_esv=e1e3193eddeaa204&tbm=bks&ei=FyVjZ8GrM-Oc4-EPjqDQ6Qk&start=10&sa=N">Next ></a></td></tbody></table><br/><div class="TuS8Ad" data-ved="0ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0QpyoIMQ"><style>.VYM29{font-weight:bold}</style><div class="HddGcc" align="center"><span class="VYM29">Singapore</span><span> - </span><span>From your IP address</span><span> - </span><a href="/url?q=https://support.google.com/websearch%3Fp%3Dws_settings_location%26hl%3Den-SG&opi=89978449&sa=U&ved=0ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Qty4IMg&usg=AOvVaw04kiYnNQ7csu44tq3ylo8R">Learn more</a></div><div align="center"><a class="rEM8G" href="/url?q=https://accounts.google.com/ServiceLogin%3Fcontinue%3Dhttps://www.google.com/search%253Fq%253Ddefine:Recursive%252BFunctional%252BAlgorithmic%252BLanguage%2526sca_esv%253De1e3193eddeaa204%2526tbm%253Dbks%2526source%253Dlnms%2526sa%253DX%2526ved%253D0ahUKEwi-xu_Y77CKAxVONzQIHcjEFkAQ_AUIBigC%26hl%3Den&opi=89978449&sa=U&ved=0ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Qxs8CCDM&usg=AOvVaw1cS5-B211JEk3R4G_zrehf">Sign in</a></div><div><table class="bookcf"><tbody class="InWNIe"><tr><td><a class="rEM8G" href="https://www.google.com/preferences?hl=en&sa=X&ved=0ahUKEwiBk_ylibKKAxVjzjgGHQ4QNJ0Qv5YECDQ">Settings</a></td><td><a class="rEM8G" href="https://www.google.com/intl/en_sg/policies/privacy/">Privacy</a></td><td><a class="rEM8G" href="https://www.google.com/intl/en_sg/policies/terms/">Terms</a></td></tr></tbody></table></div></div><div> </div></body></html>