scientific article; zbMATH DE number 512779
From MaRDI portal
Publication:4281472
Recommendations
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- Short Proofs of Strong Normalization
- A schematic proof of strong normalization for the system of the -cube
- Computer Science Logic
- A general method for proving the normalization theorem for first and second order typed λ-calculi
Cited in
(30)- The absolute invariance of conservation laws
- The ant-lion paradigm for strong normalization
- Strong normalization for non-structural subtyping via saturated sets
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- On the strong normalisation of intuitionistic natural deduction with permutation-conversions
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case
- Perpetuality and uniform normalization in orthogonal rewrite systems
- Conservation and uniform normalization in lambda calculi with erasing reductions
- Strong normalization in type systems: A model theoretical approach
- On completeness of reducibility candidates as a semantics of strong normalization
- An elementary proof of the normalization theorem for -reduction
- A schematic proof of strong normalization for the system of the -cube
- scientific article; zbMATH DE number 176974 (Why is no real title available?)
- The λse-calculus does not preserve strong normalisation
- Postponement, conservation and preservation of strong normalization for generalized reduction
- Type assignment and conservation properties
- A general method for proving the normalization theorem for first and second order typed λ-calculi
- Strong normalization in core type theory
- Strong normalization from an unusual point of view
- Computer Science Logic
- Weak normalization implies strong normalization in a class of non-dependent pure type systems
- On the longest perpetual reductions in orthogonal expression reduction systems
- A short proof that adding some permutation rules to \(\beta \) preserves SN
- Mechanized subject expansion in uniform intersection types for perpetual reductions
- Strong normalization through idempotent intersection types: a new syntactical approach
- A direct proof of the confluence of combinatory strong reduction
- A new conservation theorem
- On strong normalization and type inference in the intersection type discipline
- Harrington's conservation theorem redone
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281472)
