Cover Image

Internalizing Extensions in Lattices of Type Theories

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Chan, Jonathan
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Programming Languages 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

Bounded First-Class Universe Levels in Dependent Type Theory
by: Chan, Jonathan, et al.
Published: (2025)

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

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

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 Semantics of Metapropramming in Prolog
by: Warren, David S.
Published: (2024)

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

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

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

Proof-Carrying Certificates for LLM Pipelines: A Trust-Boundary Architecture
by: Koomullil, George
Published: (2026)

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

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

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

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

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

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

A note on occur-check (extended report)
by: Drabent, Włodzimierz
Published: (2022)

Hashing Modulo Context-Sensitive $α$-Equivalence
by: Blaauwbroek, Lasse, et al.
Published: (2024)

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

Gödel Mirror: A Formal System For Contradiction-Driven Recursion
by: Chan, Jhet
Published: (2025)

Nominal techniques as an Agda library
by: Gabbay, Murdoch J., et al.
Published: (2026)

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

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

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

The Aurellion Function: A Recursive Fast-Growing Hierarchy Beyond Knuth Notation
by: Vodrazka, Daniel
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)

(Co)condition hits the Path
by: Zhang, Tesla, et al.
Published: (2024)

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

Formally Verified Patent Analysis via Dependent Type Theory: Machine-Checkable Certificates from a Hybrid AI + Lean 4 Pipeline
by: Koomullil, George
Published: (2026)

Deconstructed Proto-Quipper: A Rational Reconstruction
by: Kavanagh, Ryan, et al.
Published: (2025)

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

Understanding and Improving Automated Proof Synthesis for Interactive Theorem Provers
by: Zhang, Manqing, et al.
Published: (2026)

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

Remarks on Primitive Regulation
by: Rosko, Milan
Published: (2026)

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

Relative Constructibility via Generalised Sequential Algorithms
by: Lau, Desmond
Published: (2024)

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
by: Nakano, Keisuke, et al.
Published: (2024)

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

Three non-cubical applications of extension types
by: Zhang, Tesla
Published: (2023)