An operational semantics for paragon: A design notation for parallel architectures

DOI10.1007/BF03037642zbMATH Open0722.68075MaRDI QIDQ756433FDOQ756433

Authors: David Bolton, Chris Hankin, Paul H. J. Kelly 

Publication date: 1991

Published in: New Generation Computing (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 43878
• scientific article
• Semantics for data parallel computation
• Semi-explicit parallel programming in a purely functional style: GpH
• scientific article; zbMATH DE number 898454

zbMATH Keywords

message passinggraph rewritingparallel combinator reductionparallel object-oriented language

Mathematics Subject Classification ID

Theory of programming languages (68N15) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• A calculus of communicating systems
• LEAN: An intermediate language based on graph rewriting
• Title not available (Why is that?)
• Title not available (Why is that?)
• Denotational semantics of a parallel object-oriented language
• Title not available (Why is that?)
• A safe approach to parallel combinator reduction
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Semi-explicit parallel programming in a purely functional style: GpH
• Paragon: a language using type hierarchies for the specification, implementation and selection of abstract data types

Uses Software

• DACTL
• Miranda

This page was built for publication: An operational semantics for paragon: A design notation for parallel architectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756433)