Timely Computation - A Formal Approach to Digital Circuit Design
Explore a formal definition of digital circuits, emphasizing compositional correctness and timing analysis through simple denotations and homomorphisms in Agda.
Type System for Four Delimited Control Operators
Explore a uniform type system for four control operators, examining their relationships and implementation in Agda. Gain insights into CPS translation and termination properties.
Towards Tagless Interpretation of Stratified System F
Explore the design of an intrinsically typed, tagless interpreter for stratified System F in Agda, focusing on advanced type theory concepts and implementation strategies.
Vehicle - A Specification Language for Neural Network Properties
Explore Vehicle, a functional DSL for specifying neural network properties. Learn to express, compile, and verify specifications across platforms, enhancing safety in ML-enhanced systems.
Peter Dybjer - Intuitionistic Type Theory
Explore intuitionistic type theory, inductive definitions, and finite axiomatizations in this advanced lecture on mathematical foundations and type systems.
Efficient CHAD - Optimizing Combinatory Homomorphic Automatic Differentiation
Optimizar el algoritmo CHAD para diferenciación automática en modo reverso, logrando la complejidad computacional esperada mediante técnicas funcionales y paralelismo.
The Intellectual Ascent to Agda
Explore denotative design and its application in C++ programming, using Agda's syntax to derive powerful, composable libraries from domain-specific mathematical entities.
An Intrinsically Typed Compiler for Algebraic Effect Handlers
Explore type-preserving compilation for algebraic effect handlers, focusing on safety in continuation capture and resumption using stack polymorphism in an Agda-implemented compiler.
How to Trust a Verified Program - Challenges and Solutions in Program Verification
Explore challenges in trusting verified programs, examining theoretical and practical issues in program verification using proof assistants, and discussing potential solutions for enhancing trustworthiness.
Graded Modal Dependent Type Theory with Universe and Erasure - Formalized
Explore a graded modal type theory with dependent types, erasure, and formalized meta-theoretic properties. Delve into its universe, extraction function, and soundness proofs for open programs.