The permutative -calculus
From MaRDI portal
The permutative \(\lambda \)-calculus
Recommendations
Cited in
(23)- An equivalence between lambda- terms
- Label-selective -calculus syntax and confluence
- Parametric parameter passing \(\lambda\)-calculus
- LA, permutations, and the Hajós calculus
- Perpetuality in a named lambda calculus with explicit substitutions
- scientific article; zbMATH DE number 1615235 (Why is no real title available?)
- Classical by-need
- Preservation of strong normalisation modulo permutations for the structural -calculus
- Unification for -calculi without propagation rules
- Permutative Additives and Exponentials
- Jumbo λ-Calculus
- Degrees of sensible lambda theories
- scientific article; zbMATH DE number 1354150 (Why is no real title available?)
- Axiomatizing permutation equivalence
- Sequence types for hereditary permutators
- Compositional Z: confluence proofs for permutative conversion
- The permutability of rules in the classical inferential calculus
- Z property for the shuffling calculus
- A strong bisimulation for a classical term calculus
- Meaningfulness and genericity in a subsuming framework (invited talk)
- A fully abstract model of PCF based on extended addressing machines
- Genericity through stratification
- Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations
This page was built for publication: The permutative \(\lambda \)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891437)
