Guile-JPEG is a Scheme library to parse JPEG image files and to perform geometrical transforms on JPEG images.

Guile-Lens is a library implementing lenses in Guile. The library is currently a re-implementation of the lentes library for Clojure. Lenses provide composable procedures, which can be used to focus, apply functions over, or update a value in arbitrary data structures.

This Guile library provides tools for reading, comparing, and writing Semantic Versions. It also includes ranges in the style of the Node Package Manager (NPM).

This package allows you to compile a Guile Python file to any target from tree-il.

This package provides a Guile Scheme wrapper for libgsl.so. Implements

• GSL vectors.

• Matrices.

• BLAS operations.

• Eigensystem solutions.

• One-dimensional root solvers.

This package provides an implementation of SRFI 146 for Guile. SRFI 146 defines datastructures that implement mappings (finite sets of associations consisting of a key and a value). Two types of mappings are defined: One using a comparator to define an order on the keys and another using a hash function on the keys. The datastructures and procedures are by default purely-functional. This package re-uses the SRFI sample implementation that is based on red-black trees and Hash Array Mapped Trie (HAMT).

Utility procedures provided by this SRFI in addition to the R6RS API may be categorized as follows:

• Constructors: alist->eq-hashtable, alist->eqv-hashtable, alist->hashtable

• Access and mutation: hashtable-lookup, hashtable-intern!

• Copying: hashtable-empty-copy

• Key/value collections: hashtable-values, hashtable-key-list, hashtable-value-list, hashtable-entry-lists

• Iteration: hashtable-walk, hashtable-update-all!, hashtable-prune!, hashtable-merge!, hashtable-sum, hashtable-map->lset, hashtable-find

• Miscellaneous: hashtable-empty?, hashtable-pop!, hashtable-inc!, hashtable-dec!

This package provides purely functional data structures written in R6RS Scheme and compiled for Guile. It has been tested with Racket, Guile 2, Vicare Scheme and IronScheme. Right now it contains:

• queues

• deques

• bbtrees

• sets

• dlists

• priority search queues (PSQs)

• finger trees

• sequences

• heaps

• hash array mapped tries (HAMTs).

To query and change settings of serial devices on POSIX systems, the termios API is used. GNU Guile doesn't have an interface for that built in. This module implements this interface by use of Guile's dynamic FFI.

This package provides the functionality to query a SPARQL endpoint. Additionally, it provides an interface to write SPARQL queries using S-expressions.

GuileScript is a toy compiler that aims to compile Guile to JavaScript. It currently does not do much, but it might in the future.

This package provides Guile modules to interface with the OAuth and OAuth2 protocols.

Irregex is an s-expression based alternative to your classic string-based regular expressions. It implements SRFI 115 and is deeply inspired by the SCSH regular expression system.

This package provides Guile FFI bindings for CBLAS, the library of linear algebra subprograms.

To use the bindings, import (ffi cblas). CBLAS will be loaded from the default dynamic library path. There are up to three bindings for each function: raw, typed, and functional.

This is an R6RS library for working with packed byte structures. It is similar to struct in Python or pack and unpack in Perl.

This package provides a functional parser combinator library that supports backtracking and a small logical framework. The idea is to build up chunks that are memoized and there is no clear scanner/parser separation, chunks can be expressions as well as simple tokens.

This package provides an implementation of SRFI 128 for Guile. SRFI 128 defines comparators, which bundles a test type predicate, an equality predicate, an ordering predicate and a hash function into a single Scheme object. This can be used in the implementation of data structures. This package re-uses the SRFI sample implementation.

Fibers is a Guile library that implements a a lightweight concurrency facility, inspired by systems like Concurrent ML, Go, and Erlang. A fiber is like a "goroutine" from the Go language: a lightweight thread-like abstraction. Systems built with Fibers can scale up to millions of concurrent fibers, tens of thousands of concurrent socket connections, and many parallel cores. The Fibers library also provides Concurrent ML-like channels for communication between fibers.

Note that Fibers makes use of some Guile 2.1/2.2-specific features and is not available for Guile 2.0.

Guile-syntax-highlight is a general-purpose syntax highlighting library for GNU Guile. It can parse code written in various programming languages into a simple s-expression that can be converted to HTML (via SXML) or any other format for rendering.

Guile-SMC is a state machine compiler that allows users to describe finite state machines (FSMs) in Scheme in terms of transition tables. It is capable to generate such transition tables from a PlantUML state diagrams.

A transition table can be verified and checked for dead-ends and infinite loops. Also Guile-SMC FSMs gather statistics when they run.

Guile-SMC comes with a Scheme program called smc -- a state machine compiler itself. It produces a Scheme code for an FSM from the PlantUML format. This tool is meant to be called on a PlantUML file when a program with a FSM is being built (for example, from a Makefile.)

guile-dbi is a library for Guile that provides a convenient interface to SQL databases. This package implements the interface for MySQL.

Haunt is a static site generator written in Guile Scheme. Haunt features a functional build system and an extensible interface for reading articles in any format.

Irregex is an s-expression based alternative to your classic string-based regular expressions. It implements SRFI 115 and is deeply inspired by the SCSH regular expression system.

This project provides a pure Scheme implementation of Protocol Buffers, including parsing and code generation.