#category-theory #encoding #syntax-tree #gadt #strict-encoding #memory-layout #ubideco

bin+lib strict_types

Strict types: confined generalized algebraic data types (GADT)

24 releases (13 stable)

2.7.0-beta.4 May 24, 2024
2.7.0-beta.2 Mar 12, 2024
1.6.3 Oct 9, 2023
1.6.0 Jul 23, 2023
1.0.0-rc.1 Mar 28, 2023

#148 in Parser implementations

Download history 1185/week @ 2024-03-03 1485/week @ 2024-03-10 1156/week @ 2024-03-17 1556/week @ 2024-03-24 475/week @ 2024-03-31 483/week @ 2024-04-07 1186/week @ 2024-04-14 1410/week @ 2024-04-21 241/week @ 2024-04-28 337/week @ 2024-05-05 104/week @ 2024-05-12 659/week @ 2024-05-19 339/week @ 2024-05-26 889/week @ 2024-06-02 373/week @ 2024-06-09 685/week @ 2024-06-16

2,526 downloads per month
Used in 25 crates (14 directly)



Strict types AST and typelib implementation

Protobufs for functional programming

This is a set of libraries for working with abstract syntax trees and libraries of strict types – type system made with category theory which ensures provable properties and bounds for the in-memory and serialized type representation.

Strict types is a formal notation for defining and serializing generalized algebraic data types (GADT) in a deterministic and confined way. It is developed with type theory in mind.

Strict Types are:

  • schema-based (with the schema being strict encoding notation),
  • semantic, i.e. defines types not just as they are layed out in memory, but also depending on their meaning,
  • deterministic, i.e. produces the same result for a given type,
  • portabile, i.e. can run on ahy hardware architecture and OS, including low-performant embedded systems,
  • confined, i.e. provides guarantees and static analysis on a maximum size of the typed data,
  • formally verifiabile.

To learn more about strict encoding read the spec.

Strict types works with type definitions. It allows:

  • static analysis of data types, like
    • defining semantic type ids;
    • specifying exact memory layout;
    • type equivalence in terms of semantics and memory layout;
    • size of serialized data
  • composing types into type libraries;
  • versioning type libraries basing on the semantic types;

The library allows to generate & compile strict type libraries (STL) from rust types implementing StrictEncoding trait -- and ensures that the deserialization with StrictDecode follows the same memory and semantic layout.

Strict Types Library

The library is able to reflect on itself, producing replica of its rust data types in strict types system.

Strict types library id: stl:9KALDYR8Nyjq4FdMW6kYoL7vdkWnqPqNuFnmE9qHpNjZ#lagoon-rodent-option

Import this lib by putting in the file header import lagoon_rodent_option_9KALDYR8Nyjq4FdMW6kYoL7vdkWnqPqNuFnmE9qHpNjZ as StrictTypes

Source code can be found in [stl/StrictTypes.sty] file.




The libraries are distributed on the terms of Apache 2.0 license.


~102K SLoC