scientific article; zbMATH DE number 3594646
From MaRDI portal
Publication:4160405
zbMath0382.68041MaRDI QIDQ4160405
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)
Related Items (83)
On the largest Cartesian closed category of stable domains. ⋮ \(\mathbb T^\omega\) as a stable universal domain. ⋮ Easy lambda-terms are not always simple ⋮ On the symmetry of sequentiality ⋮ Sequential functions on indexed domains and full abstraction for a sub-language of PCF ⋮ Easiness in graph models ⋮ Atomicity, coherence of information, and point-free structures ⋮ Order-incompleteness and finite lambda reduction models ⋮ Cartesian closed subcategories of \(\mathrm{CONT}_\ll^\ast\) ⋮ Prime algebraicity ⋮ Stability, sequentiality and demand driven evaluation in dataflow ⋮ Stable power domains ⋮ Algebraic domains of natural transformations ⋮ An Analytic Propositional Proof System on Graphs ⋮ A General Class of Models of $\mathcal{H}^*$ ⋮ Normal functors, power series and \(\lambda\)-calculus ⋮ A quantitative interpretation of Girard's System F ⋮ A logical approach to stable domains ⋮ Stone duality and representation of stable domain ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ Projecting sequential algorithms on strongly stable functions ⋮ Full abstraction and the Context Lemma (preliminary report) ⋮ Quantitative domains, groupoids and linear logic ⋮ Glueing and orthogonality for models of linear logic ⋮ Visible acyclic differential nets. I: Semantics ⋮ Decomposition of domains ⋮ Cartesian closed categories of domains and the space proj(D) ⋮ Continuous functions and parallel algorithms on concrete data structures ⋮ A monoidal closed category of event structures ⋮ Normal forms, linearity, and prime algebraicity over nonflat domains ⋮ The Scott model of linear logic is the extensional collapse of its relational model ⋮ A stable universal domain related to ω ⋮ Implementing term rewrite languages in DACTL ⋮ Unnamed Item ⋮ An algebraic approach to stable domains ⋮ Sequential algorithms for unbounded nondeterminism ⋮ An abstract data type for real numbers ⋮ Weighted models for higher-order computation ⋮ Coincidence of the Isbell and Scott topologies on the function spaces of quasicontinuous domains ⋮ Sequential algorithms on concrete data structures ⋮ From Qualitative to Quantitative Semantics ⋮ Unnamed Item ⋮ Universal homogeneous event structures and domains ⋮ Stable neighbourhoods ⋮ The largest cartesian closed category of stable domains ⋮ On maximal stable functions ⋮ Uniformity and the Taylor expansion of ordinary lambda-terms ⋮ A logic for Lawson compact algebraic L-domains ⋮ Towards a theory of parallel algorithms on concrete data structures ⋮ On the largest Cartesian closed category of stable domains ⋮ Stable domains are generalized topological spaces ⋮ On stable domains ⋮ \(dI\)--domains as prime information systems ⋮ Maximality and totality of stable functions in the category of stable bifinite domains ⋮ A partial solution to an open problem of Amadio and Curien ⋮ Towards Lambda Calculus Order-Incompleteness ⋮ Preface to the special volume ⋮ Forcing in stable models of untyped \(\lambda\)-calculus ⋮ Cartesian closed stable categories ⋮ A stable programming language ⋮ Disjunctive systems and L-Domains ⋮ Logical Semantics for Stability ⋮ Unnamed Item ⋮ Coherence and consistency in domains ⋮ Categories of embeddings ⋮ Exponentials in a Cartesian closed category which contains all algebraic domains ⋮ Stability and computability in coherent domains ⋮ Representation of computations in concurrent automata by dependence orders ⋮ Distributive semantics for nondeterministic typed \(\lambda\)-calculi ⋮ Expressive power of typed and type-free programming languages ⋮ Nondeterminism and Observable Sequentiality ⋮ Domain theoretic models of polymorphism ⋮ Sequential evaluation strategies for parallel-or and related reduction systems ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ The sequentially realizable functionals ⋮ Contextual Petri nets, asymmetric event structures, and processes ⋮ Event Domains, Stable Functions and Proof-Nets ⋮ Definability and Full Abstraction ⋮ Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin ⋮ Set-theoretical and other elementary models of the \(\lambda\)-calculus ⋮ A natural semantics of first-order type dependency ⋮ Retractions of dI-domains as a model for Type:Type ⋮ Relative definability of boolean functions via hypergraphs
This page was built for publication:
