Electronic Notes in Theoretical Computer Science · 1995 · 16 citations · 4 references
EngineeringWell-founded SemanticsSemanticsFunctional AnalysisSemantic WebOperational SemanticsContinuity SpacesFormal SystemTopological AlgebraComputer ScienceGeneral TheorySemantic DomainsDomain TheoryAutomated ReasoningReflexive Domain EquationsFormal MethodsSet-theoretic TopologyValue QuantaleComputational Semantics
This paper continues the study of the general theory, begun in [4], of semantic domains based on the notion of a symmetrically compact ν-continuity space, where ν is a value quantale. It was previously shown that this theory naturally includes the traditional examples of domains of cpo's and metric spaces, is closed under the key type forming operations needed in denotational semantics, and provides new examples which may be suitable for modeling language constructs that occur in concurrent and probabilistic programming. Here it is shown that ν-Dom supports a rich theory of fixed points for morphisms and has solutions to a wide class of reflexive domain equations.
4
Notions of computation and monads
Eugenio Moggi · Information and Computation · 1991 · 1.7K citations
Samson Abramsky, Achim Jung · Logic in Computer Science · 1995 · 911 citations
The Category-Theoretic Solution of Recursive Domain Equations
Michael Smyth, Gordon Plotkin · SIAM Journal on Computing · 1982 · 482 citations
Engineering, Semantics, Syntax +16