7 author: Andreas Abel and Karl Mehltretter
8 maintainer: Andreas Abel <andreas.abel@ifi.lmu.de>
9 homepage: http://www.tcs.ifi.lmu.de/~abel/miniagda/
10 bug-reports: https://github.com/andreasabel/miniagda/issues
11 category: Dependent types
12 synopsis: A toy dependently typed programming language with type-based termination.
14 MiniAgda is a tiny dependently-typed programming language in the style
15 of Agda. It serves as a laboratory to test potential additions to the
16 language and type system of Agda. MiniAgda's termination checker is a
17 fusion of sized types and size-change termination and supports
18 coinduction. Equality incorporates eta-expansion at record and
19 singleton types. Function arguments can be declared as static; such
20 arguments are discarded during equality checking and compilation.
22 Recent features include bounded size quantification and destructor
23 patterns for a more general handling of coinduction.
25 tested-with: GHC == 7.6.3
30 extra-source-files: Makefile
32 data-files: test/succeed/Makefile
40 source-repository head
42 location: https://github.com/andreasabel/miniagda
46 build-depends: array >= 0.3 && < 0.6,
47 base >= 4.6 && < 4.11,
48 containers >= 0.3 && < 0.6,
49 haskell-src-exts >= 1.17 && < 1.18,
50 mtl >= 2.2.0.1 && < 2.3,
51 pretty >= 1.0 && < 1.2
52 build-tools: happy >= 1.15 && < 2,
54 default-language: Haskell98
55 default-extensions: CPP
60 GeneralizedNewtypeDeriving
61 NoMonomorphismRestriction
66 other-modules: Abstract