• Stars
    star
    2
  • Language
    Python
  • License
    MIT License
  • Created over 12 years ago
  • Updated about 6 years ago

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

Creates highly compressed directed acyclic word graphs from word lists.

More Repositories

1

elaboration-zoo

Minimal implementations for dependent type checking and elaboration
Haskell
566
star
2

smalltt

Demo for high-performance type theory elaboration
Lean
502
star
3

flatparse

Fast parsing from bytestrings
Haskell
146
star
4

staged

Staged compilation with dependent types
TeX
131
star
5

cctt

high-performance cubical evaluation
TeX
67
star
6

setoidtt

Prototype implementations of systems based on setoid type theory
Haskell
64
star
7

staged-fusion

Staged push/pull fusion with typed Template Haskell
Haskell
56
star
8

system-f-omega

System F-omega normalization by hereditary substitution in Agda
Agda
54
star
9

normalization-bench

Lambda normalization and conversion checking benchmarks for various implementations
Haskell
52
star
10

implicit-fun-elaboration

Implementation for ICFP 2020 paper
TeX
48
star
11

sett

Setoid type theory implementation
Haskell
38
star
12

polynomial-model

A polynomial model of a Martin-Löf type theory + a bit of game semantics
Agda
30
star
13

universes

Generalized syntax & semantics for universe hierarchies
TeX
28
star
14

thesis

my phd thesis
TeX
26
star
15

stlc-nbe

Correctness of normalization-by-evaluation for STLC
Agda
21
star
16

misc-stuff

Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.
Agda
19
star
17

flat-maybe

Rust-style strict Maybe in Haskell: no space/indirection overhead.
Haskell
16
star
18

preordertt

Experiments with preordered set models of (directed) type theories
Agda
15
star
19

SemanticsWithApplications

Formal semantics in Agda.
Agda
14
star
20

pny1-assignment

College assignment writing in which I ramble about type classes and dependent types.
Agda
12
star
21

qiit-generalizations

Extending small finitary QIITs to non-small non-finitary
TeX
9
star
22

singleton-nats

Unary natural numbers relying on the singletons infrastructure
Haskell
7
star
23

dawg

Generation and traversal of highly compressed directed acyclic word graphs.
Haskell
7
star
24

trie-vector

Clojure-style persistent vector for Haskell.
Haskell
6
star
25

BasicHs

Basic Haskell ("funkcionális programozás gyakorlat") lecture notes
Haskell
4
star
26

HaladoHs

2018 Spring "Haladó Haskell" ("Advanced Haskell") course materials (in Hungarian)
Haskell
4
star
27

array-primops

Extra foreign primops for primitive arrays.
Haskell
4
star
28

ind-ind-types

Materials for TYPES 2019 submissions about inductive-inductive types
TeX
3
star
29

dynamic-array

Haskell
3
star
30

primdata

Haskell
3
star
31

dynamic-mvector

A wrapper around MVector that enables push/pop/append functionality.
Haskell
3
star
32

antifunext

antifunext
Agda
3
star
33

AndrasKovacs.github.io

My github page
HTML
2
star
34

func-lang-2019-1

Funkcionális nyelvek (IPM-18sztKVFPNYEG), 2019 tavasz, EA + GY
Haskell
2
star
35

elements-of-compsys

Projects for the book "The Elements of Computing Systems"
Assembly
1
star
36

glue

Glued models of type theory, using internal languages
Agda
1
star
37

scrabble-bot

Scrabble move generation
Haskell
1
star
38

bi-zipper

Simple bidirectional zipper from any Traversable.
Haskell
1
star
39

elte-cbsd

"Component based software development" course assignments.
Haskell
1
star
40

sysF-NbE

Normalization by evaluation for intrinsic System F
Agda
1
star
41

haskell-performance

Miscellaneous Haskell benchmarks
Haskell
1
star
42

gc-benchmarks

garbage collection benchmarks
Haskell
1
star
43

bf

Fast Haskell brainfuck interpreter
Brainfuck
1
star
44

while-hs

Translation of an undergrad course compiler to Haskell.
Haskell
1
star