G-Golf port of the upstream adwaita-1-demo example in the libadwaita Guix package. It adds one simple hello-world example as well. Run guix edit g-golf-adw-1-examples for inspiration how to wrap G-Golf applications when writing a Guix package.

Guile Gemini is an implementation of the Gemini protocol in Guile Scheme, providing both client and server functionality. It uses GnuTLS to meet Gemini's TLS requirements, and Guile Fibers for concurrency.

This package provides Guile bindings for the libmosquitto MQTT client library. The bindings are written in GOOPS, and the user can extend the client class by inheritance.

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-ncurses provides Guile language bindings for the ncurses library.

This is a minimal set of Guile FFI bindings for the FFTW library's ‘guru interface’. It provides two functions: fftw-dft! rank sign in out and fftw-dft rank sign in. These bindings being minimal, there is no support for computing & reusing plans, or split r/i transforms, or anything other than straight complex DFTs.

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).

The (file-names) module provides tools for manipulating file names. The module was built on the idea that doing anything more than a non-trivial modification of a file name string is a pain (making sure all slashes are present and accounted for, resolving . and .., etc). Inevitably, you have to break the string up into chunks and operate on that list of components. This module takes care of that for you.

This package provides a Guile library to communicate with a Debbugs bug tracker's SOAP service, such as https://bugs.gnu.org.

This package provides tooling to write web applications in Guile, such as signed sessions, multipart message support, etc.

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

Emacsy is an embeddable Emacs-like library that uses GNU Guile as extension language. Emacsy can give a C program an Emacsy feel with keymaps, minibuffer, recordable macros, history, tab completion, major and minor modes, etc., and can also be used as a pure Guile library. It comes with a simple counter example using FreeGLUT and browser examples in C using Gtk+-3 and WebKitGtk.

This package provides extensible Guile bindings for the Sway window manager. It can be used to query Sway, assign keybindings and listen to events in Guile.

Wisp is a syntax for Guile which provides a Python-like whitespace-significant language. It may be easier on the eyes for some users and in some situations.

Guile port of racket-algorithms, a package containing useful algorithms borrowed from other programming languages).

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.)

GNU 8sync (pronounced "eight-sync") is an asynchronous programming library for GNU Guile based on the actor model.

Procedures in this SRFI are drawn primarily from SRFI 69 and R6RS. In addition, the following sources are acknowledged:

• hash-table-mutable? procedure and the second argument of hash-table-copy (which allows the creation of immutable hash tables) are from R6RS, renamed in the style of this SRFI.

• hash-table-intern! procedure is from Racket, renamed in the style of this SRFI.

• hash-table-find procedure is a modified version of table-search in Gambit.

• procedures hash-table-unfold and hash-table-count were suggested by SRFI 1.

• procedures hash-table=? and hash-table-map were suggested by Haskell's Data.Map.Strict module.

• procedure hash-table-map->list is from Guile.

The procedures hash-table-empty?, hash-table-empty-copy, hash-table-pop!, hash-table-map!, hash-table-intersection!, hash-table-difference!, and hash-table-xor! were added for convenience and completeness.

This library implements immutable ropes for GNU Guile. A rope is a data structure that represents text strings. It is useful for text editing, because text can be inserted at an arbitrary point without requiring the moving of a lot of data.

This is Emacs with a few settings that make working with Guile easier for people new to Emacs. Features include: CUA mode, Geiser, tool bar icons to evaluate Guile buffers, support for Guile's very own picture language, code completion, a simple mode line, etc.

Asynchronous Reliable Extensible Sleek RPC Server for Guile. It's based on nREPL protocol and can be used for programmable interactions with a running guile processes, for implementing REPLs, IDEs, test runners or other tools.

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.

Guile-GI is a library for Guile that allows using GObject-based libraries, such as GTK+3. Its README comes with the disclaimer: This is pre-alpha code.

MiniKanren is a relational programming extension to the Scheme programming Language, written as a smaller version of Kanren suitable for pedagogical purposes. It is featured in the book, The Reasoned Schemer, written by Dan Friedman, William Byrd, and Oleg Kiselyov.

This is Ian Price's r6rs packaged version of miniKanren, which deviates slightly from miniKanren mainline.

See http://minikanren.org/ for more on miniKanren generally.