{"id":2580,"date":"2021-10-17T17:54:33","date_gmt":"2021-10-17T12:24:33","guid":{"rendered":"https:\/\/www.rangakrish.com\/?p=2580"},"modified":"2021-10-17T17:54:33","modified_gmt":"2021-10-17T12:24:33","slug":"some-interesting-features-of-newlisp","status":"publish","type":"post","link":"https:\/\/www.rangakrish.com\/index.php\/2021\/10\/17\/some-interesting-features-of-newlisp\/","title":{"rendered":"Some Interesting Features of “newLisp”"},"content":{"rendered":"

newLisp <\/strong><\/em><\/a>is a general-purpose scripting language with a Lisp<\/strong><\/em>-like syntax. That is one of the reasons I wanted to take a closer look at the language. It has a compact footprint, small resource requirements, and can easily be embedded. It is available on multiple platforms, and on my Windows machine, the installation has just two files: newlisp.exe<\/strong> <\/em>and newlisp.dll<\/strong><\/em><\/p>\n

newLisp<\/strong><\/em> boasts of many interesting features, and I hope to explore them gradually. In today’s article, let me touch upon two of them.<\/p>\n

Random Expression Evaluation<\/h3>\n

The function “amb”<\/strong><\/em> takes one or more arguments, selects one of the arguments at random, evaluates it, and returns that as its result\/value.<\/p>\n

\""amb"<\/a>
“amb” Function<\/strong><\/figcaption><\/figure>\n

Nothing fancy here, since it is quite easy to implement this behavior using “rand”<\/strong><\/em> function. However, given that it is available by default, we have a ready-made starting point for implementing non-deterministic functionality in our code. The important thing to remember is that only one of the arguments is evaluated. Since function arguments could be arbitrary expressions, we do not want to evaluate them unnecessarily even though only one of them is “returned”<\/strong><\/em> as result. The “amb”<\/strong><\/em> function handles this correctly. See the following example:<\/p>\n

\"Avoiding<\/a>
Avoiding Unnecessary Evaluation<\/strong><\/figcaption><\/figure>\n

The first value printed is from argument evaluation and the second value is the final result. You can see that both are the same.<\/p>\n

If you are curious, here is one way to implement the functionality provided by “amb”<\/strong><\/em>:<\/p>\n

\"Possible<\/a>
Possible Implementation of “amb”<\/strong><\/figcaption><\/figure>\n

I am using a “macro”<\/strong><\/em> to suppress normal argument evaluation. Quite straightforward.<\/p>\n

Functions with State<\/h3>\n

newLisp<\/strong><\/em> supports the notion of “Namespace”<\/strong><\/em> or “Context”<\/strong><\/em>. Based on this idea, it is possible to use a simple “trick”<\/strong><\/em> to associate “state”<\/strong><\/em> with functions.<\/p>\n

Let us write a function that returns successive even numbers starting from zero.<\/p>\n

\"Generating<\/a>
Generating Even Numbers<\/strong><\/figcaption><\/figure>\n

Here, NextEven:NextEven<\/strong><\/em> is called a “default function”<\/strong><\/em> since it has the same name as its namespace, that is, “NextEven”<\/strong><\/em>. NextEven:curvalue<\/strong><\/em> is a “static”<\/strong><\/em> variable within the same namespace. The NextEven<\/strong><\/em> function uses this “lexically isolated”<\/strong><\/em> variable to save its state across invocations.<\/p>\n

Here is what happens when you execute the NextEven<\/strong><\/em> function:<\/p>\n

\"Result<\/a>
Calling NextEven<\/strong><\/figcaption><\/figure>\n

Thus, everytime the function is called, it correctly returns the “next”<\/strong><\/em> even number.\u00a0<\/span><\/p>\n

What if we want to start from Zero<\/strong><\/em> again? No worries! We can write another “helper”<\/strong><\/em> function in the same “context”<\/strong><\/em> to reset the static variable. Here is how:<\/p>\n

\"Resetting<\/a>
Resetting the State<\/strong><\/figcaption><\/figure>\n

Here is an execution sequence showing the “Reset”<\/strong><\/em> logic:<\/p>\n

\"Reset<\/a>
Reset in Action<\/strong><\/figcaption><\/figure>\n

Elegant, isn’t it? Note that we cannot just use the syntax\u00a0(Reset)<\/strong><\/em> unless the current context is NextEven <\/strong><\/em>(more about contexts in a future article).<\/p>\n

These are the two features I wanted to discuss today. There are many more appealing features in “newLisp”<\/strong><\/em> and I will try to cover some of them in future articles.<\/p>\n

The version of newLisp I used is 10.7.5 (64 bit)<\/strong><\/em> running on Windows 10<\/strong><\/em>.<\/p>\n

Have a nice weekend!<\/p>\n","protected":false},"excerpt":{"rendered":"

newLisp is a general-purpose scripting language with a Lisp-like syntax. That is one of the reasons I wanted to take a closer look at the language. It has a compact footprint, small resource requirements, and can easily be embedded. It is available on multiple platforms, and on my Windows machine, the installation has just two […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"advanced_seo_description":"","jetpack_seo_html_title":"","jetpack_seo_noindex":false,"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[297,17],"tags":[298],"class_list":["post-2580","post","type-post","status-publish","format-standard","hentry","category-newlisp","category-programming","tag-newlisp"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p9OLnF-FC","jetpack-related-posts":[{"id":2610,"url":"https:\/\/www.rangakrish.com\/index.php\/2021\/11\/14\/currying-in-newlisp\/","url_meta":{"origin":2580,"position":0},"title":"Currying in “newLisp”","author":"admin","date":"November 14, 2021","format":false,"excerpt":"In the last two articles, I discussed what I believe are some interesting features of \"newLisp\". Today's topic is \"currying\", another useful feature. For those of you who are new to this topic, I had earlier written about \"currying\" in Mathematica here. You may want to take a look at\u2026","rel":"","context":"In "newLisp"","block_context":{"text":"newLisp","link":"https:\/\/www.rangakrish.com\/index.php\/category\/newlisp\/"},"img":{"alt_text":"Example of Currying","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/11\/Example1-300x141.jpg?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]},{"id":2632,"url":"https:\/\/www.rangakrish.com\/index.php\/2021\/12\/12\/the-net-eval-function-in-newlisp\/","url_meta":{"origin":2580,"position":1},"title":"The “net-eval” Function in “newLisp”","author":"admin","date":"December 12, 2021","format":false,"excerpt":"One of the cool\u00a0things about \"newLisp\" is that despite its small fooprint, it comes with a lot of functionality built-in. For instance, if you are interested in distributed computing, it is pretty easy to get started. In this article, I will touch upon the net-eval function\u00a0that allows an expression to\u2026","rel":"","context":"In "LISP"","block_context":{"text":"LISP","link":"https:\/\/www.rangakrish.com\/index.php\/category\/lisp\/"},"img":{"alt_text":"Two Servers","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/12\/Servers-300x253.jpg?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]},{"id":2620,"url":"https:\/\/www.rangakrish.com\/index.php\/2021\/11\/28\/understanding-the-unify-function-in-newlisp\/","url_meta":{"origin":2580,"position":2},"title":"Understanding the “unify” Function in “newLisp”","author":"admin","date":"November 28, 2021","format":false,"excerpt":"Unification between two symbolic expressions involves finding substitutions for variables (if any) in the expressions such that the expressions match\u00a0after applying the substitutions. This is a powerful idea and is quite common in logic programming languages such as Prolog. Interestingly, \"newLisp\" has a buil-in function called \"unify\" that can be\u2026","rel":"","context":"In "newLisp"","block_context":{"text":"newLisp","link":"https:\/\/www.rangakrish.com\/index.php\/category\/newlisp\/"},"img":{"alt_text":"Unifying \"atomic\" expressions","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/11\/Example1-1-300x106.jpg?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]},{"id":2593,"url":"https:\/\/www.rangakrish.com\/index.php\/2021\/11\/01\/implicit-indexing-and-slicing-in-newlisp\/","url_meta":{"origin":2580,"position":3},"title":"Implicit Indexing and Slicing in “newLisp”","author":"admin","date":"November 1, 2021","format":false,"excerpt":"In traditional Lisp (Common Lisp), when evaluating an S-expression list, the first element in the \"functor\" position must be a function or valid operator. newLisp\u00a0relaxes this requirement and allows the first element to be a context symbol type, a list, an array, or an integer. For today's discussion, let us\u2026","rel":"","context":"In "newLisp"","block_context":{"text":"newLisp","link":"https:\/\/www.rangakrish.com\/index.php\/category\/newlisp\/"},"img":{"alt_text":"List Indexing","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/11\/list1-300x141.jpg?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]},{"id":2645,"url":"https:\/\/www.rangakrish.com\/index.php\/2021\/12\/25\/calling-lisp-functions-from-d-language\/","url_meta":{"origin":2580,"position":4},"title":"Calling Lisp Functions from D Language","author":"admin","date":"December 25, 2021","format":false,"excerpt":"After exploring \"newLisp\" in the past few posts, I would like to start looking at the \"D Programming Language\"\u00a0(DLang). DLang\u00a0has been around since 2001. It was originally created by Walter Bright and later Andrei Alexandrescu joined the team in 2007. The main inspiration for DLang was C++, although it uses\u2026","rel":"","context":"In "D Language"","block_context":{"text":"D Language","link":"https:\/\/www.rangakrish.com\/index.php\/category\/d-language\/"},"img":{"alt_text":"Lisp Function Called from D","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/12\/Lisp-300x107.jpg?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/12\/Lisp-300x107.jpg?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/12\/Lisp-300x107.jpg?resize=525%2C300&ssl=1 1.5x"},"classes":[]},{"id":653,"url":"https:\/\/www.rangakrish.com\/index.php\/2017\/10\/14\/using-function-calls-in-the-grammar\/","url_meta":{"origin":2580,"position":5},"title":"Using Function Calls in the Grammar","author":"admin","date":"October 14, 2017","format":false,"excerpt":"One of the advanced features of iLangGen is the ability to embed arbitrary function calls on the RHS of grammar rules. Such functions impart interesting dynamic behaviour to the generated data. For convenience and flexibility, iLangGen supports two types of function calls - Direct and Indirect. In the case of\u2026","rel":"","context":"In "LISP"","block_context":{"text":"LISP","link":"https:\/\/www.rangakrish.com\/index.php\/category\/lisp\/"},"img":{"alt_text":"Direct Function Call in Grammar","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2017\/10\/Image1.png?resize=350%2C200","width":350,"height":200},"classes":[]}],"_links":{"self":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/2580","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/comments?post=2580"}],"version-history":[{"count":0,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/2580\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/media?parent=2580"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/categories?post=2580"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/tags?post=2580"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}