yusuke1997/dblp-id-title huggingface dataset:
A categorical quantum logic
The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
Least Fixpoints of Endofunctors of Cartesian Closed Categories
Constructive Natural Deduction and its 'Omega-Set' Interpretation
Automatically inferring loop invariants via algorithmic learning
Categorical Properties of Logical Frameworks
Compositional methods for information-hiding
Axiomatizability in Inclusive Equational Logics
Preface to the special issue on metric and differential semantics
On projecting processes into session types
Semantics for a basic relevant logic with intensional conjunction and disjunction (and some of its extensions)
Type Reconstruction in F omega
Classical realizability and arithmetical formulæ
The structure of first-order causality
On the Foundations of Final Coalgebra Semantics: Non-Well-Founded Sets, Partial Orders, Metric Spaces
Verification of tree-processing programs via higher-order mode checking
Causal Dependencies in Multiplicative Linear Logic with MIX
A Categorical Manifesto
Categories, Relations and Dynamic Programming
W-types in homotopy type theory
Computability structures, simulations and realizability
A public announcement separation logic
From Operational Semantics for Abstract Machines
Reductions in Intuitionistic Linear Logic
An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties
Encoding Left Reduction in the Lambda-Calculus with Interaction Nets
Bisimilarity is not Borel
Interactive Realizability for second-order Heyting arithmetic with EM1 and SK1
Unique factorisation lifting functors and categories of linearly-controlled processes
An extensible approach to session polymorphism
Introduction - from type theory and homotopy theory to univalent foundations
Preface to special issue: Expressiveness in Concurrency 2008
Monotone recursive types and recursive data representations in Cedille
Cartesian differential categories revisited
On Church's thesis in cubical assemblies
Types for ambient and process mobility
Generalised multisets for chemical programming
Concurrency cannot be observed, asynchronously
A projective formalism applied to topological and probabilistic event structures
A note on the feasibility of generalised universal composability
Quantum circuits generating four-qubit maximally entangled states
Control categories and duality: on the categorical semantics of the lambda-mu calculus
An Application of PER Models to Program Extraction
Lambda theories allowing terms with a finite number of fixed points
Indexed type theories
Model structures on categories of models of type theories
Fibrations with Indeterminates: Contextual and Functional Completeness for Polymorphic Lambda Calculi
The Travelling Salesman Problem for finite-sized cities
Coherent differentiation
On the classification of dipaths in geometric models for concurrency
Preface to the special issue on quantitative information flow
Two-level type theory and applications
Connected Limits, Familial Representability and Artin Glueing
Intuitionistic phase semantics is almost classical
Subnets of Proof-Nets in Multiplicative Linear Logic with MIX
Limits in categories of Vietoris coalgebras
Delay-dependent robust H ∞ control for neutral time-delay systems
Selected papers from Dependently Typed Programming 2010 - Overview
Boolean and classical restriction categories
Approximation Algorithm and FPT Algorithm for Connected- k -Subgraph Cover on Minor-Free Graphs
A denotational semantics for the symmetric interaction combinators
Algebraic Implementation of Abstract Data Types: A Survey of Concepts and New Compositionality Results
Syntactical Truth Predicates for Formulas with Atomic Negation
Classical logic as limit completion
Transport of finiteness structures and applications
Game semantics of Martin-Löf type theory
Rewriting calculi, higher-order reductions and patterns: introduction
Languages under Concatenation and Shuffling
Branching-time logics and fairness, revisited
Finitary Sketches and Finitely Accessible Categories
Regular Böhm trees
On the computational complexity of dynamic slicing problems for program schemas
Encodings of Turing machines in linear logic
The genus of regular languages
Modal Operators and the Formal Dual of Birkhoff's Completeness Theorem
A cubical Squier's theorem
Functional Completeness of the Free Locally Cartesian Closed Category an Interpretations of Martin-Löf's Theory of Dependent Types
Extracting information from intermediate semiconstructive HA-systems - extended abstract
Scott topology on Smyth power posets
Computability and information in models of randomness and chaos
A Computationally Adequate Model for Overloading via Domain-Valued Functors
The Dedekind reals in abstract Stone duality
Preface to special issue: ICTAC 2015
An improved primal-dual approximation algorithm for the k-means problem with penalties
Embedding Untimed Into Timed Process Algebra: The Case For Explicit Termination
A comonadic account of behavioural covarieties of coalgebras
Connection between logical and algebraic approaches to concurrent systems
Channel abstractions for network security
Local cycles and dynamical properties of Boolean networks
Ticket Entailment is decidable
An injection from the Baire space to natural numbers
Bisimulation proof methods in a path-based specification language for polynomial coalgebras
Interaction Systems I: The Theory of Optimal Reductions
The representational adequacy of Hybrid
Elgot theories: a new perspective on the equational properties of iteration
Foreword: special issue on coalgebraic logic
Quantum attacks on pseudorandom generators
Introduction to the special issue: Unification
A linear category of polynomial diagrams
Event Structures and Non-Orthogonal Term Graph Rewriting
Discrete equational theories
Preface to the special issue: commutativity of algebraic diagrams
Higher-Order Intersection Types and Multiple Inheritance
Complexity of translations from resolution to sequent calculus
An insertion operator preserving infinite reduction sequences
An Axiomatization of the Category of Petri Net Computations
Implementing type theory in higher order constraint logic programming
A domain equation for refinement of partial systems
Some representations of real numbers using integer sequences
Algorithmic thermodynamics
Final coalgebras in accessible categories
Generation and sudden death of entanglement in qubit-qutrit systems with depolarising noise
Classically controlled quantum computation
The design of an IMC-PID controller based on MEOTF and its application to non-square processes with time delay
Order in open intervals of computable reals
Multi-objective comprehensive evaluation approach to a river health system based on fuzzy entropy
On the interpretation of mathematical entities in the formalisation of programming and modelling languages
Cofree coalgebras and differential linear logic
Strong Normalization with Non-Structural Subtyping
Global progress for dynamically interleaved multiparty sessions
The Mix Rule
Quantum algorithmic methods for computational geometry
Social processes, program verification and all that
Secure information flow by self-composition
Periodic Linear Programming with applications to real-time scheduling
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009)
Coherent Taylor expansion as a bimonad
Coalgebras Of Bounded Type
Containers, monads and induction recursion
Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
Extended phase map decompositions for unitaries
Isomorphic Objects in Symmetric Monoidal Closed Categories
A specification logic for concurrent object-oriented programming
Church-Rosser Property and Homology of Monoids
Constraint Satisfaction Algorithms for Graph Pattern Matching
Mobile Petri nets
Languages of higher-dimensional automata
Special issue on quantum programming languages
Mu-depth 3 is more than 2: a game-theoretic proof
A Categorical Framework For Finite State Machines
A formal approach to collaborative modelling and co-simulation for embedded systems
From parametric polymorphism to models of polymorphic FPC
Generalised powerlocales via relation lifting
Foreword: special issue in memory of Nadia Busi
The complexity of completions in partial combinatory algebra
Sets in homotopy type theory
A new description of orthogonal bases
Optimal enforcement of (timed) properties with uncontrollable events
The Travelling Salesman Problem in symmetric circulant matrices with two stripes
Pointwise extensions of GSOS-defined operations
Preface to special issue: lightweight and practical formal methods in the design and analysis of safety-critical systems
A stable universal domain related to $\mathbb{T}$ ω
Computing with continuous objects: a uniform co-inductive approach
Up-to techniques for behavioural metrics via fibrations
The strength of Engeler's lemma
Classical mathematics for a constructive world
Normalization in the simply typed λμμ'ρθε-calculus
Practical coinduction
Cellular automata over generalized Cayley graphs
Quantitative aspects of speed-up and gap phenomena
On the status of perturbation theory
Preface to the special issue: Constructive analysis, types and exact real numbers
Complexity for partial computable functions over computable Polish spaces
Retrenchment and refinement interworking: the tower theorems
Probabilistic logic over equations and domain restrictions
On monotone modalities and adjointness
Foreword: special issue on term and graph rewriting
A theory of contracts for strong service compliance
Lattice-valued Scott topology on dcpos
Compositionality and Compatibility of Parameterization and Parameter Passing in Specification Languages
Theories of analytic monads
Exponentiable morphisms of domains
Domains, integration and 'positive analysis'
Nadia Busi's publications
The Structure of Interlaced Bilattices
String Rewriting and Homology of Monoids
Realizability: A Historical Essay
Syllogistic logic with "Most"
Formalising PFSQL queries using ŁΠ fuzzy logic
Dynamic Labeled 2-Structures
Vulnerability modelling with functional programming and dependent types
Yoneda completeness
Homotopy limits in type theory
A unified approach to some non-Hausdorff topological properties
The semantics of BI and resource tableaux
On the reification of semantic linearity
A Conjunctive Type System for Useless-Code Elimination
A Theory of Classes: Proofs and Models
From proof-nets to bordisms: the geometric meaning of multiplicative connectives
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability
A point-free perspective on lax extensions and predicate liftings
Fair subtyping for multi-party session types
Uniqueness Typing for Functional Languages with Graph Rewriting Semantics
Preface to the MSCS Issue 31.1 (2021) Homotopy Type Theory and Univalent Foundations
Semantics of the Second Order Lambda Calculus
The conservation theorem for differential nets
Extending modal transition systems with structured labels
Two-dimensional models of type theory
Proof nets for multiplicative cyclic linear logic and Lambek calculus
Transformation of any Verbrugge model to a bisimilar Veltman model
Spatial search on a honeycomb network
Constraining rule-based dynamics with types
A special issue on categorical algebras and computation in celebration of John Power's 60th birthday, part I
Partiality and recursion in interactive theorem provers - an overview
Modular Control-Flow Analysis with Rank 2 Intersection Types
On lists and other abstract data types in the calculus of constructions
Modified bar recursion
Polarised subtyping for sized types
Axioms for bigraphical structure
Intersection Types and lambda-Definability
The universality of polynomial time Turing equivalence
Generalizations of the distributed Deutsch-Jozsa promise problem
Computability and Totality in Domains
Modal descent
A lambda-calculus with explicit weakening and explicit substitution
Parallelism and Concurrency in High-Level Replacement Systems
Universal Aspects of Probabilistic Automata
Relative formal topology: the binary positivity predicate comes first
Sketches and Computation - I: Basic Definitions and Static Evaluation
Topological features of good resources for measurement-based quantum computation
On the expressiveness of π-calculus for encoding mobile ambients
Theory and applications of term graph rewriting: introduction
Higher-order psi-calculi
Can we build it: formal synthesis of control strategies for cooperative driver assistance systems
Bounded ACh unification
Inclusions for partiality
The space of formal balls and models of quasi-metric spaces
A realizability interpretation of Church's simple theory of types
Adding an implication to logics of perfect paradefinite algebras
sL-approximation spaces capture sL-domains
Categorical Models for Non-Extensional lambda-Calculi and Combinatory Logic
Hom weak ω-categories of a weak ω-category
Addendum to 'The Katětov construction modified for a T 0 -quasi-metric space'
Partial Hyperdoctrines: Categorical Models for Partial Function Logic and Hoare Logic
On quantum lambda calculi: a foundational perspective
Smooth and proper maps with respect to a fibration
Non-termination and secure information flow
Spatial quantum search in a triangular network
LQP: the dynamic logic of quantum information
Employing UML and OCL for designing and analysing role-based access control
Implicational Kleene algebra with domain and the substructural logic of partial correctness
Coalgebraic description of generalised binary methods
Preface to special issue: Developments In Computational Models 2010
Monads of coalgebras: rational terms and term graphs
An extremely sharp phase transition threshold for the slow growing hierarchy
Expressiveness modulo bisimilarity of regular expressions with parallel composition
Introduction to Distributive Categories
Modules over relative monads for syntax and semantics
Sound and Complete Axiomatisations of Call-by-Value Control Operators
Two preservation results for countable products of sequential spaces
The call-by-value [lambda]-calculus: a semantic investigation
A Categorical Look at Tree Automata and Context-Free Languages
Primitive recursion in the abstract
A coalgebraic view on decorated traces
General conditions for full abstraction
Doctrines, modalities and comonads
A monadic, functional implementation of real numbers
SMT-based verification of data-aware processes: a model-theoretic approach
Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding
Preface to the special issue on developments of the concepts of randomness, statistics and probability
On categorical models of classical logic and the Geometry of Interaction
On categories generalizing universal domains
Syntactic composition of top-down tree transducers is short cut fusion
A linear/producer/consumer model of classical linear logic
A hybrid WT-FBPNN optimisation algorithm to identify the investment risk of wind power projects
The infinitary lambda calculus of the infinite eta Böhm trees
Formal analysis of model transformations based on triple graph grammars
Double-pushout graph transformation revisited
The Decomposition Tree for analyses of Boolean functions
A short proof of the Schröder-Simpson Theorem
A Categorical Approach to Database Semantics
On traced monoidal closed categories
Complexity of chaos and quantum computation
Fully Abstract Translations Between Functional Languages
Introduction to the special issue: Confluence
Weak symmetry breaking and abstract simplex paths
Interpolation and Compactness in Categories of Pre-Institutions
Quasi-Nelson algebras and fragments
Discrete-time and continuous-time modelling: some bridges and gaps
Representing prefix and border tables: results on enumeration
Sub-behaviour relations for session-based client/server systems
Algorithms for Categorical Equivalence
Correctness of high-level transformation systems relative to nested conditions
Hypergraph Construction and its Application to the Static Analysis of Concurrent Systems
Property-oriented semantics of structured specifications
CHAD for expressive total languages
An Event Structure Based Semantics for High-Level Message Sequence Charts
Curry-style type isomorphisms and game semantics
A system of interaction and structure V: the exponentials and splitting
On (co)products of partial combinatory algebras, with an application to pushouts of realizability toposes
Static analysis of Biological Regulatory Networks dynamics using abstract interpretation
Decoherence in quantum walks - a review
Double Categories: A Modular Model of Multiplicative Linear Logic
Analysis of the Doppler frequency feature of aero deception active-passive-jamming
Recognizable languages of arrows and cospans
Constructive analysis, types and exact real numbers
Quasivarieties and varieties of ordered algebras: regularity and exactness
A cooperative co-evolutionary particle swarm optimiser based on a niche sharing scheme for the flow shop scheduling problem under uncertainty
A hierarchy of reverse bisimulations on stable configuration structures
Restriction categories III: colimits, partial limits and extensivity
Quantifying over events in probability logic: an introduction
H ∞ stabilisation of networked control systems with time delays and packet losses
A semantics for lambda calculi with resources
On function spaces equipped with Isbell topology and Scott topology
cJoin: Join with communicating transactions
Plugging-in proof development environments using Locks in LF
The monoidal structure of Turing machines
A domain-theoretic Banach-Alaoglu theorem
Admissible and Derivable Rules in Intuitionistic Logic
Equational Properties Of Mobile Ambients
Structuring quantum effects: superoperators as arrows
Prior's ideal language
Lenses, fibrations and universal translations
Constructing weak simulations from linear implications for processes with private names
Groupoidal realizability for intensional type theory
Final coalgebras as greatest fixed points in ZF set theory
Cupping Delta 2 0 enumeration degrees to 0 e '
On the operating unit size of load/store architectures
Coherence of Subsumption, Minimum Typing and Type-Checking in F <=
Countability constraints in order-theoretic approaches to computability
Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention
The driven three body Coulomb problem
A light-weight integration of automated and interactive theorem proving
Randomness in biology
T 0 -spaces and the lower topology
MetaKlaim: a type safe multi-stage language for global computing
Dynamic networks of heterogeneous timed machines
A short survey of isomorphisms of types
Non-cupping, measure and computably enumerable splittings
A correspondence between maximal abelian sub-algebras and linear logic fragments
Matching with multiplication and exponentiation (extended abstract)
Synthetic G-jet-structures in modal homotopy type theory
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras - A categorical Chomsky-Schützenberger theorem
On sequential functionals of type 3
An analysis of trust in anonymity networks in the presence of adaptive attackers
A Model for Syntactic Control of Interference
Classical lambda calculus in modern dress
Definitions by rewriting in the Calculus of Constructions
Formalising foundations of mathematics
Representation of algebraic domains by formal association rule systems
Long-run cost analysis by approximation of linear operators over dioids
Hybrid linear logic, revisited
Preface for the special issue on domains
Appendix: Separability of Tensor in Chu Categories of Cector Spaces
The computational SLR: a logic for reasoning about computational indistinguishability
Extending partial combinatory algebras
Equational axioms associated with finite automata for fixed point operations in cartesian categories
Constructing a small category of setoids
Free Iterative Theories: A Coalgebraic View
Proof Nets And Explicit Substitutions
Conditions for the completeness of functional and algebraic equational reasoning
Special issue on homotopy type theory 2019
A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems
Automorphisms of types in certain type theories and representation of finite groups
The Russell-Prawitz modality
The formal ball model for -categories
Pure type systems with explicit substitution
Formalising nominal C-unification generalised with protected variables
Constructive Theory of the Lower Power Locale
Higher-order pattern generalization modulo equational theories
Univalent categories of modules
Finitary ℳ-adhesive categories
Observational trees as models for concurrency
An operational domain-theoretic treatment of recursive types
Geometry of resource interaction and Taylor-Ehrhard-Regnier expansion: a minimalist approach
A modular formal semantics for Ptolemy
Rewriting with generalized nominal unification
Symmetric monoidal smash products in homotopy type theory
Topological representation of the lambda-calculus
Differential categories
Algebraic Properties Of Processes for Local Action Systems
Simulating Expansions without Expansions
Preface to the special issue: isomorphisms of types and invertibility of lambda terms
Type-based flow analysis and context-free language reachability
Abstract hierarchical graph transformation
Proving the validity of equations in GSOS languages using rule-matching bisimilarity
Adaptive control of a class of non-linear systems preceded by backlash-like hysteresis
A Categorical Model for Higher Order Imperative Programming
Linearity, session types and the Pi calculus
A simple process algebra based on atomic actions with resources
Provable Isomorphisms of Types
A deterministic rewrite system for the probabilistic λ-calculus
Categorical Data Types in Parametric Polymorphism
Z property for the shuffling calculus
Non-deterministic structures of computation
Iterative algebras at work
Introduction to special issue on concurrency and coordination: Selected work from the International Workshop ConCoord
Computing with lambda-terms: A special issue dedicated to Corrado Böhm for his 90th birthday
Implicative algebras: a new foundation for realizability and forcing
Witnessing flows in arithmetic
Coinductive characterizations of applicative structures
On conditions for semirings to induce compact information algebras
Minimality of the correctness criterion for multiplicative proof nets
Quantum weakest preconditions
Finiteness spaces
Modelling declassification policies using abstract domain completeness
Detection and diagnosis of deviations in distributed systems of autonomous agents
Special issue: Modalities in type theory
Concurrent programming as proof net construction
Freely adjoining monoidal duals
An Oxford Survey of Order Sorted Algebra
A completion-invariant extension of the concept of meet continuous lattices
A focused linear logical framework and its application to metatheory of object logics
A case study in programming coinductive proofs: Howe's method
Abstract Böhm trees
The logic of the reverse mathematics zoo
The λ-calculus in the π-calculus
Equivalence relations for modular performance evaluation in dtsPBC
Kolmogorov complexity and the geometry of Brownian motion
Analysis of permutation equivalence in -adhesive transformation systems with negative application conditions
Monoids over domains
JNI light: an operational model for the core JNI
Robustness, Scott continuity, and computability
Fuzzy Models of Linear Logic
Diamond embeddings into the enumeration degrees
Identity types and weak factorization systems in Cauchy complete categories
Modal logic and the approximation induction principle
Computing knowledge in equational extensions of subterm convergent theories
Model checking usage policies
A Gray code for cross-bifix-free sets
3-body, classical-quantum, discrete-continuous
A coinductive calculus of streams
Profunctors, open maps and bisimulation
Primitive Recursion, Equality, and a Universal Set
A MALL geometry of interaction based on indexed linear logic
Characterising E-projectives via Comonads
θ-continuity and D θ-completion of posets
Classical linear logic of implications
Abstract cyclic proofs