scientific article; zbMATH DE number 7204443
From MaRDI portal
Publication:5111320
DOI10.4230/LIPICS.FSCD.2017.24zbMATH Open1434.03053MaRDI QIDQ5111320FDOQ5111320
Authors: Delia Kesner, Pierre Vial 
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 \(\lambda \)-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
- Collapsing non-idempotent intersection types
- 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
- On classical PCF, linear logic and the MIX rule
- Characterisation of strongly normalising \(\lambda\mu\)-terms
- Proceedings of the sixth workshop on intersection types and related systems, Dubrovnik, Croatia, June 29, 2012
Cited In (13)
- Inhabitation for non-idempotent intersection types
- Title not available (Why is that?)
- Title not available (Why is that?)
- A resource aware computational interpretation for Herbelin's syntax
- Factoring derivation spaces via intersection types
- Intersection types for the resource control lambda calculi
- The bang calculus revisited
- The bang calculus revisited
- On sets of terms having a given intersection type
- Resource approximation for the \(\lambda \mu \)-calculus
- Consuming and persistent types for classical logic
- A resource aware semantics for a focused intuitionistic calculus
- 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)
