Domain-free pure type systems
From MaRDI portal
Publication:4762953
DOI10.1017/S0956796800003750zbMath0979.03013OpenAlexW1971128176MaRDI QIDQ4762953
Gilles Barthe, Morten Heine B. Sørensen
Publication date: 17 February 2002
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796800003750
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)
Related Items
Variants of the basic calculus of constructions ⋮ Strong normalization from weak normalization in typed \(\lambda\)-calculi ⋮ Bridging Curry and Church's typing style ⋮ Existential type systems between Church and Curry style (type-free style) ⋮ Pure type systems with explicit substitutions ⋮ Type checking and typability in domain-free lambda calculi ⋮ Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence ⋮ Domain-Freeλµ-Calculus ⋮ Monadic translation of classical sequent calculus ⋮ A Partial Type Checking Algorithm for Type:Type ⋮ An induction principle for pure type systems ⋮ Existential Type Systems with No Types in Terms ⋮ The naturality of natural deduction. II: on atomic polymorphism and generalized propositional connectives
