on master help sign in
26 files changed+382−406
since splitsnapshots
unifiedsplit
.ghc.environment.x86_64-linux-8.6.5−17 .ghc.environment.x86_64-linux-8.8.3−17 .github/workflows/ci.yml+43 .gitignore+54−2 .travis.yml+47 CHANGELOG.md+17 ChangeLog.md−3 LICENSE+17−26 README.md+34−30 Setup.hs−2 app/Main.hs−7 appveyor.yml+34 app/Benchmarks.hs → benchmark/Main.hs+3−6 hackage.sh−10 laop.cabal+82−72 package.yaml−57 src/LAoP/Matrix/Internal.hs+20−69 src/LAoP/Matrix/Type.hs+2−2 src/LAoP/Relation/Internal.hs+12−9 stack-8.8.3.yaml+1 stack.yaml+1−66 stack.yaml.lock+4−4 app/Quantum.hs → test/Examples/Quantum.hs+2−2 app/Examples.hs → test/Examples/Readme.hs+1−2 app/Spreadsheets.hs → test/Examples/Spreadsheets.hs+1−2 test/Spec.hs+7−1
.ghc.environment.x86_64-linux-8.6.5deleted−17
@@ -1,17 +0,0 @@
1−-- This is a GHC environment file written by cabal. This means you can
2−-- run ghc or ghci and get the environment of the project as a whole.
3−-- But you still need to use cabal repl $target to get the environment
4−-- of specific components (libs, exes, tests etc) because each one can
5−-- have its own source dirs, cpp flags etc.
6−--
7−clear-package-db
8−global-package-db
9−package-db /home/bolt/.cabal/store/ghc-8.6.5/package.db
10−package-db packagedb/ghc-8.6.5
11−package-id laop-0.1.0.0-inplace
12−package-id base-4.12.0.0
13−package-id ghc-prim-0.5.3
14−package-id rts
15−package-id integer-gmp-1.0.2.0
16−package-id deepseq-1.4.4.0
17−package-id array-0.5.3.0
.ghc.environment.x86_64-linux-8.8.3deleted−17
@@ -1,17 +0,0 @@
1−-- This is a GHC environment file written by cabal. This means you can
2−-- run ghc or ghci and get the environment of the project as a whole.
3−-- But you still need to use cabal repl $target to get the environment
4−-- of specific components (libs, exes, tests etc) because each one can
5−-- have its own source dirs, cpp flags etc.
6−--
7−clear-package-db
8−global-package-db
9−package-db /home/bolt/.cabal/store/ghc-8.8.3/package.db
10−package-db dist-docs.Q1TJPL/packagedb/ghc-8.8.3
11−package-id laop-0.1.0.7-inplace
12−package-id base-4.13.0.0
13−package-id ghc-prim-0.5.3
14−package-id rts
15−package-id integer-gmp-1.0.2.0
16−package-id deepseq-1.4.4.0
17−package-id array-0.5.4.0
.github/workflows/ci.ymlnew file+43
@@ -0,0 +1,43 @@
1+name: CI
2+
3+# Trigger the workflow on push or pull request, but only for the master branch
4+on:
5+ pull_request:
6+ push:
7+ branches: [master]
8+
9+jobs:
10+ build:
11+ name: ghc ${{ matrix.ghc }}
12+ runs-on: ubuntu-16.04
13+ strategy:
14+ matrix:
15+ cabal: ["3.0"]
16+ ghc:
17+ - "8.6.5"
18+ - "8.8.3"
19+
20+ steps:
21+ - uses: actions/checkout@v2
22+ if: github.event.action == 'opened' || github.event.action == 'synchronize' || github.event.ref == 'refs/heads/master'
23+
24+ - uses: actions/setup-haskell@v1
25+ name: Setup Haskell
26+ with:
27+ ghc-version: ${{ matrix.ghc }}
28+ cabal-version: ${{ matrix.cabal }}
29+
30+ - uses: actions/cache@v1
31+ name: Cache ~/.cabal/store
32+ with:
33+ path: ~/.cabal/store
34+ key: ${{ runner.os }}-${{ matrix.ghc }}-cabal
35+
36+ - name: Build
37+ run: |
38+ cabal v2-update
39+ cabal v2-build --enable-tests --enable-benchmarks
40+
41+ - name: Test
42+ run: |
43+ cabal v2-test --enable-tests
.gitignore+54−2
@@ -1,3 +1,55 @@
1+### Haskell
2+dist
3+dist-*
4+cabal-dev
5+*.o
6+*.hi
7+*.chi
8+*.chs.h
9+*.dyn_o
10+*.dyn_hi
11+*.prof
12+*.aux
13+*.hp
14+*.eventlog
15+.virtualenv
16+.hsenv
17+.hpc
18+.cabal-sandbox/
19+cabal.sandbox.config
20+cabal.config
21+cabal.project.local
22+.ghc.environment.*
23+.HTF/
24+# Stack
125.stack-work/
2−laop.cabal
3−*~
26+stack.yaml.lock
27+
28+### IDE/support
29+# Vim
30+[._]*.s[a-v][a-z]
31+[._]*.sw[a-p]
32+[._]s[a-v][a-z]
33+[._]sw[a-p]
34+*~
35+tags
36+
37+# IntellijIDEA
38+.idea/
39+.ideaHaskellLib/
40+*.iml
41+
42+# Atom
43+.haskell-ghc-mod.json
44+
45+# VS
46+.vscode/
47+
48+# Emacs
49+*#
50+.dir-locals.el
51+TAGS
52+
53+# other
54+.DS_Store
55+hackage.sh
.travis.ymlnew file+47
@@ -0,0 +1,47 @@
1+sudo: true
2+language: haskell
3+
4+git:
5+ depth: 5
6+
7+cabal: "3.0"
8+
9+cache:
10+ directories:
11+ - "$HOME/.cabal/store"
12+ - "$HOME/.stack"
13+ - "$TRAVIS_BUILD_DIR/.stack-work"
14+
15+matrix:
16+ include:
17+ - ghc: 8.6.5
18+ - ghc: 8.8.3
19+
20+ - ghc: 8.8.3
21+ env: STACK_YAML="$TRAVIS_BUILD_DIR/stack-8.8.3.yaml"
22+
23+ - ghc: 8.6.5
24+ env: STACK_YAML="$TRAVIS_BUILD_DIR/stack.yaml"
25+
26+
27+install:
28+ - |
29+ if [ -z "$STACK_YAML" ]; then
30+ cabal v2-update
31+ cabal v2-build --enable-tests --enable-benchmarks
32+ else
33+ curl -sSL https://get.haskellstack.org/ | sh
34+ stack --version
35+ stack build --system-ghc --test --bench --no-run-tests --no-run-benchmarks
36+ fi
37+
38+script:
39+ - |
40+ if [ -z "$STACK_YAML" ]; then
41+ cabal v2-test --enable-tests
42+ else
43+ stack test --system-ghc
44+ fi
45+
46+notifications:
47+ email: false
CHANGELOG.mdnew file+17
@@ -0,0 +1,17 @@
1+# Changelog
2+
3+`laop` uses [PVP Versioning][1].
4+The changelog is available [on GitHub][2].
5+
6+## 0.1.1.1
7+
8+* Bump base version to work with cabal
9+
10+## 0.1.1.0
11+
12+* Package is more organized and now has tests and benchmarks separated
13+* Repository is more organized and clean
14+* Added CI
15+
16+[1]: https://pvp.haskell.org
17+[2]: https://github.com/bolt12/laop2/releases
ChangeLog.mddeleted−3
@@ -1,3 +0,0 @@
1−# Changelog for laop
2−
3−## Unreleased changes
LICENSE+17−26
@@ -1,30 +1,21 @@
1−Copyright Armando Santos (c) 2019
1+MIT License
22
3−All rights reserved.
3+Copyright (c) 2020 Armando Santos
44
5−Redistribution and use in source and binary forms, with or without
6−modification, are permitted provided that the following conditions are met:
5+Permission is hereby granted, free of charge, to any person obtaining a copy
6+of this software and associated documentation files (the "Software"), to deal
7+in the Software without restriction, including without limitation the rights
8+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9+copies of the Software, and to permit persons to whom the Software is
10+furnished to do so, subject to the following conditions:
711
8− * Redistributions of source code must retain the above copyright
9− notice, this list of conditions and the following disclaimer.
12+The above copyright notice and this permission notice shall be included in all
13+copies or substantial portions of the Software.
1014
11− * Redistributions in binary form must reproduce the above
12− copyright notice, this list of conditions and the following
13− disclaimer in the documentation and/or other materials provided
14− with the distribution.
15−
16− * Neither the name of Armando Santos nor the names of other
17− contributors may be used to endorse or promote products derived
18− from this software without specific prior written permission.
19−
20−THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21−"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22−LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
23−A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
24−OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
25−SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
26−LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27−DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28−THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29−(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
30−OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
15+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21+SOFTWARE.
README.md+34−30
@@ -1,5 +1,11 @@
11# laop - Linear Algebra of Programming library
22
3+[![GitHub CI](https://github.com/bolt12/laop/workflows/CI/badge.svg)](https://github.com/bolt12/laop/actions)
4+[![Build status](https://img.shields.io/travis/bolt12/laop.svg?logo=travis)](https://travis-ci.org/bolt12/laop)
5+[![Hackage](https://img.shields.io/hackage/v/laop.svg?logo=haskell)](https://hackage.haskell.org/package/laop)
6+[![Stackage Lts](http://stackage.org/package/laop/badge/lts)](http://stackage.org/lts/package/laop)
7+[![Stackage Nightly](http://stackage.org/package/laop/badge/nightly)](http://stackage.org/nightly/package/laop)
8+
39The LAoP discipline generalises relations and functions treating them as
410Boolean matrices and in turn consider these as arrows.
511
@@ -10,40 +16,38 @@ motivation behind the library, the underlying theory, and implementation details
1016This module offers many of the combinators mentioned in the work of
1117[Macedo (2012)](https://repositorium.sdum.uminho.pt/handle/1822/22894) and [Oliveira (2012)](https://pdfs.semanticscholar.org/ccf5/27fa9179081223bffe8067edd81948644fc0.pdf).
1218
13−See the package in hackage [here](https://hackage.haskell.org/package/laop-0.1.0.5)
14−
15−There are a couple of repos with a WIP of benchmarks comparing [matrix composition](https://github.com/bolt12/laop-benchmarks) and a real use case of [data analytics](https://github.com/bolt12/laop-analytics).
19+See the package in hackage [here](https://hackage.haskell.org/package/laop-0.1.1.0)
1620
17−A Functional Pearl has been written and can be regarded as the [reference document](https://github.com/bolt12/tymfgg-functional-pearl) for this library.
21+A Functional Pearl has been written and can be regarded as the [reference document](https://github.com/bolt12/tymfgg-pearl) for this library.
1822
1923## Features
2024
21−This library offers:
22−
23−- An internal module representation that uses normal datatypes (`Void`, `()`, `Either`) for matrix dimensions and two
24− type families `FromNat` and `Count` to make it easier to work with these type of matrices.
25−- An interfacing module that uses generalised types for the dimensions and is just a newtype wrapper
26− around the internal matrix data type.
27−- An interfacing module that uses type level naturals for the dimensions and is just a newtype wrapper
28− around the internal matrix data type.
29−- An interfacing module that restricts the matrix contents to being only 0's or 1's (True
30− and False). This module is called 'Relation' and offers many of the combinators seen in
31− AoP and Relational Calculus/Algebra.
32−- A very simple Probabilistic Programming module and several functions and data types to
33− make it easier to deal with sample space.
34−
35−Given this, this new matrix formulation compared to other libraries one has much more advantages, such as:
36−
37−- Has an inductive definition enabling writing matrix manipulation functions in a much more elegant and calculational way;
38−- Statically typed dimensions;
39−- Polymorphic data type dimensions;
40−- Polymorphic matrix content;
41−- Awesome dimension type inference;
42−- Fast type natural conversion via `FromNat` type family;
43−- Matrix `Junc` and `Split`-ing in O(1);
44−- Matrix composition takes advantage of divide-and-conquer and fusion laws.
45−
46−Unfortunately, this approach does not solve the issue of type dimensions being in some way constrainted making it impossible to write Arrow instances, for example. Type inference isn't perfect, when it comes to infer the types of matrices which dimensions are computed using type level naturals multiplication, the compiler needs type annotations in order to succeed.
25+This library offers 3 main matrix programming modules:
26+
27+- One in which matrices are typed with type level natural numbers;
28+- One in which matrices are typed with arbitrary generic data types;
29+- One in which matrices are regarded as relations, i.e. boolean matrices;
30+
31+There's also an experimental module that uses matrices to represent probability
32+distributions.
33+
34+The most interesting feature is that matrices are represented as an inductive data type.
35+Given this formulation, matrix algorithms can be expressed in a much more elegant and
36+calculational style than the traditional vector of vectors representation. This data type
37+guarantees that a matrix will always have valid dimensions. It can also express block matrix
38+computations naturally, which leads to total, efficient and statically typed manipulation
39+and transformation functions.
40+
41+Like matrix multiplication, other common operations, such as matrix transposition, benefit from a block-oriented structure that leads to a simple and natural divide-and-conquer algorithmic solution. Performance wise, this means that without much effort we can obtain optimal cache-oblivious algorithms.
42+
43+Given this, this new matrix formulation compared to other libraries:
44+
45+- Is more compositional and polymorphic and does not have partial matrix manipulation functions (hence less chances for usage errors);
46+- Our implementation of matrices enables simple manipulation of submatrices, making it particularly suitable for formal verification and equation reasoning, using the mathematical framework defined by the linear algebra of programming. Furthermore, the data type constructors ensure that the matrices of this kind are sound, i.e. malformed matrices with incorrect dimensions of the sort, can not be constructed.
47+
48+## Known issues
49+
50+Unfortunately, due to the use of type-level programming features, this approach sometimes requires type dimensions to be constrainted, in some way, impossible to write idiomatic Arrow instances, for example. Type inference isn't perfect, when it comes to infer the types of matrices which dimensions are computed using type level naturals multiplication, the compiler needs type annotations in order to succeed. And not all kinds of programs can be modeled using matrices, namely programs that deal with arbitrary infinite data types such as lists or integers (although there are some workarounds).
4751
4852## Notes
4953
Setup.hsdeleted−2
@@ -1,2 +0,0 @@
1−import Distribution.Simple
2−main = defaultMain
app/Main.hsdeleted−7
@@ -1,7 +0,0 @@
1−module Main where
2−
3−import Examples
4−import Benchmarks
5−
6−main :: IO ()
7−main = benchmark
appveyor.ymlnew file+34
@@ -0,0 +1,34 @@
1+clone_folder: "c:\\WORK"
2+clone_depth: 5
3+
4+# Do not build feature branch with open Pull Requests
5+skip_branch_with_pr: true
6+
7+platform:
8+ - x86_64
9+
10+cache:
11+ - "C:\\SR"
12+ - dist-newstyle
13+
14+environment:
15+ global:
16+ CABOPTS: --store-dir=C:\\SR
17+
18+ matrix:
19+ - GHCVER: 8.6.5
20+
21+install:
22+ - choco source add -n mistuke -s https://www.myget.org/F/mistuke/api/v2
23+ - choco install -y cabal --version 2.4.1.0
24+ - choco install -y ghc --version 8.6.3
25+ - refreshenv
26+
27+before_build:
28+ - cabal --version
29+ - ghc --version
30+ - cabal %CABOPTS% v2-update
31+
32+build_script:
33+ - cabal %CABOPTS% v2-build --enable-tests
34+ - cabal %CABOPTS% v2-test --enable-tests
app/Benchmarks.hs → benchmark/Main.hsrenamed+3−6
@@ -8,10 +8,7 @@
88{-# LANGUAGE AllowAmbiguousTypes #-}
99{-# LANGUAGE ScopedTypeVariables #-}
1010
11−module Benchmarks
12− ( benchmark
13− )
14− where
11+module Main (main) where
1512
1613import LAoP.Dist.Internal
1714import LAoP.Utils
@@ -147,8 +144,8 @@ setupEnv2 = do
147144 distList2 <- generate (resize 1 (randomDistF @(Natural 0 100) @(Natural 0 100)))
148145 return (m21, m40, dist, dist2, distList1, distList2)
149146
150−benchmark :: IO ()
151−benchmark = defaultMain [
147+main :: IO ()
148+main = defaultMain [
152149 env setupEnv $ \ ~(m11, m12, m21, m22, m31, m32) -> bgroup "Matrix Composition" [
153150 bgroup "10x10" [
154151 bench "WHNF - 10x10" $ whnf (comp m11) m12
hackage.shdeleted−10
@@ -1,10 +0,0 @@
1−#!/bin/sh
2−set -e
3−
4−dir=$(mktemp -d dist-docs.XXXXXX)
5−trap 'rm -r "$dir"' EXIT
6−
7−# assumes cabal 2.4 or later
8−cabal v2-haddock --builddir="$dir" --haddock-for-hackage --enable-doc
9−
10−cabal upload -d $dir/*-docs.tar.gz --publish
laop.cabal+82−72
@@ -1,79 +1,89 @@
1−cabal-version: 1.12
1+cabal-version: 2.4
2+name: laop
3+version: 0.1.1.1
4+synopsis: Matrix programming library
5+description: Matrix programming library that uses a type-safe inductive definition
6+ inspired by the Linear Algebra of Programming
7+homepage: https://github.com/bolt12/laop
8+bug-reports: https://github.com/bolt12/laop/issues
9+license: MIT
10+license-file: LICENSE
11+author: Armando Santos
12+maintainer: Armando Santos <armandoifsantos@gmail.com>
13+copyright: 2020 Armando Santos
14+category: Data
15+build-type: Simple
16+extra-doc-files: README.md
17+ CHANGELOG.md
18+tested-with: GHC == 8.6.5
19+ GHC == 8.8.3
220
3−-- This file has been generated from package.yaml by hpack version 0.31.2.
4−--
5−-- see: https://github.com/sol/hpack
6−--
7−-- hash: c53e5ac8b0734f570fcea8d217d84e401323172c60a00eee9d60ffbaef505191
21+source-repository head
22+ type: git
23+ location: https://github.com/bolt12/laop.git
824
9−name: laop
10−version: 0.1.0.7
11−description: Please see the README on GitHub at <https://github.com/xxxx/laop#readme>
12−category: Data
13−homepage: https://github.com/xxxx/laop#readme
14−bug-reports: https://github.com/xxxx/laop/issues
15−author: Armando Santos
16−maintainer: armandoifsantos@gmail.com
17−copyright: MIT
18−license: BSD3
19−license-file: LICENSE
20−build-type: Simple
21−extra-source-files:
22− README.md
23− ChangeLog.md
25+common common-options
26+ build-depends: base >= 4.12.0.0 && < 5,
27+ deepseq
28+
29+ ghc-options: -Wall
30+ -Wcompat
31+ -Widentities
32+ -Wincomplete-uni-patterns
33+ -Wincomplete-record-updates
34+ if impl(ghc >= 8.0)
35+ ghc-options: -Wredundant-constraints
36+ if impl(ghc >= 8.2)
37+ ghc-options: -fhide-source-paths
38+ if impl(ghc >= 8.4)
39+ ghc-options: -Wmissing-export-lists
40+ -Wpartial-fields
41+ if impl(ghc >= 8.8)
42+ ghc-options: -Wmissing-deriving-strategies
2443
25−source-repository head
26− type: git
27− location: https://github.com/xxxx/laop
44+ default-language: Haskell2010
2845
2946library
30− exposed-modules:
31− LAoP.Dist
32− LAoP.Dist.Internal
33− LAoP.Matrix.Internal
34− LAoP.Matrix.Nat
35− LAoP.Matrix.Type
36− LAoP.Relation
37− LAoP.Relation.Internal
38− LAoP.Utils
39− LAoP.Utils.Internal
40− other-modules:
41− Paths_laop
42− hs-source-dirs:
43− src
44− build-depends:
45− base >=4.7 && <5
46− , deepseq
47− default-language: Haskell2010
48−
49−executable laop-exe
50− main-is: Main.hs
51− other-modules:
52− Benchmarks
53− Examples
54− Spreadsheets
55− Paths_laop
56− hs-source-dirs:
57− app
58− ghc-options: -threaded -rtsopts -with-rtsopts=-N2 -funfolding-use-threshold=16 -fexcess-precision -optc-O3 -optc-ffast-math
59− build-depends:
60− QuickCheck
61− , base >=4.7 && <5
62− , criterion
63− , deepseq
64− , laop
65− default-language: Haskell2010
47+ import: common-options
48+ hs-source-dirs: src
49+ exposed-modules: LAoP.Dist
50+ LAoP.Dist.Internal
51+ LAoP.Matrix.Internal
52+ LAoP.Matrix.Nat
53+ LAoP.Matrix.Type
54+ LAoP.Relation
55+ LAoP.Relation.Internal
56+ LAoP.Utils
57+ LAoP.Utils.Internal
6658
6759test-suite laop-test
68− type: exitcode-stdio-1.0
69− main-is: Spec.hs
70− other-modules:
71− Paths_laop
72− hs-source-dirs:
73− test
74− ghc-options: -threaded -rtsopts -with-rtsopts=-N
75− build-depends:
76− base >=4.7 && <5
77− , deepseq
78− , laop
79− default-language: Haskell2010
60+ import: common-options
61+ type: exitcode-stdio-1.0
62+ hs-source-dirs: test
63+ other-modules: Examples.Readme
64+ main-is: Spec.hs
65+ build-depends: laop
66+ ghc-options: -threaded
67+ -rtsopts
68+ -with-rtsopts=-N
69+ -funfolding-use-threshold=16
70+ -fexcess-precision
71+ -optc-O3
72+ -optc-ffast-math
73+
74+benchmark laop-benchmark
75+ import: common-options
76+ type: exitcode-stdio-1.0
77+ hs-source-dirs: benchmark
78+ main-is: Main.hs
79+ build-depends: criterion
80+ , QuickCheck
81+ , deepseq
82+ , laop
83+ ghc-options: -threaded
84+ -rtsopts
85+ -with-rtsopts=-N
86+ -funfolding-use-threshold=16
87+ -fexcess-precision
88+ -optc-O3
89+ -optc-ffast-math
package.yamldeleted−57
@@ -1,57 +0,0 @@
1−name: laop
2−version: 0.1.0.7
3−github: "bolt12/laop"
4−license: BSD3
5−author: "Armando Santos"
6−maintainer: "armandoifsantos@gmail.com"
7−copyright: "MIT"
8−
9−extra-source-files:
10−- README.md
11−- ChangeLog.md
12−
13−# Metadata used when publishing your package
14−# synopsis: Short description of your package
15−category: Data
16−
17−# To avoid duplicated efforts in documentation and dealing with the
18−# complications of embedding Haddock markup inside cabal files, it is
19−# common to point users to the README.md file.
20−description: Please see the README on GitHub at <https://github.com/bolt12/laop#readme>
21−
22−dependencies:
23−- base >= 4.7 && < 5
24−- deepseq
25−
26−library:
27− source-dirs: src
28−
29−executables:
30− laop-exe:
31− main: Main.hs
32− source-dirs: app
33− ghc-options:
34− - -threaded
35− - -rtsopts
36− - -with-rtsopts=-N
37− - -funfolding-use-threshold=16
38− - -fexcess-precision # Good for doubles
39− - -optc-O3 # Good for doubles
40− - -optc-ffast-math # Good for doubles
41− - -O2
42− dependencies:
43− - laop
44− - criterion
45− - deepseq
46− - QuickCheck
47−
48−tests:
49− laop-test:
50− main: Spec.hs
51− source-dirs: test
52− ghc-options:
53− - -threaded
54− - -rtsopts
55− - -with-rtsopts=-N
56− dependencies:
57− - laop
src/LAoP/Matrix/Internal.hs+20−69
@@ -176,6 +176,7 @@ import Data.Kind
176176import Data.List
177177import Data.Maybe
178178import Data.Proxy
179+import Data.Typeable
179180import Data.Void
180181import GHC.TypeLits
181182import Data.Type.Equality
@@ -242,7 +243,7 @@ type Trivial a = FromNat (Count a) ~ a
242243-- class.
243244instance (Num e) => Category (Matrix e) where
244245 type Object (Matrix e) a = (FL a a, Countable a)
245− id = iden
246+ id = iden
246247 (.) = comp
247248
248249instance NFData e => NFData (Matrix e cols rows) where
@@ -258,7 +259,6 @@ instance Eq e => Eq (Matrix e cols rows) where
258259 x@(Join _ _) == y@(Fork _ _) = abideJF x == y
259260
260261instance Num e => Num (Matrix e cols rows) where
261−
262262 a + b = zipWithM (+) a b
263263
264264 a - b = zipWithM (-) a b
@@ -317,31 +317,34 @@ class FromLists cols rows where
317317 -- error if the dimensions do not match.
318318 fromLists :: [[e]] -> Matrix e cols rows
319319
320−instance {-# OVERLAPPING #-} FromLists () () where
320+instance FromLists () () where
321321 fromLists [[e]] = One e
322322 fromLists _ = error "Wrong dimensions"
323323
324−instance {-# OVERLAPPING #-} (FromLists cols ()) => FromLists (Either () cols) () where
324+instance (FromLists cols ()) => FromLists (Either () cols) () where
325325 fromLists [h : t] = Join (One h) (fromLists [t])
326326 fromLists _ = error "Wrong dimensions"
327327
328−instance {-# OVERLAPPABLE #-} (FromLists a (), FromLists b (), Countable a) => FromLists (Either a b) () where
328+instance {-# OVERLAPPABLE #-}
329+ (FromLists a (), FromLists b (), Countable a) => FromLists (Either a b) () where
329330 fromLists [l] =
330331 let rowsA = fromInteger (natVal (Proxy :: Proxy (Count a)))
331332 in Join (fromLists [take rowsA l]) (fromLists [drop rowsA l])
332333 fromLists _ = error "Wrong dimensions"
333334
334−instance {-# OVERLAPPING #-} (FromLists () rows) => FromLists () (Either () rows) where
335+instance (FromLists () rows) => FromLists () (Either () rows) where
335336 fromLists ([h] : t) = Fork (One h) (fromLists t)
336337 fromLists _ = error "Wrong dimensions"
337338
338−instance {-# OVERLAPPABLE #-} (FromLists () a, FromLists () b, Countable a) => FromLists () (Either a b) where
339+instance {-# OVERLAPPABLE #-}
340+ (FromLists () a, FromLists () b, Countable a) => FromLists () (Either a b) where
339341 fromLists l@([_] : _) =
340342 let rowsA = fromInteger (natVal (Proxy :: Proxy (Count a)))
341343 in Fork (fromLists (take rowsA l)) (fromLists (drop rowsA l))
342344 fromLists _ = error "Wrong dimensions"
343345
344−instance {-# OVERLAPPABLE #-} (FromLists (Either a b) c, FromLists (Either a b) d, Countable c) => FromLists (Either a b) (Either c d) where
346+instance (FromLists (Either a b) c, FromLists (Either a b) d, Countable c)
347+ => FromLists (Either a b) (Either c d) where
345348 fromLists l@(h : t) =
346349 let lh = length h
347350 rowsC = fromInteger (natVal (Proxy :: Proxy (Count c)))
@@ -368,16 +371,15 @@ matrixBuilder' f =
368371matrixBuilder ::
369372 forall e a b.
370373 ( FLN a b,
371− CountableN b,
372374 Enum a,
373375 Enum b,
374376 Bounded a,
375377 Bounded b,
376378 Eq a,
377− CountableDimsN a b
379+ Countable b
378380 ) => ((a, b) -> e) -> Matrix e (Normalize a) (Normalize b)
379381matrixBuilder f =
380− let r = fromInteger $ natVal (Proxy :: Proxy (Count (Normalize b)))
382+ let r = fromInteger $ natVal (Proxy :: Proxy (Count b))
381383 positions = [(a, b) | a <- [minBound .. maxBound], b <- [minBound .. maxBound]]
382384 in fromLists . map (map f) . transpose . buildList r $ positions
383385 where
@@ -433,24 +435,7 @@ fromF ::
433435 ) =>
434436 (a -> b) ->
435437 Matrix e (Normalize a) (Normalize b)
436−fromF f =
437− let minA = minBound @a
438− maxA = maxBound @a
439− minB = minBound @b
440− maxB = maxBound @b
441− ccols = fromInteger $ natVal (Proxy :: Proxy (Count (Normalize a)))
442− rrows = fromInteger $ natVal (Proxy :: Proxy (Count (Normalize b)))
443− elementsA = take ccols [minA .. maxA]
444− elementsB = take rrows [minB .. maxB]
445− combinations = (,) <$> elementsA <*> elementsB
446− combAp = map snd . sort . map (\(a, b) -> if f a == b
447− then ((fromEnum a, fromEnum b), 1)
448− else ((fromEnum a, fromEnum b), 0)) $ combinations
449− mList = buildList combAp rrows
450− in tr $ fromLists mList
451− where
452− buildList [] _ = []
453− buildList l r = take r l : buildList (drop r l) r
438+fromF = fromF'
454439
455440-- Conversion
456441
@@ -946,24 +931,7 @@ fromFRel' ::
946931 ) =>
947932 (a -> b) ->
948933 Relation cols rows
949−fromFRel' f =
950− let minA = minBound @a
951− maxA = maxBound @a
952− minB = minBound @b
953− maxB = maxBound @b
954− ccols = fromInteger $ natVal (Proxy :: Proxy (Count cols))
955− rrows = fromInteger $ natVal (Proxy :: Proxy (Count rows))
956− elementsA = take ccols [minA .. maxA]
957− elementsB = take rrows [minB .. maxB]
958− combinations = (,) <$> elementsA <*> elementsB
959− combAp = map snd . sort . map (\(a, b) -> if f a == b
960− then ((fromEnum a, fromEnum b), nat 1)
961− else ((fromEnum a, fromEnum b), nat 0)) $ combinations
962− mList = buildList combAp rrows
963− in tr $ fromLists mList
964− where
965− buildList [] _ = []
966− buildList l r = take r l : buildList (drop r l) r
934+fromFRel' = fromF'
967935
968936-- | Lifts functions to relations with dimensions matching @a@ and @b@
969937-- cardinality's.
@@ -971,28 +939,11 @@ fromFRel ::
971939 forall a b.
972940 ( Liftable Boolean a b,
973941 CountableDimsN a b,
974− FL (Normalize b) (Normalize a)
942+ FLN b a
975943 ) =>
976944 (a -> b) ->
977945 Relation (Normalize a) (Normalize b)
978−fromFRel f =
979− let minA = minBound @a
980− maxA = maxBound @a
981− minB = minBound @b
982− maxB = maxBound @b
983− ccols = fromInteger $ natVal (Proxy :: Proxy (Count (Normalize a)))
984− rrows = fromInteger $ natVal (Proxy :: Proxy (Count (Normalize b)))
985− elementsA = take ccols [minA .. maxA]
986− elementsB = take rrows [minB .. maxB]
987− combinations = (,) <$> elementsA <*> elementsB
988− combAp = map snd . sort . map (\(a, b) -> if f a == b
989− then ((fromEnum a, fromEnum b), nat 1)
990− else ((fromEnum a, fromEnum b), nat 0)) $ combinations
991− mList = buildList combAp rrows
992− in tr $ fromLists mList
993− where
994− buildList [] _ = []
995− buildList l r = take r l : buildList (drop r l) r
946+fromFRel = fromFRel'
996947
997948-- | Lifts a relation function to a Boolean Matrix
998949toRel ::
@@ -1002,7 +953,7 @@ toRel ::
1002953 Enum a,
1003954 Enum b,
1004955 Eq b,
1005− CountableDimsN a b,
956+ CountableDims a b,
1006957 FLN b a
1007958 )
1008959 => (a -> b -> Bool) -> Relation (Normalize a) (Normalize b)
@@ -1011,8 +962,8 @@ toRel f =
1011962 maxA = maxBound @a
1012963 minB = minBound @b
1013964 maxB = maxBound @b
1014− ccols = fromInteger $ natVal (Proxy :: Proxy (Count (Normalize a)))
1015− rrows = fromInteger $ natVal (Proxy :: Proxy (Count (Normalize b)))
965+ ccols = fromInteger $ natVal (Proxy :: Proxy (Count a))
966+ rrows = fromInteger $ natVal (Proxy :: Proxy (Count b))
1016967 elementsA = take ccols [minA .. maxA]
1017968 elementsB = take rrows [minB .. maxB]
1018969 combinations = (,) <$> elementsA <*> elementsB
src/LAoP/Matrix/Type.hs+2−2
@@ -333,7 +333,7 @@ matrixBuilder ::
333333 Bounded a,
334334 Bounded b,
335335 Eq a,
336− CountableDimsN a b
336+ Countable b
337337 ) => ((a, b) -> e) -> Matrix e a b
338338matrixBuilder f = M (I.matrixBuilder f)
339339
@@ -370,7 +370,7 @@ fromF = M . I.fromF
370370-- | Lifts relation functions to Boolean Matrix
371371toRel ::
372372 ( Liftable (Natural 0 1) a b,
373− CountableDimsN a b,
373+ CountableDims a b,
374374 FLN b a
375375 ) => (a -> b -> Bool) -> Matrix (Natural 0 1) a b
376376toRel = M . I.toRel
src/LAoP/Relation/Internal.hs+12−9
@@ -283,7 +283,7 @@ relationBuilder ::
283283 Bounded a,
284284 Bounded b,
285285 Eq a,
286− CountableDimsN a b
286+ CountableDims a b
287287 ) => ((a, b) -> Boolean) -> Relation a b
288288relationBuilder = R . I.matrixBuilder
289289
@@ -301,7 +301,7 @@ fromF' f = R (I.fromFRel' f)
301301
302302-- | Lifts functions to matrices with dimensions matching @a@ and @b@
303303-- cardinality's.
304−fromF ::
304+fromF ::
305305 ( Liftable a b,
306306 CountableDimsN a b,
307307 FLN b a
@@ -312,7 +312,7 @@ fromF f = R (I.fromFRel f)
312312-- | Lifts relation functions to 'Relation'
313313toRel ::
314314 ( Liftable a b,
315− CountableDimsN a b,
315+ CountableDims a b,
316316 FLN b a
317317 )
318318 => (a -> b -> Bool) -> Relation a b
@@ -348,7 +348,7 @@ toBool r = case toList r of
348348-- | Power transpose.
349349--
350350-- Maps a relation to a set valued function.
351−pt ::
351+pt ::
352352 ( Liftable a b,
353353 Eq a,
354354 CountableDimsN a b,
@@ -365,7 +365,7 @@ belongs ::
365365 ( Bounded a,
366366 Enum a,
367367 Eq a,
368− CountableDimsN (List a) a,
368+ CountableDims (List a) a,
369369 FLN a (List a)
370370 )
371371 => Relation (List a) a
@@ -413,7 +413,7 @@ bang ::
413413bang = ones
414414
415415-- | Point constant relation
416−point ::
416+point ::
417417 ( Bounded a,
418418 Enum a,
419419 Eq a,
@@ -927,6 +927,7 @@ untrans s = fstR . conv (splitR (conv s) sndR)
927927predR ::
928928 ( Bounded a,
929929 Enum a,
930+ Countable a,
930931 CountableN a,
931932 FLN a a,
932933 FLN Bool a
@@ -954,23 +955,25 @@ equalizer f g = id `intersection` divisionF f g
954955-- @
955956-- 'guard' p = 'i2' ``overriddenBy`` 'i1' `.` 'predR' p
956957-- @
957−guard ::
958+guard ::
958959 ( Bounded b,
959960 Enum b,
960961 CountableN b,
962+ Countable b,
961963 FLN b b,
962964 FLN Bool b
963965 ) => Relation b Bool -> Relation b (Either b b)
964966guard p = conv (eitherR (predR p) (predR (negate p)))
965967
966968-- | Relational McCarthy's conditional.
967−cond ::
969+cond ::
968970 ( Bounded b,
969971 Enum b,
972+ Countable b,
970973 CountableN b,
971974 FLN b b,
972975 FLN Bool b
973− )
976+ )
974977 => Relation b Bool -> Relation b c -> Relation b c -> Relation b c
975978cond p r s = eitherR r s . guard p
976979
stack-8.8.3.yamlnew file+1
@@ -0,0 +1 @@
1+resolver: lts-15.5
stack.yaml+1−66
@@ -1,66 +1 @@
1−# This file was automatically generated by 'stack init'
2−#
3−# Some commonly used options have been documented as comments in this file.
4−# For advanced use and comprehensive documentation of the format, please see:
5−# https://docs.haskellstack.org/en/stable/yaml_configuration/
6−
7−# Resolver to choose a 'specific' stackage snapshot or a compiler version.
8−# A snapshot resolver dictates the compiler version and the set of packages
9−# to be used for project dependencies. For example:
10−#
11−# resolver: lts-3.5
12−# resolver: nightly-2015-09-21
13−# resolver: ghc-7.10.2
14−#
15−# The location of a snapshot can be provided as a file or url. Stack assumes
16−# a snapshot provided as a file might change, whereas a url resource does not.
17−#
18−# resolver: ./custom-snapshot.yaml
19−# resolver: https://example.com/snapshots/2018-01-01.yaml
20−resolver: lts-14.18
21−
22−# User packages to be built.
23−# Various formats can be used as shown in the example below.
24−#
25−# packages:
26−# - some-directory
27−# - https://example.com/foo/bar/baz-0.0.2.tar.gz
28−# subdirs:
29−# - auto-update
30−# - wai
31−packages:
32−- .
33−# Dependency packages to be pulled from upstream that are not in the resolver.
34−# These entries can reference officially published versions as well as
35−# forks / in-progress versions pinned to a git hash. For example:
36−#
37−# extra-deps:
38−# - acme-missiles-0.3
39−# - git: https://github.com/commercialhaskell/stack.git
40−# commit: e7b331f14bcffb8367cd58fbfc8b40ec7642100a
41−#
42−# extra-deps: []
43−
44−# Override default flag values for local packages and extra-deps
45−# flags: {}
46−
47−# Extra package databases containing global packages
48−# extra-package-dbs: []
49−
50−# Control whether we use the GHC we find on the path
51−# system-ghc: true
52−#
53−# Require a specific version of stack, using version ranges
54−# require-stack-version: -any # Default
55−# require-stack-version: ">=2.1"
56−#
57−# Override the architecture used by stack, especially useful on Windows
58−# arch: i386
59−# arch: x86_64
60−#
61−# Extra directories used by stack for building
62−# extra-include-dirs: [/path/to/dir]
63−# extra-lib-dirs: [/path/to/dir]
64−#
65−# Allow a newer minor version of GHC than the snapshot specifies
66−# compiler-check: newer-minor
1+resolver: lts-14.3
stack.yaml.lock+4−4
@@ -6,7 +6,7 @@
66packages: []
77snapshots:
88- completed:
9− size: 524789
10− url: https://raw.githubusercontent.com/commercialhaskell/stackage-snapshots/master/lts/14/18.yaml
11− sha256: 646be71223e08234131c6989912e6011e01b9767bc447b6d466a35e14360bdf2
12− original: lts-14.18
9+ size: 523878
10+ url: https://raw.githubusercontent.com/commercialhaskell/stackage-snapshots/master/lts/14/3.yaml
11+ sha256: 470c46c27746a48c7c50f829efc0cf00112787a7804ee4ac7a27754658f6d92c
12+ original: lts-14.3
app/Quantum.hs → test/Examples/Quantum.hsrenamed+2−2
@@ -1,5 +1,5 @@
11{-# LANGUAGE StandaloneDeriving #-}
2−module Quantum where
2+module Examples.Quantum where
33
44import LAoP.Utils
55import LAoP.Matrix.Type
@@ -21,7 +21,7 @@ cnot = kr fstM (fromF xor)
2121ccnot :: (Num e, Ord e) => Matrix e ((Bool, Bool), Bool) ((Bool, Bool), Bool)
2222ccnot = kr fstM (fromF f)
2323 where
24− f = xor . (tp (uncurry (&&)) id)
24+ f = xor . tp (uncurry (&&)) id
2525 tp f g (a,b) = (f a, g b)
2626
2727had :: Matrix (Complex Double) Bool Bool
app/Examples.hs → test/Examples/Readme.hsrenamed+1−2
@@ -1,11 +1,10 @@
11{-# LANGUAGE GADTs #-}
22{-# LANGUAGE DeriveGeneric #-}
33{-# LANGUAGE FlexibleContexts #-}
4−{-# LANGUAGE TypeOperators #-}
54{-# LANGUAGE TypeApplications #-}
65{-# LANGUAGE DataKinds #-}
76
8−module Examples
7+module Examples.Readme
98 ( exec
109 )
1110 where
app/Spreadsheets.hs → test/Examples/Spreadsheets.hsrenamed+1−2
@@ -1,7 +1,6 @@
11{-# LANGUAGE DeriveGeneric #-}
22
3−module Spreadsheets
4− where
3+module Examples.Spreadsheets
54
65import LAoP.Utils
76import LAoP.Matrix.Type
test/Spec.hs+7−1
@@ -1,2 +1,8 @@
1+module Main (main) where
2+
3+import qualified Examples.Readme as RD
4+
15main :: IO ()
2−main = putStrLn "Test suite not yet implemented"
6+main = do
7+ putStrLn ("Testing if README works" :: String)
8+ RD.exec