Polymorphic CSP type checking

Authors:
Ping Gao;Robert Esser
Affiliations:
Adelaide University, Adelaide 5005, Australia;Adelaide University, Adelaide 5005, Australia
Venue:
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Year:
2001

Citing 10
Cited 0

Communicating sequential processes

Communicating sequential processes
An introduction to functional programming systems using Haskell

An introduction to functional programming systems using Haskell
The structure of typed programming languages

The structure of typed programming languages
Qualified types: theory and practice

Qualified types: theory and practice
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
ML with Concurrency

ML with Concurrency
Introduction to Functional Programming

Introduction to Functional Programming
The Definition of Standard ML

The Definition of Standard ML
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
Principal type-schemes for functional programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Communicating Sequential Processes (CSP) is a language used to describe and reason about concurrent systems. It consists of a process algebra combined with a functional language. This combination poses unique problems when attempting to design a type checker. In this paper the differences between a conventional functional language type checker and a type checker for the CSP language are discussed. This type checker was developed to identify polymorphic types, an important first step towards the goal of automating data independence [4]. The result of this work has been incorporated into the Adelaide Refinement Checker [8] (ARC) - a CSP based tool suite for model checking concurrent systems.