ENTCS
2002
13 years 4 months ago
2002
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assign...
PROCOMET
1998
13 years 5 months ago
1998
We introduce a type assignment system which is parametric with respect to five families of trees obtained by evaluating -terms (B
LFCS
1994
Springer
13 years 8 months ago
1994
Springer
We study the cube of type assignment systems, as introduced in [13], and confront it with Barendregt's typed -cube [4]. The first is obtained from the latter through applying...
HOA
1993
13 years 8 months ago
1993
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
FSTTCS
1993
Springer
13 years 8 months ago
1993
Springer
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculus; these are strict in the sense that they are the representatives of equivalen...
POPL
2008
ACM
14 years 4 months ago
2008
ACM
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...