Factorize factorization

DOI10.4230/LIPICS.CSL.2021.6MaRDI QIDQ6839834zbMATH OpenFDO

Authors Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri

Publication date 23 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.CSL.2021.6

zbMATH Keywords

factorizationlambda calculusrewritingreduction strategies

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 6712184 (Why is no real title available?)
• scientific article; zbMATH DE number 2185670 (Why is no real title available?)
• scientific article; zbMATH DE number 4180808 (Why is no real title available?)
• scientific article; zbMATH DE number 5318491 (Why is no real title available?)
• scientific article; zbMATH DE number 4047065 (Why is no real title available?)
• scientific article; zbMATH DE number 3730111 (Why is no real title available?)
• scientific article; zbMATH DE number 1223609 (Why is no real title available?)
• scientific article; zbMATH DE number 512797 (Why is no real title available?)
• scientific article; zbMATH DE number 1086711 (Why is no real title available?)
• scientific article; zbMATH DE number 2044494 (Why is no real title available?)
• scientific article; zbMATH DE number 6825409 (Why is no real title available?)
• scientific article; zbMATH DE number 6792365 (Why is no real title available?)
• A Semantical and Operational Account of Call-by-Value Solvability
• A deterministic rewrite system for the probabilistic \(\lambda\)-calculus
• A list-oriented extension of the lambda-calculus satisfying the Church-Rosser theorem
• A mathematical logic without variables. II.
• A proof of the leftmost reduction theorem for -calculus
• An abstract factorization theorem for explicit substitutions
• An equivalence between lambda- terms
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Call-by-value Solvability
• Confluence by Decreasing Diagrams
• Confluence of the disjoint union of conditional term rewriting systems
• Counterexamples to termination for the direct sum of term rewriting systems
• Factorization and normalization, essentially
• Head reduction and normalization in a call-by-value lambda-calculus
• Lambda calculus and probabilistic computation
• Leftmost outermost revisited
• Modular aspects of properties of term rewriting systems related to normal forms
• Modular term rewriting systems and the termination
• Modularity in term rewriting revisited
• Nondeterministic extensions of untyped \(\lambda\)-calculus
• On Lazy Commutation
• On probabilistic term rewriting
• On termination of the direct sum of term-rewriting systems
• On the Church-Rosser property for the direct sum of term rewriting systems
• On the Relations between the Syntactic Theories of λμ-Calculi
• On the union of well-founded relations
• Open call-by-value
• Parallel reductions in \(\lambda\)-calculus
• Probabilistic operational semantics for the lambda calculus
• Reductions of Residuals are Finite
• Size-based termination of higher-order rewriting
• Standardization of a Call-By-Value Lambda-Calculus
• Term Rewriting and All That
• Termination for the direct sum of left-linear term rewriting systems
• The Standardization Theorem for λ‐Calculus
• The parametric lambda calculus. A metamodel for computation.
• The weak lambda calculus as a reasonable machine
• Triangulation in rewriting

Cited in

(1)

• A rewriting theory for quantum -calculus

This page was built for publication: Factorize factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839834)