| Title: |
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures |
| Authors: |
Niehren, Joachim; Sabel, David; Schmidt-Schauss, Manfred; Schwinghammer, Jan |
| Contributors: |
Modeling Tree Structures, Machine Learning, and Information Extraction (MOSTRARE); Laboratoire d'Informatique Fondamentale de Lille (LIFL); Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe; Institut National de Recherche en Informatique et en Automatique (Inria); Goethe-Universität Frankfurt am Main; Programming Systems Lab Saarland; Saarland University Saarbrücken |
| Source: |
23rd Conference on Mathematical Foundations of Programming Semantics; https://inria.hal.science/inria-00128861; 23rd Conference on Mathematical Foundations of Programming Semantics, Apr 2007, New Orleans, United States. pp.313-337 |
| Publisher Information: |
HAL CCSD |
| Publication Year: |
2007 |
| Collection: |
Université de Lille 3 - Sciences Humaines et Sociales: HAL |
| Subject Terms: |
ACM: D.: Software/D.3: PROGRAMMING LANGUAGES; [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL] |
| Subject Geographic: |
New Orleans; United States |
| Description: |
International audience ; We present an observational semantics for lambda(fut), a concurrent lambda calculus with reference cells and futures. The calculus lambda(fut) models the operational semantics of the concurrent higher-order programming language Alice ML. Our result is a powerful notion of equivalence that is the coarsest nontrivial congruence distinguishing observably different processes. It justifies a maximal set of correct program transformations, and it includes all of lambda(fut)'s deterministic reduction rules, in particular, call-by-value beta reduction. |
| Document Type: |
conference object |
| Language: |
English |
| Availability: |
https://inria.hal.science/inria-00128861; https://inria.hal.science/inria-00128861/document; https://inria.hal.science/inria-00128861/file/nssssMFPS23final.pdf |
| Rights: |
info:eu-repo/semantics/OpenAccess |
| Accession Number: |
edsbas.CB2662D3 |
| Database: |
BASE |