This package provides a DNS Check Discovery.

Instead of replacing yes-or-no-p with y-or-n-p, replace it with something even more mentally demanding.

Currently implemented:

- super-duper-yes-or-no-words-p. - super-duper-yes-or-no-toggle-case-p. - super-duper-yes-or-no-arithmetic-problem-p.

Consult the README.org file or the Emacs help of these functions for more information.

Replace proprietary web frontends with free and privacy respecting web frontends.

A text-to-speech accessibility tool which reads aloud the active region.

Speaking is done using espeak-ng.

This book, written by Protesilaos Stavrou, also known as “Prot”, provides a big picture view of the Emacs Lisp programming language.

Greader is a module that allows you to send any emacs buffer to a TTS. A text-to-speech like engine espeak-ng or speech-dispatcher are already supported, plus limited bakend support native to macOS. The mode supports timer reading, automatic scrolling of buffers in modes like info-mode, repeating reading of regions or the whole buffer, includes a feature to facilitate the compilation of espeak-ng pronunciations, and other features.

Scheme lacks a flexible way to create and apply curried procedures. This SRFI describes curried, a variant of lambda that creates true curried procedures which also behave just like ordinary Scheme procedures. They can be applied to their arguments one by one, all at once, or anywhere in between, without any novel syntax. curried also supports nullary and variadic procedures, and procedures created with it have predictable behavior when applied to surplus arguments.

Data validation and type checking (supposedly) make for more correct code. And faster code too, sometimes. And, in rare cases, code that's easier to follow than the un-checked one. Unfortunately, Scheme does not have many (type-)checking primitives out of the box. This SRFI provides some, with the aim of allowing more performant and correct code with minimum effort on the user side. Both (manual) argument checking/validation (check-arg) and return value(s) (values-checked) checking/coercion are provided. Syntax sugar like lambda-checked and define-checked is added on top.

R7RS-small Scheme library for reading and writing RSV (Rows of String Values) data format, a very simple binary format for storing tables of strings. It is a competitor for e.g. CSV (Comma Seperated Values), and TSV (Tab Separated Values). Its main benefit is that the strings are represented as Unicode encoded as UTF-8, and the value and row separators are byte values that are never used in UTF-8, so the strings do not need any error prone escaping and thus can be written and read verbatim.

Specified in https://github.com/Stenway/RSV-Specification and demonstrated in https://www.youtube.com/watch?v=tb_70o6ohMA.

Guile-websocket provides an implementation of the WebSocket protocol as defined by RFC 6455.

A comprehensive library of vector operations.

Topological sorting is an algorithm that takes a graph consisting of nodes and other nodes that depend on them, forming a partial order, and returns a list representing a total ordering of the graph. If the graph is cyclic, the topological sort will fail. The procedure topological-sort returns three values. If sorting succeeds, the first value contains the result and the second and third are #false. If sorting fails, the result is #false and the second and third value may provide additional information about the error.

Guile-Lib is intended as an accumulation place for pure-scheme Guile modules, allowing for people to cooperate integrating their generic Guile modules into a coherent library. Think "a down-scaled, limited-scope CPAN for Guile". It provides the following modules:

• (apicheck) Describe and verify library programming interfaces.

• (config load) Loading configuration files.

• (container async-queue) A thread-safe message queue.

• (container nodal-tree) A tree consisting of nodes with attributes.

• (container delay-tree) A nodal tree with lazily evaluated fields.

• (debugging assert) Helpful assert macro.

• (debugging time) A simple macro to time the execution of an expression.

• (graph topological-sort) Routines to perform topological sorts.

• (htmlprag) Neil Van Dyke's permissive ("pragmatic") HTML parser.

• (io string) SLIB's IO routines dealing with strings.

• (logging logger) A flexible logging system.

• (logging port-log) A logger that outputs to a port.

• (logging rotating-log) A logger that rotates its output files.

• (match-bind) Nifty and concise regular expression routines.

• (math minima) A golden-section minimum finder.

• (math primes) Functions related to prime numbers and factorization.

• (os process) Spawning processes and capturing their output.

• (scheme documentation) Macros to define different kinds of variables with documentation.

• (scheme kwargs) Defining functions with flexible keyword arguments.

• (search basic) Classic search functions.

• (string completion) Building blocks for tab completion.

• (string soundex) The SOUNDEX string categorization algorithm.

• (string transform) Beyond SRFI-13.

• (string wrap) A versatile string formatter.

• (term ansi-color) Generate ANSI color escape sequences.

• (unit-test) A JUnit-style unit testing framework.

Bytevector PEGs for GNU Guile

Topological sorting is an algorithm that takes a graph consisting of nodes and other nodes that depend on them, forming a partial order, and returns a list representing a total ordering of the graph. If the graph is cyclic, the topological sort will fail. The procedure topological-sort returns three values. If sorting succeeds, the first value contains the result and the second and third are #false. If sorting fails, the result is #false and the second and third value may provide additional information about the error.

This SRFI contains various procedures that accept and return procedures, as well as a few others, drawn from an earlier version of Chicken. Common Lisp has a few of them too, and more come from the Standard Prelude from Programming Praxis. Using these procedures helps to keep code terse and reduce the need for ad hoc lambdas.

This package installs the clipboard-speaker executable. An accessibility tool that reads the contents of the clipboard. I can read the current selection or the clipboard. Select a bunch of text, press a keybinding / shortcut you've set in the windows manager, and clipboard-speaker would read that aloud.

A Javascript Ribbit Scheme runtime.

A Scheme runtime compiler.

Skribilo is a free document production tool that takes a structured document representation as its input and renders that document in a variety of output formats: HTML and Info for on-line browsing, and Lout and LaTeX for high-quality hard copies.

The input document can use Skribilo's markup language to provide information about the document's structure, which is similar to HTML or LaTeX and does not require expertise. Alternatively, it can use a simpler, “markup-less” format that borrows from Emacs' outline mode and from other conventions used in emails, Usenet and text.

Lastly, Skribilo provides Guile Scheme APIs.

Revised^7 Report of the Algorithmic Language Scheme adapted to Texinfo format. This package installs the info version of the document.

Revised^7 Report of the Algorithmic Language Scheme adapted to Texinfo format. This package installs the epub version of the document.

Revised^7 Report of the Algorithmic Language Scheme adapted to Texinfo format. This package installs the html version of the document.

Revised^7 Report of the Algorithmic Language Scheme adapted to Texinfo format. This package installs the pdf version of the document.