-
IMDEA Software
- Madrid
- https://software.imdea.org/~aliaksandr.hryzlou/
- https://orcid.org/0000-0001-6188-0417
Lists (1)
Sort Name ascending (A-Z)
Stars
- All languages
- Agda
- ApacheConf
- Assembly
- C
- C#
- C++
- CSS
- Clojure
- Common Lisp
- Coq
- Cuda
- Dhall
- Emacs Lisp
- Erlang
- F#
- F*
- Forth
- Go
- HTML
- Haskell
- Idris
- Isabelle
- Java
- JavaScript
- Julia
- Jupyter Notebook
- Kotlin
- LLVM
- Lean
- Lua
- MDX
- Makefile
- Mathematica
- Nix
- OCaml
- OpenEdge ABL
- PLSQL
- Perl
- Perl 6
- PureScript
- Python
- Racket
- Reason
- Ruby
- Rust
- SMT
- Scala
- Scheme
- Shell
- Solidity
- Standard ML
- Swift
- SystemVerilog
- TLA
- TeX
- TypeScript
- UrWeb
- VCL
- VHDL
- Vim Script
- Vue
Functions and proofs about game trees in Rocq, implemented as rose trees.
an implementation of the Maurer Machine, as described in "Compiler Design: Virtual Machines" by Wilhelm and Seidl
toy implementation of Hindley-Milner type system that prints out inference steps
A well typed by construction kernel language for bidirectional programming
Functional implementation of anti-unification algorithm for multiple terms
(Mirror) Implementation of the ONS (Ordered Nominal Sets) library in Haskell
Agda implementation of McBride's "First-order unification by structural recursion" paper
Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.
A Coq mechanization of the Karp-Miller algorithm based on Kruskal-AlmostFull
The Fan theorem for inductive bars and a constructive variant of König's lemma
Kruskal and Higman type tree theorems for the Kruskal-AlmostFull library
Library of basic results about Almost Full relations in Coq
A work-in-progress core language for Agda, in Agda
formalization of an equivariant cartesian cubical set model of type theory
Alexander Grothendieck's 1972 talk at CERN, on scientific research
Implementation of Span(Graph) via the State(-) construction
An implementation of a simple Neural network in Idris using category theory.