Node Replication: Theory And Practice

DOI10.46298/LMCS-20(1:5)2024arXiv2207.07143v4OpenAlexW4391142027MaRDI QIDQ6192004FDOQ6192004

Authors: 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

Mathematics Subject Classification ID

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

Cites Work

• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Linear logic
• Lectures on the Curry-Howard isomorphism
• Title not available (Why is that?)
• A linearization of the Lambda-calculus and consequences
• A filter lambda model and the completeness of type assignment
• Functional Characters of Solvable Terms
• On phase semantics and denotational semantics: The exponentials
• Title not available (Why is that?)
• The call-by-need lambda calculus
• The call-by-need lambda calculus
• Title not available (Why is that?)
• The Call-by-Need Lambda Calculus, Revisited
• Quantitative types for the linear substitution calculus
• Title not available (Why is that?)
• \(\rightthreetimes\)
• A new type assignment for λ-terms
• The structural \(\lambda \)-calculus
• The Theory of Calculi with Explicit Substitutions Revisited
• Proof nets and explicit substitutions
• A prismoid framework for languages with resources
• Resource operators for \(\lambda\)-calculus
• Processes, Terms and Cycles: Steps on the Road to Infinity
• A nonstandard standardization theorem
• Title not available (Why is that?)
• A compiled implementation of strong reduction
• Title not available (Why is that?)
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• Distilling abstract machines
• A Semantical and Operational Account of Call-by-Value Solvability
• A unified approach to fully lazy sharing
• A proof of strong normalisation of the typed atomic lambda-calculus
• Proof nets and the linear substitution calculus
• Call-by-need, neededness and all that
• The bang calculus revisited
• Reasoning about call-by-need by means of types
• Non-idempotent intersection types for the lambda-calculus
• Collapsing non-idempotent intersection types
• The bang calculus and the two Girard's translations
• Spinal atomic \(\lambda\)-calculus
• Weak optimality, and the meaning of sharing
• Atomic lambda calculus: a typed lambda-calculus with explicit sharing
• A proof calculus which reduces syntactic bureaucracy
• Bottom-up \(\beta\)-reduction: uplinks and \(\lambda\)-DAGs
• A Theory of Explicit Substitutions with Safe and Full Composition
• Title not available (Why is that?)

This page was built for publication: Node Replication: Theory And Practice

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