Node Replication: Theory And Practice
From MaRDI portal
Publication:6192004
DOI10.46298/lmcs-20(1:5)2024arXiv2207.07143v4OpenAlexW4391142027MaRDI QIDQ6192004
Delia Kesner, Loïc Peyrot, Daniel Lima Ventura
Publication date: 11 March 2024
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.07143v4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- A prismoid framework for languages with resources
- Resource operators for \(\lambda\)-calculus
- Lectures on the Curry-Howard isomorphism
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Call-by-name, call-by-value, call-by-need and the linear lambda calculus
- Proof nets and the linear substitution calculus
- Call-by-need, neededness and all that
- The bang calculus revisited
- Spinal atomic \(\lambda\)-calculus
- Reasoning About Call-by-need by Means of Types
- Distilling abstract machines
- A Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus
- The Call-by-Need Lambda Calculus, Revisited
- A unified approach to fully lazy sharing
- A compiled implementation of strong reduction
- Bottom-up β-reduction: Uplinks and λ-DAGs
- Quantitative Types for the Linear Substitution Calculus
- A new type assignment for λ-terms
- A filter lambda model and the completeness of type assignment
- A Theory of Explicit Substitutions with Safe and Full Composition
- The Structural λ-Calculus
- The Theory of Calculi with Explicit Substitutions Revisited
- Functional Characters of Solvable Terms
- The call-by-need lambda calculus
- The call-by-need lambda calculus
- A linearization of the Lambda-calculus and consequences
- Non-idempotent intersection types for the Lambda-Calculus
- Proof nets and explicit substitutions
- Weak optimality, and the meaning of sharing
- Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing
- A Proof Calculus Which Reduces Syntactic Bureaucracy
- A nonstandard standardization theorem
- A Semantical and Operational Account of Call-by-Value Solvability
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Automated Deduction – CADE-19
- On phase semantics and denotational semantics: The exponentials
This page was built for publication: Node Replication: Theory And Practice
