An abstract factorization theorem for explicit substitutions
From MaRDI portal
Publication:5111891
Recommendations
- A nonstandard standardization theorem
- A Theory of Explicit Substitutions with Safe and Full Composition
- The Theory of Calculi with Explicit Substitutions Revisited
- \(\lambda\)-calculi with explicit substitutions preserving strong normalization
- Explicit substitution. On the edge of strong normalization
Cited in
(24)- Decomposition theorem on invertible substitutions
- Factorization in call-by-name and call-by-value calculi via linear logic
- On the value of variables
- scientific article; zbMATH DE number 1086711 (Why is no real title available?)
- The Negligible and Yet Subtle Cost of Pattern Matching
- A Fresh Look at the λ-Calculus
- Tight typings and split bounds, fully developed
- A nonstandard standardization theorem
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
- A faithful and quantitative notion of distant reduction for generalized applications
- Factorization and normalization, essentially
- A faithful and quantitative notion of distant reduction for the lambda-calculus with generalized applications
- Exponentials as substitutions and the cost of cut elimination in linear logic
- A deep quantitative type system
- Factorize factorization
- IMELL cut elimination with linear overhead
- Mirroring call-by-need, or values acting silly
- Meaningfulness and genericity in a subsuming framework (invited talk)
- Sharing and linear logic with restricted access
- Genericity through stratification
- Confluence for proof-nets via parallel cut elimination
- The benefits of diligence
- Mirroring call-by-need, or values acting silly
- Proof nets and the call-by-value \(\lambda\)-calculus
This page was built for publication: An abstract factorization theorem for explicit substitutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111891)
