
Type Assignment for the Computational lambdaCalculus
We study polymorphic type assignment systems for untyped lambdacalculi ...
read it

Intersection Types for a Computational LambdaCalculus with Global State
We study the semantics of an untyped lambdacalculus equipped with opera...
read it

Resolution as Intersection Subtyping via Modus Ponens
Resolution and subtyping are two common mechanisms in programming langua...
read it

Intersection Type Distributors
Building on previous works, we present a general method to define proof ...
read it

Java & Lambda: a Featherweight Story
We present FJ&Lambda, a new core calculus that extends Featherweight Jav...
read it

Undecidability of D_<: and Its Decidable Fragments
Dependent Object Types (DOT) is a calculus with path dependent types, in...
read it

On the Soundness of Coroutines with Snapshots
Coroutines are a general control flow construct that can eliminate contr...
read it
Intersection Types for the Computational lambdaCalculus
We study polymorphic type assignment systems for untyped lambdacalculi with effects. We introduce an intersection type assignment system for Moggi's computational lambdacalculus, where a generic monad T is considered, and provide models of the calculus via inverse limit and filter model constructions and relate them. We prove soundness and completeness of the type system, together with subject reduction and expansion properties. Finally we establish the computational adequacy of the filter model via a characterization theorem of convergent terms.
READ FULL TEXT
Comments
There are no comments yet.