A Type-Theoretic Account of Quantum Computation
Explore type-theoretic concepts for describing and proving properties of quantum computations, focusing on quantum circuits using Coq's dependent and polymorphic types.
Binding Syntax for Dependently-Typed Programs - WITS'24
Explore innovative binding syntax for dependently-typed programs, enhancing ergonomics while maintaining fixed grammar for improved error messaging.
Efficient Evaluation with Controlled Definition Unfolding - WITS'24
Explore efficient evaluation techniques in polymorphic and dependently typed languages, focusing on controlled definition unfolding for improved user interaction and unification processes.
Examples of Easy Dependently Typed Programming in Idris
Explore practical applications of dependently typed programming in Idris, focusing on everyday software correctness without complex proofs. Suitable for those familiar with algebraic data types and FP functions.
Dependently-Typed Programming with Logical Equality Reflection
Explore System DE, a calculus for dependently-typed programming with equality reflection. Learn about termination tracking, inductive proofs, and performance-safety trade-offs in functional languages.
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.
Martin-Löf Type Theory Mechanization in Coq
Explore an extensive mechanization of Martin-Löf Type Theory in Coq, covering decidability of conversion and type checking, with a certified executable type checker for MLTT.
Unleashing the Power of Type-Level Programming in Scala
Dive deep into advanced Scala techniques, exploring type-level programming for powerful compile-time computations and fine-grained type control.
A Type-Theoretic Framework for Certified Meta-programming
Explore a type-theoretic framework for certified meta-programming, delving into advanced concepts and techniques in programming language theory and formal verification.
Lean4Lean - Formalizing the Type Theory of Lean
Explore the formalization of Lean's type theory with Mario Carneiro, delving into advanced concepts and techniques for theorem proving and mathematical reasoning.
GHC Status Report - Haskell Compiler Updates and Improvements
Explore GHC's latest developments, including quality-of-life improvements, WebAssembly support, dependent types, and linear types in this comprehensive status report.