Pages that link to "Item:Q5308466"
From MaRDI portal
The following pages link to Foundations of Software Science and Computation Structures (Q5308466):
Displaying 15 items.
- Strong normalization of \(\mathsf{ML}^{\mathsf F}\) via a calculus of coercions (Q764331) (← links)
- Resource operators for \(\lambda\)-calculus (Q876041) (← links)
- Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage (Q930871) (← links)
- Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus (Q1853595) (← links)
- Normalization proofs for the un-typed \(\mu\mu^\prime\)-calculus (Q2129992) (← links)
- Classical \(F_{\omega}\), orthogonality and symmetric candidates (Q2482840) (← links)
- Call-by-name reduction and cut-elimination in classical logic (Q2482842) (← links)
- Explicit substitutions and reducibility (Q2752530) (← links)
- Why the usual candidates of reducibility do not work for the symmetric \(\lambda\mu\)-calculus (Q2851698) (← links)
- Preservation of strong normalisation modulo permutations for the structural \(\lambda\)-calculus (Q2881096) (← links)
- Monadic Translation of Intuitionistic Sequent Calculus (Q3638248) (← links)
- (Q4472466) (← links)
- Asymptotically almost all \lambda-terms are strongly normalizing (Q4913764) (← links)
- Typed Lambda Calculi and Applications (Q5704007) (← links)
- (Q5714454) (← links)