A representation of SFP

DOI10.1006/inco.1994.1031zbMath0794.68095OpenAlexW1972813191MaRDI QIDQ1322472

V. Pereyra

Publication date: 5 May 1994

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/31665

zbMATH Keywords

domainsinformation systemsdenotational semantics of programming languagescategory of strongly finite sequent structurescomple partial orderGentzen style entailmentPlotkin powerdomainrecursively defined domainsSFP

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Cut-elimination and normal-form theorems (03F05) Continuous lattices and posets, applications (06B35)

Related Items (13)

Information systems for continuous semi-lattices ⋮ Representations of algebraic domains and algebraic L-domains by information systems ⋮ A note on finitely derived information systems ⋮ A representation of L-domains by information systems ⋮ Representation of algebraic domains by formal association rule systems ⋮ Weak algebraic information systems and a new equivalent category of DOM of domains ⋮ Representations of stably continuous semi-lattices by information systems and abstract bases ⋮ Information systems revisited -- the general continuous case ⋮ Various Constructions of Continuous Information Systems ⋮ Disjunctive systems and L-Domains ⋮ A representation of continuous domains via relationally approximable concepts in a generalized framework of formal concept analysis ⋮ A categorical representation of algebraic domains based on variations of rough approximable concepts ⋮ Three dual ontologies

This page was built for publication: A representation of SFP