The following pages link to (Q4296744):
Displayed 41 items.
- Selectional restrictions, types and categories (Q280845) (← links)
- Adjectival and adverbial modification: the view from modern type theories (Q683682) (← links)
- N. G. de Bruijn's contribution to the formalization of mathematics (Q740481) (← links)
- A minimalist two-level foundation for constructive mathematics (Q1032635) (← links)
- Representing inductively defined sets by wellorderings in Martin-Löf's type theory (Q1392287) (← links)
- Search algorithms in type theory (Q1575934) (← links)
- Transitivity in coercive subtyping (Q1776403) (← links)
- Equilogical spaces (Q1826625) (← links)
- Computational adequacy for recursive types in models of intuitionistic set theory (Q1886324) (← links)
- Parametric Church's thesis: synthetic computability without choice (Q2151397) (← links)
- Composition of deductions within the propositions-as-types paradigm (Q2228351) (← links)
- Conditionally reversible computations and weak universality in category theory (Q2256643) (← links)
- Natural language inference in Coq (Q2258817) (← links)
- Automorphisms of types and their applications (Q2307975) (← links)
- Proof Assistants for Natural Language Semantics (Q2963996) (← links)
- A pluralist approach to the formalisation of mathematics (Q3094181) (← links)
- Automorphisms of types in certain type theories and representation of finite groups (Q3119463) (← links)
- Coercions in a polymorphic type system (Q3520150) (← links)
- Structural subtyping for inductive types with functorial equality rules (Q3535679) (← links)
- Hoare type theory, polymorphism and separation (Q3546051) (← links)
- Manifest Fields and Module Mechanisms in Intensional Type Theory (Q3638256) (← links)
- Encoding FIX in Object Calculi (Q4494479) (← links)
- Type theoretic semantics for SemNet (Q4632324) (← links)
- Modular properties of algebraic type systems (Q4645803) (← links)
- Implicit coercions in type systems (Q4647565) (← links)
- A two-level approach towards lean proof-checking (Q4647567) (← links)
- Automating inversion of inductive predicates in Coq (Q4647573) (← links)
- Remarks on Isomorphisms of Simple Inductive Types (Q4924549) (← links)
- The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (Q5111301) (← links)
- Denotational semantics for guarded dependent type theory (Q5139284) (← links)
- ETA-RULES IN MARTIN-LÖF TYPE THEORY (Q5240810) (← links)
- Pure type systems with explicit substitutions (Q5371956) (← links)
- Eliminating dependent pattern matching without K (Q5371975) (← links)
- An experimental library of formalized Mathematics based on the univalent foundations (Q5740657) (← links)
- Semantics of constructions. I: The traditional approach (Q5934287) (← links)
- Coercion completion and conservativity in coercive subtyping (Q5957918) (← links)
- An induction principle for pure type systems (Q5958776) (← links)
- Propositional forms of judgemental interpretations (Q6053842) (← links)
- The metatheory of UTT (Q6061874) (← links)
- On extensibility of proof checkers (Q6061878) (← links)
- Encoding Z-style Schemas in type theory (Q6083696) (← links)