The following pages link to Typing in pure type systems (Q1260645):
Displaying 24 items.
- Bridging Curry and Church's typing style (Q334149) (← links)
- Type inference for pure type systems (Q1271309) (← links)
- Comparing cubes of typed and type assignment systems (Q1365249) (← links)
- The expansion postponement in pure type systems (Q1375333) (← links)
- Abstract data type systems (Q1391729) (← links)
- Pure type systems with explicit substitution (Q2713351) (← links)
- Embedding first-order logic in a pure type system with parameters (Q2761749) (← links)
- Pure type system conversion is always typable (Q2844696) (← links)
- Specifying type systems (Q2956732) (← links)
- Unified Syntax with Iso-types (Q3179296) (← links)
- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence (Q3540198) (← links)
- Fundamentals of coding type problems (Q3637813) (← links)
- (Q3747165) (← links)
- Prototype proofs in type theory (Q4487253) (← links)
- Pure Type Systems with de Bruijn Indices (Q4542807) (← links)
- Implicit coercions in type systems (Q4647565) (← links)
- The method of types [information theory] (Q4701200) (← links)
- Domain-free pure type systems (Q4762953) (← links)
- (Q4791831) (← links)
- (Q4885989) (← links)
- Cut Elimination in a Class of Sequent Calculi for Pure Type Systems (Q4924532) (← links)
- A Partial Type Checking Algorithm for Type:Type (Q5166618) (← links)
- Typing copyless message passing (Q5891509) (← links)
- Recent Advances in Constraints (Q5899112) (← links)
