Open Source Scheme Software Development Software

An implementation of DSSSL, a style language to format SGML or XML documents. OpenJade contains backends for various formats (RTF, HTML, TeX, MIF, SGML2SGML, and FOT). This project also maintains OpenSP.

Racket is a general-purpose programming language and an ecosystem for language-oriented programming. This repository holds the source code for the core of Racket plus some related packages. The rest of the Racket distribution source code is in other repositories, mostly under the Racket GitHub organization. Racket programmers typically program with functions, records, objects, exceptions, regular expressions, modules, and threads. That is, instead of a “minimalist” language, which is the way that Scheme is often described, Racket offers a rich language with an extensive set of libraries and tools. Libraries are not restricted to exporting values, such as functions; they can also define new syntactic forms. In this sense, Racket isn’t exactly a language at all; it’s more of an idea for how to structure a language so that you can extend it or create entirely new languages.

Gauche is an R7RS Scheme implementation aimed to be a handy tool for daily works. Quick startup, built-in system interface and native multilingual support are some of the goals.

TinyScheme is a Scheme interpreter that can execute Scheme code but is also suitable for embedding in programs. The goal is to keep the interpreter small while providing as much compatability with Scheme standards as possible.

In this project we aim to develop scheme libraries for developing various web applications (especially servlets and xml-based web services). Our approach is to use jscheme (an open source implementation of scheme in Java) as the core language which allow

EDE is fast desktop environment with familiar look and feel. It should work fine on slower computers too.

This project is dedicated to developing more readable format(s) for Lisp-based languages (such as Common Lisp and Scheme) and implementing those formats (readers, pretty-printers, editor macros, etc.). MIT license preferred, to spread them widely.

This is a resurrection of Matthias Blume's VSCM Scheme implementation.

AutoGen is designed to generate text files containing repetitive text with varied substitutions. Its goal is to simplify the maintenance of programs that contain large amounts of repetitious text, especially when needed in parallel tables.

ECB is a file/code browser for Emacs. It can be used to browse any type of file and supports parsing of Java, C, C++, Elisp and some other code like perl, TeX, LaTeX. All browsing windows are within one frame and they are deletion-protected (eg by C-x 1)

FramerD is a distributed semi-structured object database originally developed at MIT. It provides an internationalized Scheme-based scripting language, built-in text analysis tools, and special support for web scripting.

Ksi is a portable, embeddable Scheme implementation written in C.

An implementation of the language described in "Karel the Robot: A Gentle Introduction to The Art of Programming" by Richard Pattis et al. Both Java and C/Unix versions are available.

SISC is an extensible Java based interpreter of the algorithmic language Scheme. SISC uses modern interpretation techniques, and handily outperforms all existing Java interpreters (often by more than an order of magnitude).

Logprocessor is a tool for analyzing log files in a rigorous and reliable way. You write a command file and the log file can be run though the tool resulting in pass/fail.

FEAR is a development kit helping software engineers create advanced artificial intelligence in synthetic characters with simplicity and efficiency. The project includes reusable AI components, portable framework and interfaces to realtime 3D games.

Niche website for webmasters promoting adult companies through referrals, Flat File RSS Archives, make money through webmaster referrals and from the regular surfer. New programs are added all the time so please use this to your advantage.

upload/donwload/fun

A declarative logic programming system with first-class relations embedded in a pure functional subset of Scheme. The system has true unions, fair scheduling, lexically-scoped logical variables, set-theoretical semantics, high performance without cuts

Miscellaneous modules for guile, such as a reader for regex literals, "join" like perl, and others I've found useful. I would like to adapt these to other implementations of scheme, and/or integrate with existing projects/libraries. Help is welcome.

A scheme (lisp) interpreter written in ARM assembly language (currently: Cortex-M4F,M7, Cortex-A5,A8,A9, Cortex-A53; previously:ARM7TDMI, ARM920T, Cortex-M3) for education, robotics, wearable devices. Tested on Allwinner A64, Amlogic S905, Atmel SAMA5D4, SAME70, SAMV71, NXP LPC4300, RT1050, iMX8M, Samsung S5P6818, ST STM32F4, STM32F7, and TI AM3359, OMAP3530, DM3730, OMAP4430, TM4C1294 chips (previously: NXP LPC-1300,1700,2000, ATMEL AT91SAM7, STM STR711, STR911, STM32, CIRRUS EP9302, LMI LM3S1968, TI OMAP).

A framework for building distributed virtual reality applications, based on OpenGL|Performer(TM)

A collection of libraries for Bigloo Scheme compiler.

A Windows native distribution of Bigloo, a Scheme system that includes an optimizing compiler generating C code, Java classes and .NET CIL files as well as an interpreter.

Chez Scheme is both a programming language and an implementation of that language, with supporting tools and documentation. As a superset of the language described in the Revised6 Report on the Algorithmic Language Scheme (R6RS), Chez Scheme supports all standard features of Scheme, including first-class procedures, proper treatment of tail calls, continuations, user-defined records, libraries, exceptions, and hygienic macro expansion. The Chez Scheme implementation consists of a compiler, run-time system, and programming environment. Although an interpreter is available, all code is compiled by default. Source code is compiled on-the-fly when loaded from a source file or entered via the shell. A source file can also be precompiled into a stored binary form and automatically recompiled when its dependencies change. Whether compiling on the fly or precompiling, the compiler produces optimized machine code, with some optimization across separately compiled library boundaries.