Resource operators for -calculus
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1722703 (Why is no real title available?)
- scientific article; zbMATH DE number 2185670 (Why is no real title available?)
- scientific article; zbMATH DE number 2185727 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 1301734 (Why is no real title available?)
- scientific article; zbMATH DE number 1324438 (Why is no real title available?)
- scientific article; zbMATH DE number 512773 (Why is no real title available?)
- scientific article; zbMATH DE number 2043520 (Why is no real title available?)
- scientific article; zbMATH DE number 2079018 (Why is no real title available?)
- scientific article; zbMATH DE number 1497485 (Why is no real title available?)
- scientific article; zbMATH DE number 1500649 (Why is no real title available?)
- scientific article; zbMATH DE number 1512610 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 2090072 (Why is no real title available?)
- scientific article; zbMATH DE number 786495 (Why is no real title available?)
- scientific article; zbMATH DE number 1393359 (Why is no real title available?)
- scientific article; zbMATH DE number 1405619 (Why is no real title available?)
- scientific article; zbMATH DE number 1424037 (Why is no real title available?)
- A Terminating and Confluent Linear Lambda Calculus
- A \(\lambda\)-calculus with explicit weakening and explicit substitution
- A general theory of sharing graphs
- A syntax for linear logic
- An equivalence between lambda- terms
- Computational interpretations of linear logic
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Cut rules and explicit substitutions
- Explicit substitution. On the edge of strong normalization
- Explicit substitutions
- Foundations of Software Science and Computation Structures
- Functional back-ends within the lambda-sigma calculus
- Higher order unification via explicit substitutions
- Interacting with Modal Logics in the Coq Proof Assistant
- Intersection types for explicit substitutions
- Lambda calculus and intuitionistic linear logic
- Linear explicit substitutions
- Linear logic
- Pattern matching as cut elimination
- Perpetuality in a named lambda calculus with explicit substitutions
- Polarized proof-nets and \(\lambda \mu\)-calculus
- Proof nets and explicit substitutions
- Reductions, intersection types, and explicit substitutions
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The optimal implementation of functional programming languages
- \(\rightthreetimes\)
- λν, a calculus of explicit substitutions which preserves strong normalisation
Cited in
(17)- Intersection types for the resource control lambda calculi
- The spirit of node replication
- On explicit substitution with names
- Storage operators and directed lambda-calculus
- Structural rules and resource control in logic and computation
- Intuitionistic differential nets and lambda-calculus
- The Prismoid of Resources
- Geometry of resource interaction -- \textit{a minimalist approach}
- Exponentials as substitutions and the cost of cut elimination in linear logic
- Term Rewriting and Applications
- Labelled calculi of resources
- Proof nets and the call-by-value \(\lambda\)-calculus
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
- Focused linear logic and the \(\lambda\)-calculus
- A prismoid framework for languages with resources
- Strong Normalisation of Cut-Elimination That Simulates β-Reduction
- Node Replication: Theory And Practice
This page was built for publication: Resource operators for \(\lambda\)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876041)
