Final Semantics for a Higher Order Concurrent Language

Final Semantics for a Higher Order Concurrent Language (1995)

by Marina Lenisa

Venue:	CAAP'96 Conference Proceedings, H.Kirchner ed., Springer LNCS
Citations:	16 - 12 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Final Semantics for a Higher Order Concurrent Language	INFERENCE
AUTHOR NAME	Marina Lenisa	SVM HeaderParse 0.1
AUTHOR AFFIL	Dipartimento di Matematica e Informatica, Universit`a di Udine, Italy.; Dipartimento di Informatica, Universit`a di Pisa, Italy.	SVM HeaderParse 0.2
ABSTRACT	We show that adequate semantics can be provided for imperative higher order concurrent languages simply using syntactical final coalgebras. In particular we investigate and compare various behavioural equivalences on higher order processes defined by finality using hypersets and c.m.s.'s. Correspondingly, we derive various coinduction and mixed induction-coinduction proof principles for establishing these equivalences.	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
VENUE	CAAP'96 Conference Proceedings, H.Kirchner ed., Springer LNCS	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	102--118	INFERENCE
VOLUME	1059	INFERENCE
CITATIONS	16 found	ParsCit 1.0