Denotational semantics with nominal Scott domains

DOI10.1145/2629529zbMATH Open1321.68202OpenAlexW1973354012MaRDI QIDQ5501931FDOQ5501931

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

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

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)

Cites Work

• Domain theory in logical form
• LCF considered as a programming language
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Lokal präsentierbare Kategorien. (Locally presentable categories)
• Nominal sets. Names and symmetry in computer science
• Foundations of nominal techniques: logic and semantics of variables in abstract syntax
• Structural recursion with locally scoped names
• Domain-Theoretic Foundations of Functional Programming
• Alpha-structural recursion and induction
• A new approach to abstract syntax with variable binding
• Chain-complete posets and directed sets with applications
• The revised report on the syntactic theories of sequential control and state
• Towards nominal computation
• About permutation algebras, (pre)sheaves and named sets
• A game semantics of names and pointers
• Algorithmic Games for Full Ground References
• A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
• Program equivalence in a simple language with state
• Fresh-register automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• FreshML
• Symmetries, local names and dynamic (de)-allocation of names
• Freshness and Name-Restriction in Sets of Traces with Names
• Nominal Domain Theory for Concurrency
• A universe of binding and computation
• On a monadic semantics for freshness
• Programming Type-Safe Transformations Using Higher-Order Abstract Syntax

Cited In (4)

• Title not available (Why is that?)
• Full abstraction for nominal Scott domains
• Completeness of Nominal PROPs
• Full abstraction for nominal general references

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)