scientific article; zbMATH DE number 7204443
From MaRDI portal
Publication:5111320
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
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 46869 (Why is no real title available?)
- scientific article; zbMATH DE number 1324438 (Why is no real title available?)
- scientific article; zbMATH DE number 1479634 (Why is no real title available?)
- scientific article; zbMATH DE number 7204443 (Why is no real title available?)
- A Filter Model for the λμ-Calculus
- A Translation of Intersection and Union Types for the λμ-Calculus
- A linearization of the Lambda-calculus and consequences
- A new type assignment for λ-terms
- A nonstandard standardization theorem
- A resource aware computational interpretation for Herbelin's syntax
- A short proof of the strong normalization of classical natural deduction with disjunction
- A type assignment for -calculus complete both for FPTIME and strong normalization
- An extension of basic functionality theory for -calculus
- Characterisation of strongly normalising \(\lambda\mu\)-terms
- Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage
- Classical by-need
- Classical call-by-need and duality
- Collapsing non-idempotent intersection types
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
- Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
- Control categories and duality: On the categorical semantics of the lambda-mu calculus
- Convolution $\bar\lambda\mu$ -Calculus
- Non-idempotent intersection types and strong normalisation
- On classical PCF, linear logic and the MIX rule
- Proceedings of the sixth workshop on intersection types and related systems, Dubrovnik, Croatia, June 29, 2012
- Quantitative types for the linear substitution calculus
- Reasoning about call-by-need by means of types
- Strong normalization through intersection types and memory
- The Inhabitation Problem for Non-idempotent Intersection Types
- The duality of computation
- The emptiness problem for intersection types
- The structural \(\lambda \)-calculus
- Theoretical computer science. 8th IFIP TC 1/WG 2.2 international conference, TCS 2014, Rome, Italy, September 1--3, 2014. Proceedings
- Typed lambda calculi and applications. 10th international conference, TLCA 2011, Novi Sad, Serbia, June 1--3, 2011. Proceedings
Cited in
(14)- A quantitative model for simply typed λ-calculus
- Inhabitation for non-idempotent intersection types
- scientific article; zbMATH DE number 7526055 (Why is no real title available?)
- scientific article; zbMATH DE number 7204443 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 7756108 (Why is no real title available?)
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)
