Pure & constructive mathematics in theory and use pinned «[MLTT resources] The original notes: https://archive-pml.github.io/martin-lof/pdfs/Bibliopolis-Book-retypeset-1984.pdf A formal overview: https://ncatlab.org/nlab/show/Martin-L%C3%B6f+dependent+type+theory Another denoscription: http://www.cse.chalmers.se/~…»
A type checker for a modal dependently typed theory
https://github.com/jozefg/blott
[Thanks to clayrat]
https://github.com/jozefg/blott
[Thanks to clayrat]
GitHub
GitHub - jozefg/blott: An experimental type checker for a modal dependent type theory.
An experimental type checker for a modal dependent type theory. - jozefg/blott
A proof checker for cartesian cubical type theory
https://github.com/RedPRL/redtt
This goes even beyond the generality of cubical type theory, since paths are defined by even more general cube boundaries.
[Thanks to Brett]
https://github.com/RedPRL/redtt
This goes even beyond the generality of cubical type theory, since paths are defined by even more general cube boundaries.
[Thanks to Brett]
GitHub
GitHub - RedPRL/redtt: "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
"Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory - RedPRL/redtt
A formal proof of the independence of the continuum independence written in Lean
https://github.com/flypitch/flypitch
https://github.com/flypitch/flypitch
GitHub
GitHub - flypitch/flypitch: A formal proof of the independence of the continuum hypothesis
A formal proof of the independence of the continuum hypothesis - flypitch/flypitch
An introduction to category theory
http://www.cs.man.ac.uk/~hsimmons/zCATS.pdf
Note that this one seemed pretty simple and not that formal to me, compared to many others.
http://www.cs.man.ac.uk/~hsimmons/zCATS.pdf
Note that this one seemed pretty simple and not that formal to me, compared to many others.
A Unified Approach to Solving Seven Programming Problems (Functional Pearl)
http://io.livecode.ch/learn/namin/icfp2017-artifact-auas7pp
An introduction to logic- and metaprogramming using Scheme, while showing true test-driven development.
http://io.livecode.ch/learn/namin/icfp2017-artifact-auas7pp
An introduction to logic- and metaprogramming using Scheme, while showing true test-driven development.
Twelf
http://twelf.org/wiki/Main_Page
A language to specify implement and prove properties of deductive systems.
http://twelf.org/wiki/Main_Page
A language to specify implement and prove properties of deductive systems.
Asymptotically, almost all Lambda-Terms are strongly normalizing
https://arxiv.org/pdf/0903.5505.pdf
This paper shows that almost all lambda terms are strongly normalizing, while for combinatory logic, the opposite applies.
https://arxiv.org/pdf/0903.5505.pdf
This paper shows that almost all lambda terms are strongly normalizing, while for combinatory logic, the opposite applies.
To be precise, the lower bound for normalizing lambda terms of size n is ((4 - eps) * n/ln(n))^(n-(n/ln(n))), where eps is between 0 and 4.
The upper bound for such terms is ((12 + eps)*n/ln(n))^(n-(n/(3*ln(n))) for any eps > 0.
Gödel machines
http://people.idsia.ch/~juergen/goedelmachine.html
Proof-finding, self-improving, optimally efficient problem solvers.
http://people.idsia.ch/~juergen/goedelmachine.html
Proof-finding, self-improving, optimally efficient problem solvers.
Syntax and Semantics of Quantitative Type Theory
https://bentnib.org/quantitative-type-theory.pdf
A type theory recording usage information for variables, which lead to even better denoscriptions by types
[Thanks to trevthedev, check out his channel @thevikingprogrammer]
https://bentnib.org/quantitative-type-theory.pdf
A type theory recording usage information for variables, which lead to even better denoscriptions by types
[Thanks to trevthedev, check out his channel @thevikingprogrammer]
Is the law of the excluded middle true?
http://www.grall.name/posts/2/excludedMiddle-trueFalse.html
Proving a weak form of the law of the excluded middle false by proving the undecidability of the halting problem.
http://www.grall.name/posts/2/excludedMiddle-trueFalse.html
Proving a weak form of the law of the excluded middle false by proving the undecidability of the halting problem.
www.grall.name
Is the law of excluded middle true?
discussion about the law of excluded middle
Subminimal logic
https://dspace.jaist.ac.jp/dspace/bitstream/10119/15191/5/paper.pdf
[Thanks to no_identd]
https://dspace.jaist.ac.jp/dspace/bitstream/10119/15191/5/paper.pdf
[Thanks to no_identd]
Codata types and Copattern matching
https://www.cl.cam.ac.uk/events/metaprog/2016/codata-types-and-copattern-matching.pdf
Well-defined, inverse pattern matching defining the behavior of destructors applied on function results.
https://www.cl.cam.ac.uk/events/metaprog/2016/codata-types-and-copattern-matching.pdf
Well-defined, inverse pattern matching defining the behavior of destructors applied on function results.
Computational Quadrinitarianism (Curious Correspondences go Cubical)
http://comonad.com/reader/2018/computational-quadrinitarianism-curious-correspondences-go-cubical/
The quadrinity of logic, languages, categories and spaces.
[Thanks to no_identd]
http://comonad.com/reader/2018/computational-quadrinitarianism-curious-correspondences-go-cubical/
The quadrinity of logic, languages, categories and spaces.
[Thanks to no_identd]
Implementing the Meta-Theory of Deductive Systems
https://www.cs.cmu.edu/~fp/papers/cade92.pdf
https://www.cs.cmu.edu/~fp/papers/cade92.pdf
Semantic
https://github.com/github/semantic
Parsing, analyzing and comparing source code across many languages
https://github.com/github/semantic
Parsing, analyzing and comparing source code across many languages
GitHub
GitHub - github/semantic: Parsing, analyzing, and comparing source code across many languages
Parsing, analyzing, and comparing source code across many languages - github/semantic
Lenses from Scratch
An introduction to lenses in Haskell.
https://github.com/ajnsit/haskell-tutorials/blob/master/lenses-from-scratch.md
An introduction to lenses in Haskell.
https://github.com/ajnsit/haskell-tutorials/blob/master/lenses-from-scratch.md
GitHub
ajnsit/haskell-tutorials
Lens is the new Monad. Contribute to ajnsit/haskell-tutorials development by creating an account on GitHub.
Setoid type theory
https://akaposi.github.io/brutal.pdf
https://akaposi.github.io/brutal.pdf