A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Markov's Principle for Propositional Type Theory
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
From dynamic binding to state via modal possibility
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Higher-order pattern complement and the strict λ-calculus
ACM Transactions on Computational Logic (TOCL)
On equivalence and canonical forms in the LF type theory
ACM Transactions on Computational Logic (TOCL)
A language-based approach to functionally correct imperative programming
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Staged computation with names and necessity
Journal of Functional Programming
Hybridizing a Logical Framework
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM Transactions on Computational Logic (TOCL)
Programming with Proofs: Language-Based Approaches to Totally Correct Software
Verified Software: Theories, Tools, Experiments
Proceedings of the 3rd workshop on Programming languages meets program verification
Refinement Types as Proof Irrelevance
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Specifications via Realizability
Electronic Notes in Theoretical Computer Science (ENTCS)
Attributive types for proof erasure
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Erasure and polymorphism in pure type systems
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Irrelevance in type theory with a heterogeneous equality judgement
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Dependent session types via intuitionistic linear type theory
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Verifying and invalidating textbook proofs using scunak
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
On the strength of proof-irrelevant type theories
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proof-Carrying code in a session-typed process calculus
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
LFP: a logical framework with external predicates
Proceedings of the seventh international workshop on Logical frameworks and meta-languages, theory and practice
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
Abstract: We develop a uniform type theory that integrates intensionality, extensionality, and proof irrelevance as judgmental concepts. Any object may be treated intensionally (subject only to alpha-conversion), extensionally (subject also to betaeta-conversion), or as irrelevant (equal to any other object at the same type), depending on where it occurs. Modal restrictions developed in prior work for simple types are generalized and employed to guarantee consistency between these views of objects. Potential applications are in logical frameworks, functional programming, and the foundations of first-order modal logics. Our type theory contrasts with previous approaches that a priori distinguish propositions (whose proofs are all identified-only their existence is important) from specifications (whose implementations are subject to some definitional equalities).