scientific article; zbMATH DE number 3653565
From MaRDI portal
Publication:3853124
Cited in
(27)- The largest cartesian closed category of stable domains
- All solutions of a system of recursion equations in infinite trees and other contraction theories
- On the cardinality of some lattices
- Computable one-to-one enumerations of effective domains
- Programmological aspects of the fixed point method
- An abstract data type for real numbers
- Completeness results for the equivalence of recursive schemas
- On 0-complete partial metric spaces and quantitative fixed point techniques in denotational semantics
- Some economic applications of Scott domains
- The bicategory-theoretic solution of recursive domain equations
- IO and OI. II
- Logical foundations for programming semantics
- Fixed points and closure operators: Programmological aspects
- A mathematical semantics for a nondeterministic typed lambda-calculus
- IO and OI. I
- Simple operational and denotational semantics for Prolog with cut
- A dual problem to least fixed points
- Concurrency for Graph Grammars in a Petri net shell
- On rational definitions in complete algebras without rank
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I
- Recursion-closed algebraic theories
- Adherences of languages
- A first order logic for partial functions
- Relationships between classes of monotonic functions
- On well-filtered reflections of \(T_0\) spaces
- Recursive solution of initial value problems with temporal discretization
- Semantics of nondeterminism, concurrency, and communication
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3853124)
