paper
referenced-only
paper:abramsky-domain-theory-1994Domain theory
External IDs
title_hash
1a3ee213acd0d4e73baf9208a75aca699f995dc2legacy_slug
abramsky-domain-theory-1994Frontmatter (9 fields)
{
"doi": null,
"year": 1994,
"title": "Domain theory",
"venue": "Handbook of Logic in Computer Science, volume 3, pages 1–168. Oxford University Press",
"authors": [
"Samson Abramsky",
"Achim Jung"
],
"arxiv_id": null,
"enrichment": {
"is_stale": true
},
"s2_paper_id": null,
"ingest_status": "referenced-only"
}Outgoing (10)
Associated with (1)
- Shannon Information Theory(framework)
Cites (2)
- Abramsky & Jung(concept)
- Gierz et al.(concept)
Implements (1)
- Complete Lattices(framework)
introduces (4)
- Continuous functions in Domain Theory reflect that computational processes have access only to finite information at each finite stage.(finding)
- Elements of domains form partially ordered information states where d ⊑ e means 'e conveys at least as much information as d'.(finding)
- Finite points and finite properties coincide in domains, enabling Stone duality between points and observable properties.(finding)
- Least Fixpoint Theorem: A continuous function f on an ω-cpo with least element has a unique least fixpoint definable as ⊔ f^n(⊥).(finding)
Member of (2)
- Formal Concept Analysis(community)
- Game Semantics(community)
Incoming (11)
Associated with (2)
- Euclidean Algorithm(concept)
- Information Dynamics(framework)
Cited by (5)
- Abramsky & Jung(concept)
- Christopher Strachey(thinker)
- Gierz et al.(concept)
- Hilary A. Priestley(concept)
- Information, Processes and Games(paper)
introduces (1)
- Dana Scott(thinker)
studies (3)
- Bob Coecke(thinker)
- Keye Martin(thinker)
- Samson Abramsky(thinker)
Cited by (1)
Mentions (4)
- alexander-typed
2022-04-01_Prabros._lattices-for-CS.pdf_8ecde3.md - papers-typed
2022-04-01_Prabros._lattices-for-CS.pdf_8ecde3.md - papers-typed
2021-10-18_Prabros._1604.02603.pdf_6f9f31.md - alexander
papers/2021-10-18_Prabros._1604.02603.pdf_6f9f31.pdf