Cover Image

Bounded First-Class Universe Levels in Dependent Type Theory

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chan, Jonathan, Weirich, Stephanie
Format:	Preprint
Published:	2025
Subjects:	Programming Languages Logic in Computer Science 03B38 (Primary) 68N15, 68V15 (Secondary) D.3.1; F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Internalizing Extensions in Lattices of Type Theories
by: Chan, Jonathan
Published: (2025)

Monoid Theory in Alonzo: A Little Theories Formalization in Simple Type Theory
by: Farmer, William M., et al.
Published: (2023)

Formally Verifying a Transformation from MLTL Formulas to Regular Expressions
by: Wang, Zili, et al.
Published: (2025)

Formalizing MLTL Formula Progression in Isabelle/HOL
by: Kosaian, Katherine, et al.
Published: (2024)

Simply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic
by: Walsh, Sean
Published: (2024)

The Solver's Paradox in Formal Problem Spaces
by: Rosko, Milan
Published: (2025)

Formalizing Pick's Theorem in Isabelle/HOL
by: Binder, Sage, et al.
Published: (2024)

Universal Algebra in UniMath
by: Amato, Gianluca, et al.
Published: (2021)

Higher-Order Pattern Unification Modulo Similarity Relations
by: Dundua, Besik, et al.
Published: (2025)

Algorithm and abstraction in formal mathematics
by: Macbeth, Heather
Published: (2024)

An Alternative Approach to Formal Mathematics that Focuses on Communication and Accessibility
by: Farmer, William M.
Published: (2026)

2-Coherent Internal Models of Homotopical Type Theory
by: Chen, Joshua
Published: (2025)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
by: Huseynzade, Rafig
Published: (2025)

Proof complexity of universal algebra in a CSP dichotomy proof
by: Gaysin, Azza
Published: (2024)

A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
by: Bruse, Florian, et al.
Published: (2026)

Complete Robust Hybrid Systems Reachability
by: Wafa, Noah Abou El, et al.
Published: (2026)

Arithmetics within the Linear Time Hierarchy
by: Pollett, Chris
Published: (2025)

A correspondence between the time and space complexity
by: Latkin, Ivan V.
Published: (2023)

A classification of bisimilarities for general Markov decision processes
by: Moroni, Martín Santiago, et al.
Published: (2024)

The complexity of bisimilarity on pointmass processes
by: Moroni, Martín Santiago, et al.
Published: (2026)

A formalization of Borel determinacy in Lean
by: Manthe, Sven
Published: (2025)

A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums
by: Ramos, Arthur, et al.
Published: (2025)

Terminal Coalgebras and Non-wellfounded Sets in Homotopy Type Theory
by: Gylterud, Håkon Robbestad, et al.
Published: (2020)

The Semantics of Metapropramming in Prolog
by: Warren, David S.
Published: (2024)

Extended Nullstellensatz proof systems
by: Krajicek, Jan
Published: (2023)

A proof complexity conjecture and the Incompleteness theorem
by: Krajicek, Jan
Published: (2023)

A Lopez-Escobar Theorem for Continuous Domains
by: Bazhenov, Nikolay, et al.
Published: (2023)

The Aurellion Function: A Recursive Fast-Growing Hierarchy Beyond Knuth Notation
by: Vodrazka, Daniel
Published: (2025)

Univalent Material Set Theory
by: Gylterud, Håkon Robbestad, et al.
Published: (2023)

Truth-Aware Decoding: A Program-Logic Approach to Factual Language Generation
by: Alpay, Faruk, et al.
Published: (2025)

Declarative distributed algorithms as axiomatic theories in three-valued modal logic over semitopologies
by: Gabbay, Murdoch J.
Published: (2025)

The Tactician's Web of Large-Scale Formal Knowledge
by: Blaauwbroek, Lasse
Published: (2024)

A Formalization of Abstract Rewriting in Agda
by: Arkle, Sam, et al.
Published: (2026)

A Modular First Formalisation of Combinatorial Design Theory
by: Edmonds, Chelsea, et al.
Published: (2021)

Deep Vision: A Formal Proof of Wolstenholmes Theorem in Lean 4
by: Linhares, Alexandre
Published: (2026)

Formal P-Category Theory and Normalization by Evaluation in Rocq
by: Berry, David G., et al.
Published: (2025)

A Qualitative Analysis of Kernel Extension for Higher Order Proof Checking
by: Wang, Shuai
Published: (2024)

Verified Program Extraction in Number Theory: The Fundamental Theorem of Arithmetic and Relatives
by: Wiesnet, Franziskus
Published: (2025)

An Expressive Trace Logic for Recursive Programs
by: Gurov, Dilian, et al.
Published: (2024)