Type Reconstruction for SCI

We present a type reconstruction algorithm for SCIR [10], a type system for a language with syntactic control of interference. SCIR guarantees that terms of passive type do not cause any side effects, and that distinct identifiers do not interfere. A reconstruction algorithm for this type system must deal with different kinds (passive and general) and different uses of identifiers (passive and active). In particular, there may not be a unique choice of kinds for type variables. Our work extends SCIR typings with kind constraints . We show that principal type schemes exist for this extended system and outline an algorithm for computing them.

Content

Author and article information

Contributors

Howard Huang

Uday Reddy

Conference

Publication date: July 1995

Publication date (Print): July 1995

Pages: 1-13

Affiliations

[0001]Department of Computer Science

The University of Illinois

Article

DOI: 10.14236/ewic/FP1995.11

SO-VID: bcb94348-6420-4acd-a8f5-7248e883082b

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Proceedings of the 1995 Glasgow Workshop on Functional Programming

Conference acronym: FP

Conference number:

Conference location: Ullapool, Scotland

Conference date: 10-12 July 1995

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: Functional Programming

History

Product

1477-9358 BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/FP1995.11

Self URI (journal page): https://ewic.bcs.org/

Studying business & IT? Drive your professional career forwards with BCS books - for a 20% discount click here: shop.bcs.org

Type Reconstruction for SCI

Abstract