Typed Parallel Language (TPL)

The Typed Parallel Language (or TPL) is a formalism that extends the typed \lambda-calculs with first-class processes, in the style of CCS. It was introduced by Nielson 1989.

References

Nielson, Flemming. 1989. ‘The Typed λ-Calculus with First-Class Processes’. In PARLE ’89 Parallel Architectures and Languages Europe, edited by Eddy Odijk, Martin Rem, and Jean-Claude Syre, 366:357–73. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-51285-3_52.

@inproceedings{nielson_1989,
	address = {Berlin, Heidelberg},
	series = {Lecture {Notes} in {Computer} {Science}},
	title = {The typed λ-calculus with first-class processes},
	volume = {366},
	doi = {10.1007/3-540-51285-3_52},
	booktitle = {{PARLE} '89 {Parallel} {Architectures} and {Languages} {Europe}},
	publisher = {Springer Berlin Heidelberg},
	author = {Nielson, Flemming},
	editor = {Odijk, Eddy and Rem, Martin and Syre, Jean-Claude},
	year = {1989},
	pages = {357--373},
}