-
Updated
Oct 13, 2019 - CSS
type-theory
Here are 124 public repositories matching this topic...
-
Updated
Nov 3, 2019 - C++
I think it ought to be possible to speed up https://github.com/gallais/agdarsec quite a lot
by not converting a String (aka Haskell's Text) to a List Char but rather processing
the string immediately.
To be able to do that & have the parsers still run at compile time, I need:
-
Maybeas a builtin -
uncons : Text -> Maybe (Char, Text)as a primitive - `length-uncons
-
Updated
Apr 15, 2020 - TypeScript
I think a good rule of thumb would be that if you can't imagine making practical use of file B without file A, then B should export A. For instance, Modality exports ReflectiveSubuniverse because so many of the theorems about modalities are actually theorems about reflective subuniverses. It's hard to imagine talking about colimits without needing to talk about diagrams too, so I agr
-
Updated
Mar 24, 2019 - Haskell
At the moment our issues are a mess, and not very well categorised. We should probably adopt a labelling scheme like Rust's!
Plasma has a nice labelling scheme with a 'skill' label. This might help folks find something that they can help out with!
-
Updated
Mar 15, 2020 - TeX
input:
(name bool (mu (true 1) (false 1)))output:
encodeBool :: Serialiser Bool
encodeBool true = word8 (fromIntegral 0)
encodeBool false = word8 (fromIntegral 1)expected:
encodeBool :: Serialiser Bool
encodeBool True = word8 (fromIntegral 0)
encodeBool False = word8 (fromIntegral 1)I think it would be cool to write
Cx.ext_dim blah... @@ fun x ->
Cx.ext_ty foo... @@ fun y ->
Cx.def hey... @@
cx
-
Updated
May 6, 2020 - Agda
-
Updated
Mar 8, 2020 - Coq
-
Updated
Jul 12, 2018 - Haskell
-
Updated
Apr 7, 2020
It will be interesting to implement trees, codata, etc
- Bitbucket: https://bitbucket.org/lambdamix/superspec/issue/27
- Originally Reported By: Ilya Klyuchnikov
- Originally Created At: 2013-08-28T09:02:42.726
Menu with examples
-
Updated
Jan 10, 2018 - Coq
-
Updated
Jun 22, 2019 - Rust
-
Updated
May 2, 2020 - Agda
-
Updated
Dec 2, 2019 - Rust
-
Updated
Jan 18, 2020 - Rust
-
Updated
Feb 23, 2020
-
Updated
May 3, 2020 - TypeScript
-
Updated
Jan 18, 2020 - Rust
-
Updated
Apr 16, 2020 - Standard ML
-
Updated
Feb 8, 2020 - Haskell
-
Updated
Apr 19, 2020 - Haskell
Improve this page
Add a description, image, and links to the type-theory topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the type-theory topic, visit your repo's landing page and select "manage topics."
I was excited to see the introduction to modern Haskell as I find that it's very confusing to enter Haskell these days as many or most introductions doesn't actually match current practices (Text vs. String, cabal vs. plain GHC, etc). However, I was bewildered when the Cabal & Stack section didn't mention Stack. Is this merely waiting for someone to write it? At the very least, we should be