The following pages link to (Q3688389):
Displaying 50 items.
- Interpretation of constructive multi-typed theory in the theory of arithmetical truth (Q266212) (← links)
- J-Calc: a typed lambda calculus for intuitionistic justification logic (Q276037) (← links)
- Category theory, logic and formal linguistics: some connections, old and new (Q280832) (← links)
- Selectional restrictions, types and categories (Q280845) (← links)
- A constructive manifestation of the Kleene-Kreisel continuous functionals (Q290639) (← links)
- Apartness spaces and uniform neighbourhood structures (Q290645) (← links)
- The epistemic significance of valid inference (Q383064) (← links)
- ``Inference versus consequence'' revisited: inference, consequence, conditional, implication (Q383072) (← links)
- Figures of dialogue: a view from ludics (Q408341) (← links)
- Dialogue structure and logical expressivism (Q408346) (← links)
- A modal type theory for formalizing trusted communications (Q420842) (← links)
- Characterization of quantum states in predicative logic (Q429954) (← links)
- Constructive belief reports (Q514084) (← links)
- A dependent type theory with abstractable names (Q530845) (← links)
- Formalisation in constructive type theory of Stoughton's substitution for the lambda calculus (Q530864) (← links)
- From the knowability paradox to the existence of proofs (Q625705) (← links)
- Setting the facts straight (Q626491) (← links)
- Coalgebras in functional programming and type theory (Q639643) (← links)
- Adjectival and adverbial modification: the view from modern type theories (Q683682) (← links)
- On specifications, subset types and interpretation of proposition in type theory (Q688736) (← links)
- Type-theoretic interpretation of iterated, strictly positive inductive definitions (Q688845) (← links)
- Polynomial-time Martin-Löf type theory (Q688850) (← links)
- Objects: a study in Kantian formal epistemology (Q691124) (← links)
- Computer theorem proving in mathematics (Q704001) (← links)
- Functorial data migration (Q714735) (← links)
- Exception tracking in an open world (Q724930) (← links)
- N. G. de Bruijn's contribution to the formalization of mathematics (Q740481) (← links)
- A note on inconsistencies caused by fixpoints in a cartesian closed category (Q749648) (← links)
- Innovations in computational type theory using Nuprl (Q865639) (← links)
- Constructive characterizations of bar subsets (Q866574) (← links)
- Exact approximations to Stone-Čech compactification (Q882119) (← links)
- The basic Zariski topology (Q887823) (← links)
- Do-it-yourself type theory (Q911744) (← links)
- The seven virtues of simple type theory (Q946569) (← links)
- The Zariski spectrum as a formal geometry (Q949619) (← links)
- Aspects of predicative algebraic set theory. I: Exact completion (Q958492) (← links)
- A minimalist two-level foundation for constructive mathematics (Q1032635) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- On the syntax of Martin-Löf's type theories (Q1099173) (← links)
- The linear abstract machine (Q1105351) (← links)
- The calculus of constructions (Q1108266) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Between constructive mathematics and PROLOG (Q1173742) (← links)
- Type checking with universes (Q1177937) (← links)
- Static semantics, types, and binding time analysis (Q1179698) (← links)
- Recursive programming with proofs (Q1190480) (← links)
- Comprehension categories and the semantics of type dependency (Q1208414) (← links)
- The undecidability of pattern matching in calculi where primitive recursive functions are representable (Q1208421) (← links)
- Verifying programs in the calculus of inductive constructions (Q1267035) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
