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

Defining requirements

As we have seen in previous practical chapters, we will start by defining the problem and the objectives that we will achieve during this project's development.

In this chapter, we'll build a program that allows us to calculate the optimal route to get from point A to point B, considering that each of the possible paths chosen could directly impact the calculation of time or cost.

To simplify the problem and to facilitate the design of an adequate algorithm, we are going to simplify the problem. See the diagram on the left side of the following figure. Now imagine you can move from point A to point B using any path, without any problems:

Figure 14.1 – Paths from A to B

On the right side of Figure 14.1, you can see that you can choose several paths. However, if you consider the obstacles (marked by the dotted lines), our options are reduced but still, you could choose paths 1 or 2.

If we want to bring our representation...