Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Mastering Clojure

You're reading from   Mastering Clojure Understand the philosophy of the Clojure language and dive into its inner workings to unlock its advanced features, methodologies, and constructs

Arrow left icon
Product type Paperback
Published in Mar 2016
Publisher Packt
ISBN-13 9781785889745
Length 266 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Akhil Wali Akhil Wali
Author Profile Icon Akhil Wali
Akhil Wali
Arrow right icon
View More author details
Toc

Table of Contents (14) Chapters Close

Preface 1. Working with Sequences and Patterns FREE CHAPTER 2. Orchestrating Concurrency and Parallelism 3. Parallelization Using Reducers 4. Metaprogramming with Macros 5. Composing Transducers 6. Exploring Category Theory 7. Programming with Logic 8. Leveraging Asynchronous Tasks 9. Reactive Programming 10. Testing Your Code 11. Troubleshooting and Best Practices A. References
Index

Understanding the reader

The reader is responsible for interpreting Clojure code. It performs several steps to translate source code in textual representation into executable machine code. In this section, we will briefly describe these steps performed by the reader to illustrate how the reader works.

Clojure and other languages from the Lisp family are homoiconic. In a homoiconic language, the source code of a program is represented as a plain data structure. This means that all the code written in a Lisp language is simply a bunch of nested lists. Thus, we can manipulate programs' code just like any other list of values. Clojure has a few more data structures, such as vectors and maps in its syntax, but they can be handled just as easily. In languages that are not homoiconic, any expression or statement in a program has to be translated into an internal data structure termed as a parse tree, or syntax tree, when the program is compiled or interpreted. In Lisps, however, an expression...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image