Domain-free pure type systems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1114328
- scientific article; zbMATH DE number 512787
- Type inference for pure type systems
- scientific article; zbMATH DE number 1499107
- Typing in pure type systems
- The structural theory of pure type systems
- scientific article; zbMATH DE number 2185650
- Pure patterns type systems
- Type-checking injective pure type systems
- Pure type systems with more liberal rules
Cited in
(17)- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- Variants of the basic calculus of constructions
- The naturality of natural deduction. II: on atomic polymorphism and generalized propositional connectives
- Pure type systems with explicit substitution
- Domain-free -calculus
- Bridging Curry and Church's typing style
- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
- Existential Type Systems with No Types in Terms
- Existential type systems between Church and Curry style (type-free style)
- scientific article; zbMATH DE number 1114328 (Why is no real title available?)
- Typed Tagless Final Interpreters
- A partial type checking algorithm for Type:Type
- Pure type systems with explicit substitutions
- Monadic translation of classical sequent calculus
- An induction principle for pure type systems
- Type checking and typability in domain-free lambda calculi
- A shallow embedding of pure type systems into first-order logic
This page was built for publication: Domain-free pure type systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4762953)
