The following pages link to (Q4346206):
Displaying 18 items.
- Intuitionistic games: determinacy, completeness, and normalization (Q332080) (← links)
- A decidable theory of type assignment (Q365669) (← links)
- An algebra of behavioural types (Q418153) (← links)
- When are different type-logical semantic definitions defining equivalent meanings? (Q439958) (← links)
- The decidability of a fragment of \(\text{BB}'\text{IW}\)-logic (Q596035) (← links)
- Kripke semantics for higher-order type theory applied to constraint logic programming languages (Q683712) (← links)
- Polymorphic type inference for the relational algebra (Q696968) (← links)
- On fuzzy type theory (Q703370) (← links)
- Cut-free Gentzen calculus for multimodal CK (Q764259) (← links)
- Coq formalization of the higher-order recursive path ordering (Q843949) (← links)
- A typed lambda calculus with intersection types (Q930870) (← links)
- Second-order abstract categorial grammars as hyperedge replacement grammars (Q972434) (← links)
- Abstract deduction and inferential models for type theory (Q988551) (← links)
- Game semantics for the Lambek-calculus: Capturing directionality and the absence of structural rules (Q1005955) (← links)
- Counting proofs in propositional logic (Q1014285) (← links)
- Hammer for Coq: automation for dependent type theory (Q1663240) (← links)
- On the number of types (Q1708962) (← links)
- Semantic bootstrapping of type-logical grammar (Q1778102) (← links)
