Non-idempotent types for classical calculi in natural deduction style
From MaRDI portal
Publication:5208874
Authors: Delia Kesner, Pierre Vial 
Publication date: 22 January 2020
Full work available at URL: https://arxiv.org/abs/1802.05494
Recommendations
- scientific article; zbMATH DE number 7204443
- A Translation of Intersection and Union Types for the λμ-Calculus
- Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
- Intersection types for the \(\lambda\mu\)-calculus
- Non-idempotent intersection types and strong normalisation
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An extension of basic functionality theory for \(\lambda\)-calculus
- Perpetual reductions in \(\lambda\)-calculus
- Principality and type inference for intersection types using expansion variables
- 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
- Solvability in resource lambda-calculus
- A linearization of the Lambda-calculus and consequences
- Execution time of λ-terms via denotational semantics and intersection types
- The emptiness problem for intersection types
- Bounding normalization time through intersection types
- A filter lambda model and the completeness of type assignment
- Title not available (Why is that?)
- Control categories and duality: On the categorical semantics of the lambda-mu calculus
- The duality of computation
- Functional Characters of Solvable Terms
- Title not available (Why is that?)
- Church-Rosser property of a simple reduction for full first-order classical natural deduction
- 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
- Verifying higher-order functional programs with pattern-matching algebraic data types
- Title not available (Why is that?)
- Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
- A resource aware computational interpretation for Herbelin's syntax
- Reasoning about call-by-need by means of types
- Non-idempotent intersection types for the lambda-calculus
- Collapsing non-idempotent intersection types
- Classical by-need
- A Theory of Explicit Substitutions with Safe and Full Composition
- Title not available (Why is that?)
- Classical call-by-need and duality
- A Translation of Intersection and Union Types for the λμ-Calculus
- An estimation for the lengths of reduction sequences of the \(\lambda\mu\rho\theta\)-calculus
- On classical PCF, linear logic and the MIX rule
- Characterisation of strongly normalising \(\lambda\mu\)-terms
- Sound and complete typing for \(\lambda\mu\)
- Proceedings of the sixth workshop on intersection types and related systems, Dubrovnik, Croatia, June 29, 2012
Cited In (8)
- Tight typings and split bounds, fully developed
- The spirit of node replication
- Quantitative weak linearisation
- A faithful and quantitative notion of distant reduction for the lambda-calculus with generalized applications
- A faithful and quantitative notion of distant reduction for generalized applications
- Node Replication: Theory And Practice
- Title not available (Why is that?)
- A subexponential view of domains in session types
This page was built for publication: Non-idempotent types for classical calculi in natural deduction style
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208874)
