Denotational semantics with nominal Scott domains

DOI10.1145/2629529MaRDI QIDQ5501931zbMATH OpenOpenAlexFDO

Authors Steffen Lösch, Andrew M. Pitts

Publication date 14 August 2015

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://www.repository.cam.ac.uk/handle/1810/245412

zbMATH Keywords

symmetryfull abstractiondenotational semanticsdomain theorynominal setsmetaprogramming

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Full abstraction for nominal Scott domains
• Full abstraction for nominal general references
• Leaving the nest: nominal techniques for variables with interleaving scopes
• The Semantics of Nominal Logic Programs
• Foundations of nominal techniques: logic and semantics of variables in abstract syntax

Cites work

• scientific article; zbMATH DE number 1612495 (Why is no real title available?)
• scientific article; zbMATH DE number 1759443 (Why is no real title available?)
• A game semantics of names and pointers
• A new approach to abstract syntax with variable binding
• A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
• A universe of binding and computation
• About permutation algebras, (pre)sheaves and named sets
• Algorithmic games for full ground references
• Alpha-structural recursion and induction
• Chain-complete posets and directed sets with applications
• Domain theory in logical form
• Domain-Theoretic Foundations of Functional Programming
• Foundations of nominal techniques: logic and semantics of variables in abstract syntax
• Fresh-register automata
• FreshML: programming with binders made simple
• Freshness and Name-Restriction in Sets of Traces with Names
• Full abstraction for PCF
• LCF considered as a programming language
• Lokal präsentierbare Kategorien. (Locally presentable categories)
• Nominal Domain Theory for Concurrency
• Nominal sets. Names and symmetry in computer science
• On a monadic semantics for freshness
• On full abstraction for PCF: I, II and III
• Program equivalence in a simple language with state
• Programming type-safe transformations using higher-order abstract syntax
• Structural recursion with locally scoped names
• Symmetries, local names and dynamic (de)-allocation of names
• The revised report on the syntactic theories of sequential control and state
• Towards nominal computation

Cited in

(5)

• scientific article; zbMATH DE number 7136664 (Why is no real title available?)
• Full abstraction for nominal Scott domains
• Completeness of Nominal PROPs
• Leaving the nest: nominal techniques for variables with interleaving scopes
• Full abstraction for nominal general references

Describes a project that uses

Uses Software

• FreshML

This page was built for publication: Denotational semantics with nominal Scott domains

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