Denotational Semantics with Nominal Scott Domains
From MaRDI portal
Publication:5501931
DOI10.1145/2629529zbMath1321.68202OpenAlexW1973354012MaRDI QIDQ5501931
Andrew M. Pitts, Steffen Lösch
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
Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Program equivalence in a simple language with state
- Symmetries, local names and dynamic (de)-allocation of names
- A new approach to abstract syntax with variable binding
- About permutation algebras, (pre)sheaves and named sets
- A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
- Domain theory in logical form
- The revised report on the syntactic theories of sequential control and state
- Chain-complete posets and directed sets with applications
- LCF considered as a programming language
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- A game semantics of names and pointers
- Lokal präsentierbare Kategorien. (Locally presentable categories)
- On a monadic semantics for freshness
- Nominal Sets
- A universe of binding and computation
- Programming Type-Safe Transformations Using Higher-Order Abstract Syntax
- Towards nominal computation
- Freshness and Name-Restriction in Sets of Traces with Names
- Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax
- Structural recursion with locally scoped names
- Algorithmic Games for Full Ground References
- Domain-Theoretic Foundations of Functional Programming
- Alpha-structural recursion and induction
- Nominal Domain Theory for Concurrency
- FreshML
- Fresh-register automata
