Strongly-Typed Multi-View Stack-Based Computations
Explore a Domain-Specific Language for stack-based computations, ensuring type correctness and supporting multiple views and mutually recursive functions of arbitrary arities.
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.
Generalizing Payment as Types - Haskell-Based Specification for Continuous Money Transfer
Explore innovative payment systems using Haskell for type-safe, continuous money transfers. Learn about generalizing payments and implementing blockchain protocols with functional programming concepts.
Demystify Python Types for PEP 729
Explore Python type systems, from theory to practice. Understand type theory, gradual typing, and major type checkers. Gain insights into PEP 729's typing governance process and implementation challenges.
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.
Recursive Inequalities in Applied Proof Theory
Explore recursive inequalities in applied proof theory, delving into advanced mathematical concepts and their practical applications.
Compact Ordinals in Homotopy Type Theory and Univalent Foundations - Lecture
Explore compact ordinals in Homotopy Type Theory and Univalent Foundations with Martín Escardó's in-depth mathematical lecture at CIRM's thematic meeting.
From Axioms to Synthetic Inference Rules via Focusing
Explore the connection between axioms and synthetic inference rules through focusing, as presented by Dale Miller in this mathematical conference talk.
New Modal Operators for Constructive Mathematics
Explore new modal operators in constructive mathematics, focusing on preorders, wellfounded relations, and positive extensions. Gain insights into reformulating concepts and applying novel approaches.
Inductive Definitions, Predicativity, and the Mahlo Universe
Explore inductive definitions, predicativity, and the Mahlo universe in type theory with Peter Dybjer. Gain insights into advanced mathematical concepts and their applications.
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.
GFLean - Autoformalisation for Lean via Grammatical Framework
Explore GFLean, an innovative approach to autoformalisation in Lean using Grammatical Framework. Learn about its potential to bridge natural language and formal mathematics.
Structural Rules and Algebraic Properties of Intersection Types
Explore structural rules and algebraic properties of intersection types in lambda calculus, examining their impact on type assignment systems and programming language theory.
Lean4Less - A Term-Patching Framework for Eliminating Definitional Equalities in Lean
Explore a term-patching framework for eliminating definitional equalities in Lean, enhancing theorem proving efficiency and reducing computational overhead.
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.
Formalization of Nominal Equational Reasoning in PVS - Nominal Unification
Explore nominal equational reasoning and unification in PVS, focusing on formalizing techniques for handling bound variables in logical systems and programming languages.
Foundations of Type-Driven Probabilistic Modelling
Explore type-driven abstractions for probabilistic modelling, covering discrete probability and quasi-Borel spaces. Gain hands-on experience through accompanying exercises for self-study.
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.
DOT: Foundation of Scala 3 - Dependent Object Types Calculus
Explore the Dependent Object Types calculus, a type-theoretic foundation for Scala 3, unifying type members and simplifying type computations.
Liquid Type Systems - Understanding Type Theory and SMT Solvers
Explore the innovative Liquid Types system, combining traditional type theory with SMT solvers to enhance type system expressivity while maintaining practical usability in programming languages.