The following pages link to Domain-free pure type systems (Q4762953):
Displaying 15 items.
- Bridging Curry and Church's typing style (Q334149) (← links)
- Existential type systems between Church and Curry style (type-free style) (Q402117) (← links)
- Type checking and typability in domain-free lambda calculi (Q655411) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- Variants of the basic calculus of constructions (Q1885480) (← links)
- The naturality of natural deduction. II: on atomic polymorphism and generalized propositional connectives (Q2118979) (← links)
- Pure type systems with explicit substitution (Q2713351) (← links)
- Domain-free \(\lambda\mu\)-calculus (Q2729625) (← links)
- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence (Q3540198) (← links)
- Existential Type Systems with No Types in Terms (Q3637189) (← links)
- Typed Tagless Final Interpreters (Q4649380) (← links)
- A Partial Type Checking Algorithm for Type:Type (Q5166618) (← links)
- Pure type systems with explicit substitutions (Q5371956) (← links)
- Monadic translation of classical sequent calculus (Q5410235) (← links)
- An induction principle for pure type systems (Q5958776) (← links)
