Distributive semantics for nondeterministic typed -calculi
The paper presents a treatment of applicative languages based on the typed lambda-calculus enriched with a nondeterministic binary choice operator. The main aim of the paper is to give a semantics for the nondeterministic typed lambda-calculus which preserves the corresponding deterministic equivalences from the calculus without the nondeterministic choice operator. This aim is realized via giving an operational semantics of the calculus, using sharing technique preventing undesired duplicating of nondeterministic redexes, and the corresponding fully abstract (in the sense of Milner) denotational semantics, developing a theory of distributive models with the distributivity as the denotational counterpart of the sharing. The paper provides extensive motivations and the approach is exemplified on the language NDPCF.
- Nondeterministic extensions of untyped \(\lambda\)-calculus
- Probabilistic operational semantics for the lambda calculus
- scientific article; zbMATH DE number 1231463
- A fully abstract semantics for a higher-order functional language with nondeterministic computation
- A non-deterministic call-by-need lambda calculus
- A mathematical semantics for a nondeterministic typed lambda-calculus
- A Powerdomain Construction
- Formal computations of non deterministic recursive program schemes
- Fully abstract models of typed \(\lambda\)-calculi
- scientific article; zbMATH DE number 3646849 (Why is no real title available?)
- scientific article; zbMATH DE number 3648114 (Why is no real title available?)
- scientific article; zbMATH DE number 3716749 (Why is no real title available?)
- scientific article; zbMATH DE number 3723839 (Why is no real title available?)
- scientific article; zbMATH DE number 3724430 (Why is no real title available?)
- scientific article; zbMATH DE number 3756446 (Why is no real title available?)
- scientific article; zbMATH DE number 3765113 (Why is no real title available?)
- scientific article; zbMATH DE number 3466555 (Why is no real title available?)
- scientific article; zbMATH DE number 3567994 (Why is no real title available?)
- scientific article; zbMATH DE number 3590261 (Why is no real title available?)
- scientific article; zbMATH DE number 3594646 (Why is no real title available?)
- scientific article; zbMATH DE number 3630188 (Why is no real title available?)
- scientific article; zbMATH DE number 3635472 (Why is no real title available?)
- LCF considered as a programming language
- Parameter passing in nondeterministic recursive programs
- The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
- A semantics for static type inference in a nondeterministic language
- A fully abstract semantics for a higher-order functional language with nondeterministic computation
- scientific article; zbMATH DE number 3856436 (Why is no real title available?)
- scientific article; zbMATH DE number 3928341 (Why is no real title available?)
- scientific article; zbMATH DE number 1231463 (Why is no real title available?)
- scientific article; zbMATH DE number 627411 (Why is no real title available?)
- scientific article; zbMATH DE number 742726 (Why is no real title available?)
- scientific article; zbMATH DE number 1956558 (Why is no real title available?)
This page was built for publication: Distributive semantics for nondeterministic typed \(\lambda\)-calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760418)
