Book Image

Learn Bosque Programming

By : Sebastian Kaczmarek, Joel Ibaceta
Book Image

Learn Bosque Programming

By: Sebastian Kaczmarek, Joel Ibaceta

Overview of this book

Bosque is a new high-level programming language inspired by the impact of structured programming in the 1970s. It adopts the TypeScript syntax and ML semantics and is designed for writing code that is easy to reason about for humans and machines. With this book, you'll understand how Bosque supports high productivity and cloud-first development by removing sources of accidental complexity and introducing novel features. This short book covers all the language features that you need to know to work with Bosque programming. You'll learn about basic data types, variables, functions, operators, statements, and expressions in Bosque and become familiar with advanced features such as typed strings, bulk algebraic data operations, namespace declarations, and concept and entity declarations. This Bosque book provides a complete language reference for learning to program with Bosque and understanding the regularized programming paradigm. You'll also explore real-world examples that will help you to reinforce the knowledge you've acquired. Additionally, you'll discover more advanced topics such as the Bosque project structure and contributing to the project. By the end of this book, you'll have learned how to configure the Bosque environment and build better and reliable software with this exciting new open-source language.
Table of Contents (22 chapters)
1
Section 1: Introduction
5
Section 2: The Bosque Language Overview
10
Section 3: Practicing Bosque
15
Section 4: Exploring Advanced Features

Recursion and the recursive keyword

As mentioned in the Recursion section in Chapter 3, Bosque Key Features, there is not much difference between Bosque and other popular programming languages when it comes to recursive processing. The only thing that is different is the recursive keyword. In the aforementioned chapter, we learned that in order to declare and call a recursive function, we need to decorate it with the recursive keyword. Without doubt, this practice helps a lot as we can just take a quick look at the code and tell immediately whether a function is recursive just by looking at the way it is called. However, we can declare a recursive function without using this keyword and it will work just fine. Have a look at this example:

 function power(base: Float64, exp: Int): Float64 {
    return if (exp == 0) 1.0f
        else if (exp < 0) 1.0f / power(base, 0 - exp)
        ...