Pages that link to "Item:Q163528"

The following pages link to Electronic Notes in Theoretical Computer Science (Q163528):

Displaying 50 items.

• Non-uniform hypercoherences (Q2842815) (← links)
• GS\(\cdot \Lambda \) theories: a syntax for higher-order graphs (Q2842817) (← links)
• Induction, coinduction, and adjoints (Q2842818) (← links)
• Bisimulation relations for dynamical and control systems (Q2842819) (← links)
• The uniformity principle on traced monoidal categories (Q2842820) (← links)
• Factorization systems and fibrations: toward a fibred Birkhoff variety theorem (Q2842821) (← links)
• A monadic approach to polycategories (Q2842822) (← links)
• A categorical semantics of higher order store (Q2842823) (← links)
• Multiplicative linear logics and fibrations (Q2842824) (← links)
• Adjunction models for call-by-push-value with stacks (Q2842825) (← links)
• Joyal's arithmetic universes via type theory (Q2842826) (← links)
• On iteratable endofunctors (Q2842827) (← links)
• Classifying categories for partial equational logic (Q2842828) (← links)
• Local compactness and the Baire category theorem in abstract Stone duality (Q2842829) (← links)
• Paths and simulations (Q2842830) (← links)
• Simple easy terms (Q2842831) (← links)
• Strongly normalising cut-elimination with strict intersection types (Q2842832) (← links)
• Polar type inference with intersection types and \(\omega\) (Q2842834) (← links)
• Strong normalization with singleton types (Q2842835) (← links)
• Subtyping in logical form (Q2842836) (← links)
• The relevance of semantic subtyping (Q2842838) (← links)
• Reducibility: a ubiquitous method in lambda calculus with intersection types (Q2842839) (← links)
• Implementing compositional analysis using intersection types with expansion variables (Q2842841) (← links)
• Feasible functionals and intersection of ramified types (Q2842842) (← links)
• Intersection typed \(\lambda \)-calculus (Q2842843) (← links)
• Access control in a core calculus of dependency (Q2864145) (← links)
• Event domains, stable functions and proof-nets (Q2864146) (← links)
• A convenient category of domains (Q2864147) (← links)
• Conformal field theory as a nuclear functor (Q2864148) (← links)
• Local reasoning about data update (Q2864149) (← links)
• Manipulating trees with hidden labels (Q2864150) (← links)
• The bicategory-theoretic solution of recursive domain equations (Q2864151) (← links)
• Nominal equational logic (Q2864152) (← links)
• Syntactic logical relations for polymorphic and recursive types (Q2864153) (← links)
• Definability and full abstraction (Q2864154) (← links)
• Protocol composition logic (PCL) (Q2864155) (← links)
• Remarks on testing probabilistic processes (Q2864156) (← links)
• A framework for defining logical frameworks (Q2864157) (← links)
• The category theoretic understanding of universal algebra: Lawvere theories and monads (Q2864158) (← links)
• Labelled Markov processes as generalised stochastic relations (Q2864159) (← links)
• Structuring operational semantics: simplification and computation (Q2864160) (← links)
• A Bayesian model for event-based trust (Q2864161) (← links)
• Heuristics for safety and security constraints (Q2864162) (← links)
• Systems modelling via resources and processes: philosophy, calculus, semantics, and logic (Q2864163) (← links)
• Model-checking games for typed \(\lambda\)-calculi (Q2864164) (← links)
• Event structures with symmetry (Q2864165) (← links)
• A process algebra for reasoning about quantum security (Q2864166) (← links)
• An algebra of pure quantum programming (Q2864167) (← links)
• De-linearizing linearity: projective quantum axiomatics from strong compact closure (Q2864168) (← links)
• Distributed measurement-based quantum computation (Q2864169) (← links)