Decidability of Conversion for Type Theory in Type Theory

Proceedings of the ACM on Programming Languages
doi 10.1145/3158111
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computing Machinery (ACM)

Related search

Completeness and Decidability of Converse PDL in the Constructive Type Theory of Coq

2018English

Type Theory and the Theory of Meaning

Annals of the Japan Association for Philosophy of Science
2006English

Computational Semantics in Type Theory

Mathématiques et sciences humaines
2004English

Modal Homotopy Type Theory

2020English

Type Theory and Homotopy

2012English

Homotopy-Initial Algebras in Type Theory

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2017English

Explicit Computational Paths in Type Theory

Bulletin of Symbolic Logic
PhilosophyLogic
2019English

A Dependent Nominal Type Theory

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2012English

A Reasonably Exceptional Type Theory

Proceedings of the ACM on Programming Languages
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy