Categories for Types
From MaRDI portal
Publication:4295775
DOI10.1017/CBO9781139172707zbMath0837.68077OpenAlexW4233993919MaRDI QIDQ4295775
Publication date: 14 June 1994
Full work available at URL: https://doi.org/10.1017/cbo9781139172707
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algebraic theory of languages and automata (68Q70) Categories of machines, automata (18B20)
Related Items
Nominal lambda calculus: an internal language for FM-Cartesian closed categories, On the Versatility of Open Logical Relations, Indexed and fibered structures for partial and total correctness assertions, Equational logic and categorical semantics for multi-languages, Parametrized fixed points and their applications to session types, Computational adequacy of the FIX-logic, Nuisance parameter problem in quantum estimation theory: tradeoff relation and qubit examples, Semantics of higher-order quantum computation via geometry of interaction, On the semantics of the universal quantifier, On fixpoint objects and gluing constructions, Episodic memory: a hierarchy of spatiotemporal concepts, Enriched Lawvere Theories for Operational Semantics, Canonical thermalization, A new framework for declarative programming, Term rewriting for normalization by evaluation., CHAD for expressive total languages, The syntactic side of autonomous categories enriched over generalised metric spaces, Relative full completeness for bicategorical Cartesian closed structure, Pointfree expression and calculation: From quantification to temporal logic, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Non-local setting and outcome information for violation of Bell's inequality, Equilibration of isolated macroscopic quantum systems, Nominal Lawvere theories: a category theoretic account of equational theories with names, Eigenstate thermalization: Deutsch’s approach and beyond, Graded Hoare logic and its categorical semantics, A characterization of lambda definability in categorical models of implicit polymorphism, Was there an ice cube there or am I just remembering it?: Does the reversibility argument really imply scepticism about records?, Parametricity, type equality, and higher-order polymorphism, Some Remarks on Type Systems for Course-of-value Recursion, Relative cohomology of algebraic theories, Linear realizability and full completeness for typed lambda-calculi, A game semantics for generic polymorphism, Relating categorical semantics for intuitionistic linear logic, Causality and the arrow of classical time, Proof theory in the abstract, Innocent game models of untyped \(\lambda\)-calculus, Type Fusion, Unnamed Item, Pointers in Recursion: Exploring the Tropics, Structural induction and coinduction in a fibrational setting, The nominal/FM Yoneda Lemma, Two extensions of system F with (co)iteration and primitive (co)recursion principles, A categorical framework for typing CCS-style process communication, Containers: Constructing strictly positive types, Constructive Modalities with Provability Smack, The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics, A structural approach to reversible computation, A fully abstract denotational semantics for the \(\pi\)-calculus, Free and cofree acts of dcpo-monoids on directed complete posets.
