scientific article; zbMATH DE number 1142322
From MaRDI portal
Publication:4385538
zbMath0900.68301MaRDI QIDQ4385538
Publication date: 14 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (63)
Representations of algebraic domains and algebraic L-domains by information systems ⋮ A remark about algebraicity in complete partial orders ⋮ On the symmetry of sequentiality ⋮ Generalised information systems capture L-domains ⋮ Reasoning with power defaults ⋮ Semantics of a sequential language for exact real-number computation ⋮ Oscillating Behavior of Logic Programs ⋮ Algebraic domains of natural transformations ⋮ An Action Semantics Based on Two Combinators ⋮ A compositional dataflow semantics for Petri nets ⋮ Data cleaning and query answering with matching dependencies and matching functions ⋮ A new generic scheme for functional logic programming with constraints ⋮ A characterization of distance between 1-bounded compact ultrametric spaces through a universal space ⋮ An abstract interpretation for ML equality kinds ⋮ Dataflow semantics for Petri nets ⋮ Static and dynamic orderings on Dungean argumentation frameworks -- an overview ⋮ A representation of L-domains by information systems ⋮ How much partiality is needed for a theory of computability? ⋮ Inverse-limit and topological aspects of abstract interpretation ⋮ An extension of a Y. C. Yang theorem ⋮ The powerset operator on abstract interpretations ⋮ On quasi-metric aggregation functions and fixed point theorems ⋮ Compact continuous \(L\)-domains ⋮ A fuzzy language. ⋮ Reasoning about orchestrations of web services using partial correctness ⋮ Recursive types for Fun ⋮ Toward a semantics for the QUEST language ⋮ Unnamed Item ⋮ The largest cartesian closed category of stable domains ⋮ Information systems revisited -- the general continuous case ⋮ Some economic applications of Scott domains ⋮ An Ontology of States ⋮ The mixed powerdomain ⋮ Towards Lambda Calculus Order-Incompleteness ⋮ Cartesian closed categories of separable Scott domains ⋮ Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion ⋮ Direct product decompositions of lattices, closures and relation schemes ⋮ Concrete data structures and functional parallel programming ⋮ From concepts to consistent object specifications: Translation of a domain-oriented feature framework into practice ⋮ Monotone Relations, Fixed Points and Recursive Definitions ⋮ A relational account of call-by-value sequentiality ⋮ A declarative framework for object-oriented programming with genetic inheritance ⋮ Modelling of Complex Software Systems: A Reasoned Overview ⋮ On the congruence lattice of a Scott-domain ⋮ Unnamed Item ⋮ Coherence and consistency in domains ⋮ Exponentials in a Cartesian closed category which contains all algebraic domains ⋮ Abstract Interpretation from a Topological Perspective ⋮ Domain mu-calculus ⋮ Logic of convex order ⋮ Behaviour approximated on subgroups ⋮ Qualitative versus quantitative fixed point techniques in computer science ⋮ A general theory of action languages ⋮ A Declarative Debugging System for Lazy Functional Logic Programs ⋮ Type dependencies for logic programs using ACI-unification ⋮ On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms ⋮ Normalization, approximation, and semantics for combinator systems ⋮ 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 ⋮ Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
This page was built for publication:
