scientific article; zbMATH DE number 7204443
From MaRDI portal
Publication:5111320
DOI10.4230/LIPICS.FSCD.2017.24zbMATH Open1434.03053MaRDI QIDQ5111320FDOQ5111320
Publication date: 26 May 2020
Title of this publication is not available (Why is that?)
Recommendations
- Intersection types for the resource control lambda calculi
- A Translation of Intersection and Union Types for the λμ-Calculus
- Consuming and persistent types for classical logic
- Intersection types for the \(\lambda\mu\)-calculus
- Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An extension of basic functionality theory for \(\lambda\)-calculus
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization
- Non-idempotent intersection types and strong normalisation
- Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
- The Inhabitation Problem for Non-idempotent Intersection Types
- A linearization of the Lambda-calculus and consequences
- The emptiness problem for intersection types
- Control categories and duality: On the categorical semantics of the lambda-mu calculus
- The duality of computation
- Title not available (Why is that?)
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
- Quantitative Types for the Linear Substitution Calculus
- Typed lambda calculi and applications. 10th international conference, TLCA 2011, Novi Sad, Serbia, June 1--3, 2011. Proceedings
- A new type assignment for λ-terms
- A short proof of the strong normalization of classical natural deduction with disjunction
- Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage
- The Structural λ-Calculus
- A Filter Model for the λμ-Calculus
- A nonstandard standardization theorem
- Theoretical computer science. 8th IFIP TC 1/WG 2.2 international conference, TCS 2014, Rome, Italy, September 1--3, 2014. Proceedings
- Title not available (Why is that?)
- Strong normalization through intersection types and memory
- A Resource Aware Computational Interpretation for Herbelin’s Syntax
- Reasoning About Call-by-need by Means of Types
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classical By-Need
- Classical Call-by-Need and Duality
- A Translation of Intersection and Union Types for the λμ-Calculus
- Convolution $\bar\lambda\mu$ -Calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factoring derivation spaces via intersection types
- The bang calculus revisited
- The bang calculus revisited
- On sets of terms having a given intersection type
- Resource approximation for the \(\lambda \mu \)-calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111320)