scientific article; zbMATH DE number 1142322

Cited in

(64)

Behaviour approximated on subgroups
A characterization of distance between 1-bounded compact ultrametric spaces through a universal space
Recursive types for Fun
Some economic applications of Scott domains
The mixed powerdomain
Direct product decompositions of lattices, closures and relation schemes
Coherence and consistency in domains
A general theory of action languages
A note on fuzzy power relations
On a generalized product for domains
Rendez-vous with metric semantics
Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin
A type-theoretical alternative to ISWIM, CUCH, OWHY
Algebraic domains of natural transformations
A fuzzy language.
Type dependencies for logic programs using ACI-unification
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
An extension of a Y. C. Yang theorem
On the congruence lattice of a Scott-domain
Normalization, approximation, and semantics for combinator systems
Reasoning with power defaults
A compositional dataflow semantics for Petri nets
The powerset operator on abstract interpretations
Compact continuous \(L\)-domains
Logic of convex order
Cartesian closed categories of separable Scott domains
On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms
A remark about algebraicity in complete partial orders
Semantics of a sequential language for exact real-number computation
On quasi-metric aggregation functions and fixed point theorems
A relational account of call-by-value sequentiality
Representations of algebraic domains and algebraic L-domains by information systems
A declarative debugging system for lazy functional logic programs
Oscillating behavior of logic programs
An Action Semantics Based on Two Combinators
Abstract Interpretation from a Topological Perspective
Data cleaning and query answering with matching dependencies and matching functions
Monotone Relations, Fixed Points and Recursive Definitions
Modelling of Complex Software Systems: A Reasoned Overview
Inverse-limit and topological aspects of abstract interpretation
scientific article; zbMATH DE number 622433 (Why is no real title available?)
Toward a semantics for the QUEST language
Domain mu-calculus
scientific article; zbMATH DE number 1522507 (Why is no real title available?)
Reasoning about orchestrations of web services using partial correctness
Towards lambda calculus order-incompleteness
Operational properties of \texttt{Lily}, a polymorphic linear lambda calculus with recursion
An abstract interpretation for ML equality kinds
Dataflow semantics for Petri nets
Qualitative versus quantitative fixed point techniques in computer science
An Ontology of States
On the symmetry of sequentiality
Concrete data structures and functional parallel programming
From concepts to consistent object specifications: Translation of a domain-oriented feature framework into practice
A declarative framework for object-oriented programming with genetic inheritance
Static and dynamic orderings on Dungean argumentation frameworks -- an overview
How much partiality is needed for a theory of computability?
Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
The largest cartesian closed category of stable domains
Exponentials in a Cartesian closed category which contains all algebraic domains
Generalised information systems capture L-domains
A new generic scheme for functional logic programming with constraints
A representation of L-domains by information systems
Information systems revisited -- the general continuous case

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 Q4385538)