scientific article; zbMATH DE number 3653565
From MaRDI portal
Publication:3853124
zbMATH Open0419.68076MaRDI QIDQ3853124FDOQ3853124
Publication date: 1977
Title of this publication is not available (Why is that?)
latticescontinuous mappingsdata typestopological interpretationmathematical semantics for high level programming languagesmathematical theory of computation
General topics in the theory of software (68N01) Data structures (68P05) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Abstract data types; algebraic specification (68Q65)
Cited In (27)
- Relationships between classes of monotonic functions
- Logical foundations for programming semantics
- A mathematical semantics for a nondeterministic typed lambda-calculus
- Concurrency for Graph Grammars in a Petri net shell
- Programmological aspects of the fixed point method
- The largest cartesian closed category of stable domains
- IO and OI. II
- A first order logic for partial functions
- Computable one-to-one enumerations of effective domains
- On well-filtered reflections of \(T_0\) spaces
- An abstract data type for real numbers
- Semantics of nondeterminism, concurrency, and communication
- IO and OI. I
- A dual problem to least fixed points
- Adherences of languages
- Recursive solution of initial value problems with temporal discretization
- On 0-complete partial metric spaces and quantitative fixed point techniques in denotational semantics
- Fixed points and closure operators: Programmological aspects
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I
- Some economic applications of Scott domains
- All solutions of a system of recursion equations in infinite trees and other contraction theories
- Completeness results for the equivalence of recursive schemas
- Recursion-closed algebraic theories
- On rational definitions in complete algebras without rank
- The bicategory-theoretic solution of recursive domain equations
- Simple operational and denotational semantics for Prolog with cut
- On the cardinality of some lattices
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)
