Node Replication: Theory And Practice
From MaRDI portal
Publication:6192004
Cites work
- scientific article; zbMATH DE number 5852776 (Why is no real title available?)
- scientific article; zbMATH DE number 3961577 (Why is no real title available?)
- scientific article; zbMATH DE number 1479634 (Why is no real title available?)
- scientific article; zbMATH DE number 1500649 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- scientific article; zbMATH DE number 937366 (Why is no real title available?)
- scientific article; zbMATH DE number 7155170 (Why is no real title available?)
- A Semantical and Operational Account of Call-by-Value Solvability
- A Theory of Explicit Substitutions with Safe and Full Composition
- A compiled implementation of strong reduction
- A filter lambda model and the completeness of type assignment
- A linearization of the Lambda-calculus and consequences
- A new type assignment for λ-terms
- A nonstandard standardization theorem
- A prismoid framework for languages with resources
- A proof calculus which reduces syntactic bureaucracy
- A proof of strong normalisation of the typed atomic lambda-calculus
- A unified approach to fully lazy sharing
- Atomic lambda calculus: a typed lambda-calculus with explicit sharing
- Bottom-up \(\beta\)-reduction: uplinks and \(\lambda\)-DAGs
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Call-by-name, call-by-value, call-by-need and the linear lambda calculus
- Call-by-need, neededness and all that
- Collapsing non-idempotent intersection types
- Distilling abstract machines
- Functional Characters of Solvable Terms
- Lectures on the Curry-Howard isomorphism
- Linear logic
- Non-idempotent intersection types for the lambda-calculus
- On phase semantics and denotational semantics: The exponentials
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Proof nets and explicit substitutions
- Proof nets and the linear substitution calculus
- Quantitative types for the linear substitution calculus
- Reasoning about call-by-need by means of types
- Resource operators for \(\lambda\)-calculus
- Spinal atomic \(\lambda\)-calculus
- The Call-by-Need Lambda Calculus, Revisited
- The Theory of Calculi with Explicit Substitutions Revisited
- The bang calculus and the two Girard's translations
- The bang calculus revisited
- The call-by-need lambda calculus
- The call-by-need lambda calculus
- The structural \(\lambda \)-calculus
- Weak optimality, and the meaning of sharing
- \(\rightthreetimes\)
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)