
On sets of terms with a given intersection type
We are interested in how much of the structure of a strongly normalizabl...
read it

Inhabitation for Nonidempotent Intersection Types
The inhabitation problem for intersection types in the lambdacalculus i...
read it

Nonidempotent intersection types in logical form
Intersection types are an essential tool in the analysis of operational ...
read it

Modelling of crash types at signalized intersections based on random effect model
Approachlevel models were developed to accommodate the diversity of app...
read it

Factoring Derivation Spaces via Intersection Types (Extended Version)
In typical nonidempotent intersection type systems, proof normalization...
read it

Intersection Types and (Positive) AlmostSure Termination
Randomized higherorder computation can be seen as being captured by a l...
read it

Resolution as Intersection Subtyping via Modus Ponens
Resolution and subtyping are two common mechanisms in programming langua...
read it
Intersection Types for Unboundedness Problems
Intersection types have been originally developed as an extension of simple types, but they can also be used for refining simple types. In this survey we concentrate on the latter option; more precisely, on the use of intersection types for describing quantitative properties of simply typed lambdaterms. We present two type systems. The first allows to estimate (by appropriately defined value of a derivation) the number of appearances of a fixed constant 'a' in the betanormal form of a considered lambdaterm. The second type system is more complicated, and allows to estimate the maximal number of appearances of the constant 'a' on a single branch.
READ FULL TEXT
Comments
There are no comments yet.