Search Results for author:
Found 7 papers, 6 papers with code
MLFMF: Data Sets for Machine Learning for Mathematical Formalization
The collection includes the largest Lean~4 library Mathlib, and some of the largest Agda libraries: the standard library, the library of univalent mathematics Agda-unimath, and the TypeTopology library.
An extensible equality checking algorithm for dependent type theories
We present a general and user-extensible equality checking algorithm that is applicable to a large class of type theories.
Logic in Computer Science Logic 03B38 (Primary), 68Q42 (Secondary) F.4.1
Runners in action
Runners of algebraic effects, also known as comodels, provide a mathematical model of resource management.
Programming Languages
What is algebraic about algebraic effects and handlers?
It is targeted roughly at the level of a doctoral student with some amount of mathematical training, or at anyone already familiar with algebraic effects and handlers as programming concepts who would like to know what they have to do with algebra.
Logic in Computer Science Programming Languages 08A70
The HoTT Library: A formalization of homotopy type theory in Coq
We report on the development of the HoTT library, a formalization of homotopy type theory in the Coq proof assistant.
Logic in Computer Science Logic 03B70, 03B15, 55U35 F.4.1
An Effect System for Algebraic Effects and Handlers
We define an expressive effect system and prove safety of operational semantics with respect to it.
Programming Languages Logic in Computer Science
Programming with Algebraic Effects and Handlers
Eff is a programming language based on the algebraic approach to computational effects, in which effects are viewed as algebraic operations and effect handlers as homomorphisms from free algebras.
Programming Languages D.3.3; F.3.3
