# Solvability in resource lambda-calculus

##### Citations

53 citations

### Cites background from "Solvability in resource lambda-calc..."

...Solvability is characterized by means of non-idempotent IT in a lambda-calculus with resources [51]....

[...]

49 citations

^{1}

41 citations

34 citations

34 citations

### Cites background from "Solvability in resource lambda-calc..."

...Different assignment systems with nonidempotent intersection types have been studied in the literature for different purposes [8, 10, 18, 19, 24, 26, 27, 30, 35, 34]....

[...]

##### References

2,632 citations

1,119 citations

1,000 citations

307 citations

### "Solvability in resource lambda-calc..." refers background or methods in this paper

...Definition 5....

[...]

...Ehrhard and Regnier designed the differential λ-calculus [2], drawing on insights gained from an analysis of some denotational models of linear logic....

[...]

...This paper deals extensively with the weakest notion of solvability, which asks that a term is solvable whenever a suitable context filled with it reduces to a sum, where at least one addend is the identity....

[...]

213 citations

### "Solvability in resource lambda-calc..." refers background in this paper

...…form [8], operationally if and only if the head reduction strategy applied to it eventually stops [8], logically if and only if it can be typed in a suitable intersection type assignment system [9], denotationally if and only if its denotation is not minimal in a suitable sensible model [10, 11]....

[...]