Skip to content
View lukaszcz's full-sized avatar
36 followers · 1 following

Achievements

Achievement: Pair Extraordinairex3Achievement: YOLOAchievement: Pull Sharkx3Achievement: QuickdrawAchievement: Starstruckx2Achievement: Arctic Code Vault Contributor

Achievements

Achievement: Pair Extraordinairex3Achievement: YOLOAchievement: Pull Sharkx3Achievement: QuickdrawAchievement: Starstruckx2Achievement: Arctic Code Vault Contributor

Block or report lukaszcz

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Maximum 250 characters. Please don't include any personal information such as legal names or email addresses. Markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
lukaszcz/README.md

  • Juvix: A functional programming language for intent-centric declarative decentralized applications.

  • CoqHammer: An automated reasoning hammer tool for Coq - proof automation for dependent type theory.

  • Lean2RISC0: Cross-compiling Lean 4 to the RISC Zero zkVM.

  • Coinduction: A Coq plugin to help with proofs by coinduction.

  • HCPL: A prototypical proof checker and programming language based on illative combinatory logic.

  • Javalette: An educational compiler for Javalette, written in C.

  • ASM32: An educational assembler for a subset of 32-bit x86 instructions.

  • CMakefile: Automatic build system for C and C++.

  • COQ-IMP: Coq version of (part of) the HOL-IMP theories accompanying the book "Concrete Semantics with Isabelle/HOL".

  • CLC: Confluence of an Extension of Combinatory Logic by Boolean Constants: a formalisation of the solution to the RTA open problem 15.

  • infinitary-confluence: Formalisation of a coinductive confluence proof for the infinitary lambda calculus.

  • sortalgs: Various sorting algorithms formalised using the "sauto" component of CoqHammer 1.3.

  • BST: Binary Search Trees in Coq.

  • Diaconescu: Formalisation of two variants of Diaconescu's theorem.

  • tptp2coq: Conversion of the FOF TPTP format to Coq files.

  • tptp2ileancop: Run ileancop on the ILTP library.

  • PascalAdt: A library of algorithms and data structures for the Free Pascal Compiler.

  • SrcDoc: Documentation generator a la doxygen for Free Pascal and Delphi.

Pinned Loading

  1. coqhammer coqhammer Public

    CoqHammer: An Automated Reasoning Hammer Tool for Rocq - Proof Automation for Dependent Type Theory

    OCaml 231 34

  2. hcpl hcpl Public

    A prototypical proof checker and programming language based on illative combinatory logic

    OCaml 3

  3. coinduction coinduction Public

    A Coq plugin to help with proofs by coinduction.

    OCaml 9

  4. sortalgs sortalgs Public

    Various sorting algorithms formalised using the "sauto" component of CoqHammer 1.3.

    Coq 2

  5. clc clc Public

    Confluence of an Extension of Combinatory Logic by Boolean Constants: a formalisation of the solution to the RTA open problem 15.

    Coq 1

  6. infinitary-confluence infinitary-confluence Public

    Formalisation of a coinductive confluence proof for the infinitary lambda calculus.

    Coq 8