Hackage :: [Package]

interval-algebra: An implementation of Allen's interval algebra for temporal logic

[ algebra, bsd3, library, program, time ] [ Propose Tags ] [ Report a vulnerability ]
Versions [RSS] 0.1.2, 0.2.0, 0.3.0, 0.3.1, 0.3.2, 0.3.3, 0.4.0, 0.5.0, 0.6.0, 0.6.1, 0.6.2, 0.6.3, 0.7.0, 0.7.1, 0.8.0, 0.8.1, 0.8.2, 0.8.3, 0.8.4, 0.8.5, 0.8.6, 0.9.0, 0.10.0, 0.10.1, 0.10.2, 1.0.0, 1.0.1, 1.1.0, 1.1.1, 1.1.2, 1.1.3, 1.2.0, 1.3.0, 1.4.0, 2.0.0, 2.0.1, 2.0.2, 2.1.0, 2.1.1, 2.1.2, 2.1.3, 2.2.0
Change log ChangeLog.md
Dependencies base (>=4.7 && <5), binary (>=0.8 && <0.9), containers (>=0.6 && <0.7), deepseq (>=1.1 && <1.5), foldl (>=1.4 && <1.5), interval-algebra, nonempty-containers (>=0.3 && <0.4), prettyprinter (>=1.7 && <1.8), QuickCheck (>=2.14 && <2.15), safe (>=0.3 && <0.4), text (>=1.2 && <1.3 || >=2.0 && <2.1), time (>=1.9 && <1.10), witch (>=1.0 && <1.1), witherable (>=0.4 && <0.5) [details]
License BSD-3-Clause
Copyright 2020 NoviSci
Author Bradley Saul
Maintainer bsaul@novisci.com
Category Algebra, Time
Home page https://github.com/novisci/interval-algebra#readme
Bug tracker https://github.com/novisci/interval-algebra/issues
Source repo head: git clone https://github.com/novisci/interval-algebra
Uploaded by brendanrbrown at 2022-07-18T13:24:06Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Executables tutorial
Downloads 9826 total (86 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for interval-algebra-2.1.0

[back to package description]

interval-algebra

The interval-algebra package implements Allen's interval algebra in Haskell. The main module provides data types and related classes for the interval-based temporal logic described in Allen (1983) and axiomatized in Allen and Hayes (1987). A good primer on Allen's algebra can be found here.

Design

The module is built around three typeclasses designed to separate concerns of constructing, relating, and combining types that contain Intervals:

  1. Intervallic provides an interface to the data structures which contain an Interval.
  2. IntervalCombinable provides an interface to methods of combining two Intervals.
  3. IntervalSizeable provides methods for measuring and modifying the size of an interval.

An advantage of nested typeclass design is that developers can define an Interval of type a with just the amount of structure that they need.

Axiom tests

The package includes tests that the functions of the IntervalAlgebraic typeclass meets the axioms for intervals (not points) as laid out in Allen and Hayes (1987).