A Process-Model for Linear Programs

DOI10.1007/978-3-642-02444-3_18zbMath1246.68096OpenAlexW1543974919WikidataQ57722174 ScholiaQ57722174MaRDI QIDQ3638259

Luca Paolini, Mauro Piccolo

Publication date: 2 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02444-3_18

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Strong normalisation in the \(\pi\)-calculus
• The parametric lambda calculus. A metamodel for computation.
• A fully abstract semantics for causality in the \(\pi\)-calculus
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• LCF considered as a programming language
• On reduction-based process semantics
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• A stable programming language
• Functions as processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Process-Model for Linear Programs