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