The following pages link to (Q4346206):
Displayed 20 items.
- The decidability of a fragment of \(\text{BB}'\text{IW}\)-logic (Q596035) (← links)
- Polymorphic type inference for the relational algebra (Q696968) (← links)
- On fuzzy type theory (Q703370) (← 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)
- Infiniteness of \(\text{proof}(\alpha)\) is polynomial-space complete (Q1274981) (← links)
- Semantic bootstrapping of type-logical grammar (Q1778102) (← links)
- Grammar induction by unification of type-logical lexicons (Q1959226) (← links)
- Higher-order unification: a structural relation between Huet's method and the one based on explicit substitutions (Q2480966) (← links)
- Weak linearization of the lambda calculus (Q2566028) (← links)
- A structural approach to reversible computation (Q2581367) (← links)
- Extended First-Order Logic (Q3183527) (← links)
- On Polymorphic Recursion, Type Systems, and Abstract Interpretation (Q3522067) (← links)
- (Q4499281) (← links)
- Tachyon instability and Kondo type models (Q5933094) (← links)
- Type system in programming languages (Q5942703) (← links)