⚙️SRFI

SRFI (Scheme Request for Implementation) is an initiative to extend Scheme. Nowadays, most extensions are implemented via Scheme libraries. LispPad and LispPad Go support many SRFIs natively.

These are the SRFI libraries supported by LispKit and thus are included in LispPad and LispPad Go:

• SRFI 1: List Library

• SRFI 2: AND-LET* - an AND with local bindings, a guarded LET* special form

• SRFI 6: Basic String Ports

• SRFI 8: receive - Binding to multiple values

• SRFI 9: Defining Record Types

• SRFI 11: Syntax for receiving multiple values

• SRFI 14: Character-set library

• SRFI 16: Syntax for procedures of variable arity

• SRFI 17: Generalized set!

• SRFI 18: Multithreading support

• SRFI 19: Time Data Types and Procedures

• SRFI 23: Error reporting mechanism

• SRFI 26: Notation for Specializing Parameters without Currying

• SRFI 27: Sources of Random Bits

• SRFI 28: Basic Format Strings

• SRFI 31: A special form rec for recursive evaluation

• SRFI 33: Integer Bitwise-operation Library

• SRFI 34: Exception Handling for Programs

• SRFI 35: Conditions

• SRFI 39: Parameter objects

• SRFI 41: Streams

• SRFI 46: Basic Syntax-rules Extensions

• SRFI 48: Intermediate Format Strings

• SRFI 51: Handling rest list

• SRFI 54: Formatting

• SRFI 55: require-extension

• SRFI 63: Homogeneous and Heterogeneous Arrays

• SRFI 64: A Scheme API for test suites

• SRFI 69: Basic hash tables

• SRFI 87: => in case clauses

• SRFI 95: Sorting and Merging

• SRFI 98: An interface to access environment variables

• SRFI 101: Purely Functional Random-Access Pairs and Lists

• SRFI 102: Procedure Arity Inspection

• SRFI 111: Boxes

• SRFI 112: Environment inquiry

• SRFI 113: Sets and bags

• SRFI 118: Simple adjustable-size strings

• SRFI 121: Generators

• SRFI 125: Intermediate hash tables

• SRFI 128: Comparators

• SRFI 129: Titlecase procedures

• SRFI 132: Sort Libraries

• SRFI 133: Vector Library

• SRFI 134: Immutable Deques

• SRFI 135: Immutable Texts

• SRFI 137: Minimal Unique Types

• SRFI 141: Integer division

• SRFI 142: Bitwise Operations

• SRFI 143: Fixnums

• SRFI 144: Flonums

• SRFI 145: Assumptions

• SRFI 146: Mappings

• SRFI 149: Basic syntax-rules Template Extensions

• SRFI 151: Bitwise Operations

• SRFI 152: String Library

• SRFI 154: First-class dynamic extents

• SRFI 155: Promises

• SRFI 158: Generators and Accumulators

• SRFI 161: Unifiable Boxes

• SRFI 162: Comparators sublibrary

• SRFI 165: The Environment Monad

• SRFI 166: Monadic Formatting

• SRFI 167: Ordered Key Value Store

• SRFI 173: Hooks

• SRFI 174: POSIX Timespecs

• SRFI 175: ASCII Character Library

• SRFI 177: Portable keyword arguments

• SRFI 180: JSON

• SRFI 189: Maybe and Either: optional container types

• SRFI 194: Random data generators

• SRFI 195: Multiple-value boxes

• SRFI 196: Range Objects

• SRFI 204: Wright-Cartwright-Shinn pattern matcher

• SRFI 208: NaN procedures

• SRFI 209: Enums and Enum Sets

• SRFI 210: Procedures and Syntax for Multiple Values

• SRFI 214: Flexvectors

• SRFI 215: Central log exchange

• SRFI 216: SICP Prerequisites

• SRFI 217: Integer sets

• SRFI 219: Define higher-order lambda

• SRFI 221: Generator/accumulator sub-library

• SRFI 222: Compound objects

• SRFI 223: Generalized binary search procedures

• SRFI 224: Integer mappings

• SRFI 227: Optional Arguments

• SRFI 228: Composing Comparators

• SRFI 229: Tagged procedures

• SRFI 230: Atomic Operations

• SRFI 232: Flexible curried procedures

• SRFI 233: INI files

• SRFI 236: Evaluating expressions in an unspecified order