Intersection Types for the lambda-mu Calculus

We introduce an intersection type system for the lambda-mu calculus that is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus's denotational model of continuations in the category of omega-algebraic lattices via Abramsky's domain-logic...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 14, Issue 1
Main Authors:	van Bakel, Steffen, Barbanera, Franco, de'Liguoro, Ugo
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 01.01.2018
Subjects:	computer science - logic in computer science f.4 f.4.1
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!