scientific article; zbMATH DE number 1499092
From MaRDI portal
Publication:4501146
Recommendations
- Proving strong normalisation via non-deterministic translations into Klop's extended lambda-calculus
- Non-determinism, non-termination and the strong normalization of System T
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- Short Proofs of Strong Normalization
- Strong Normalisation of Cut-Elimination That Simulates β-Reduction
Cited in
(18)- Strong normalizability of typed lambda-calculi for substructural logics
- Strong normalization for typed terms with surjective pairing
- Polymorphic rewriting conserves algebraic strong normalization
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- Strong normalization from weak normalization by translation into the lambda-I-calculus
- scientific article; zbMATH DE number 1696607 (Why is no real title available?)
- A proof of strong normalisation of the typed atomic lambda-calculus
- Proving strong normalisation via non-deterministic translations into Klop's extended lambda-calculus
- Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
- Strong normalization theorems for quantized -calculi
- Strong normalization for all-style \(\mathbf{LK}^\mathrm{tq}\)
- Normalization by Evaluation for Typed Weak lambda-Reduction
- Non-determinism, non-termination and the strong normalization of System T
- scientific article; zbMATH DE number 6792338 (Why is no real title available?)
- Non-standard reductions and categorical models in typed lambda-calculus
- Strong Normalization of a Typed Lambda Calculus for Intuitionistic Bounded Linear-time Temporal Logic
- scientific article; zbMATH DE number 2242601 (Why is no real title available?)
- Strong normalizability of the non-deterministic catch/throw calculi
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 Q4501146)
