scientific article; zbMATH DE number 1229489
From MaRDI portal
Publication:4222034
zbMath0962.03001MaRDI QIDQ4222034
Pierre-Louis Curien, Roberto M. Amadio
Publication date: 6 December 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Combinatory logic and lambda calculus (03B40)
Related Items (92)
A computable expression of closure to efficient causation ⋮ \(\mathbb T^\omega\) as a stable universal domain. ⋮ Relational graph models, Taylor expansion and extensionality ⋮ Comparing hierarchies of types in models of linear logic ⋮ A Cartesian closed category of domains with almost algebraic bases ⋮ Generalised information systems capture L-domains ⋮ On sets of terms having a given intersection type ⋮ Reasoning with power defaults ⋮ Principality and type inference for intersection types using expansion variables ⋮ Intersection types for explicit substitutions ⋮ Unnamed Item ⋮ Typed vs. Untyped Realizability ⋮ Formalizing non-termination of recursive programs ⋮ A Purely Definitional Universal Domain ⋮ Unnamed Item ⋮ A categorical semantics for polarized MALL ⋮ Transport of finiteness structures and applications ⋮ Characterising Strongly Normalising Intuitionistic Sequent Terms ⋮ On naturally continuous non-dcpo domains ⋮ Some results related to the continuity problem ⋮ From semantics to types: the case of the imperative \(\lambda\)-calculus ⋮ Decidability results for primitive recursive algorithms ⋮ Theory of interaction ⋮ Radical theory of Scott-open filters ⋮ Interpreting Localized Computational Effects Using Operators of Higher Type ⋮ Normal forms, linearity, and prime algebraicity over nonflat domains ⋮ The differential method and the causal incompleteness of programming theory in molecular biology ⋮ How much partiality is needed for a theory of computability? ⋮ An approach to innocent strategies as graphs ⋮ A synthetic theory of sequential domains ⋮ Game semantics of Martin-Löf type theory ⋮ A stable universal domain related to ω ⋮ Consistent Hoare powerdomains. ⋮ Parametric \(\lambda \)-theories ⋮ On strong normalization and type inference in the intersection type discipline ⋮ Krivine machines and higher-order schemes ⋮ Behavioural inverse limit \(\lambda\)-models ⋮ On phase semantics and denotational semantics in multiplicative-additive linear logic ⋮ Unnamed Item ⋮ Domain-theoretical models of parametric polymorphism ⋮ Characterizing consistent Smyth powerdomains by \textit{FS-}\(\land^{\uparrow}\)-domains ⋮ Information systems revisited -- the general continuous case ⋮ On the largest Cartesian closed category of stable domains ⋮ A new view of relationship between atomic posets and complete (algebraic) lattices ⋮ Maximality and totality of stable functions in the category of stable bifinite domains ⋮ A partial solution to an open problem of Amadio and Curien ⋮ Consistent Smyth powerdomains. ⋮ Machine semantics ⋮ A Relationship between Equilogical Spaces and Type Two Effectivity ⋮ Preface to the special volume ⋮ Cartesian closed stable categories ⋮ Probabilistic coherence spaces as a model of higher-order probabilistic computation ⋮ On phase semantics and denotational semantics: The exponentials ⋮ A stable programming language ⋮ Notes on the products of the lower topology and Lawson topology on posets ⋮ On the computational content of the Lawson topology ⋮ Unnamed Item ⋮ On the asymptotic behaviour of primitive recursive algorithms ⋮ Homological algebra in characteristic one ⋮ Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Operational domain theory and topology of sequential programming languages ⋮ Monoidal-closed categories of tree automata ⋮ A topology on lattice-ordered groups ⋮ Rough concept lattices and domains ⋮ A representation of FS-domains by formal concept analysis ⋮ The extensional ordering of the sequential functionals ⋮ Domain semantics of possibility computations ⋮ Equilogical spaces ⋮ Dynamic game semantics ⋮ A game-semantic model of computation ⋮ Unnamed Item ⋮ Non-Uniform Hypercoherences ⋮ Compositional characterisations of \(\lambda\)-terms using intersection types ⋮ Normalization without reducibility ⋮ MiniBrass: soft constraints for MiniZinc ⋮ Sequential algorithms and strongly stable functions ⋮ Formalizing abstract computability: Turing categories in Coq ⋮ The sequentially realizable functionals ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics ⋮ Partial Valuation Structures for Qualitative Soft Constraints ⋮ Aspects of Categorical Recursion Theory ⋮ Definability and Full Abstraction ⋮ On infinite \(\eta\)-expansion ⋮ The IO and OI hierarchies revisited ⋮ Essential and relational models ⋮ Redexes are stable in the λ-calculus ⋮ Foundation of a computable solid modelling. ⋮ Exact real number computations relative to hereditarily total functionals. ⋮ Implicit computation complexity in higher-order programming languages ⋮ Fixed points of Scott continuous self-maps
This page was built for publication:
