yusuke1997/dblp-id-title huggingface dataset:
An experimental library of formalized Mathematics based on the univalent foundations
Optimal approximate minimization of one-letter weighted finite automata
Continuation-Based Compilation of Functional Languages for Parallel Machines
Apartness, sharp elements, and the Scott topology of domains
Provenance as dependency analysis
Multi-focused cut elimination
A practical parameterised algorithm for the individual haplotyping problem MLF
Splitting and non-splitting in the difference hierarchy
Quantum algorithms for testing and learning Boolean functions
No-iteration mixed distributive laws
Dynamic analysis and numerical simulation of a discrete model of a bistable system
Well-founded coalgebras, revisited
Transition systems, link graphs and Petri nets
Hypercoherences: A Strongly Stable Model of Linear Logic
A notion of homotopy for the effective topos
A channel-based perspective on conjugate priors
The quantum walk search algorithm: factors affecting efficiency
Monoidal weak ω -categories as models of a type theory
Univalence for inverse diagrams and homotopy canonicity
Monoidal reverse differential categories
On the unification of classical, intuitionistic and affine logics
Type classes for mathematics in type theory
A resource aware semantics for a focused intuitionistic calculus
A quantitative model for simply typed λ-calculus
A Generalization of the Trie Data Structure
Event Identifier Logic
Newton series, coinductively: a comparative study of composition
Strongly algebraic = SFP (topically)
Unique decomposition of homogeneous languages and application to isothetic regions
On lookahead equilibria in congestion games
A quantitative computational model for complete partial metric spaces via formal balls
Zen and the art of formalisation
Domain theoretic characterisations of quasi-metric completeness in terms of formal balls
Some results related to the continuity problem
Database queries and constraints via lifting problems
Relating reasoning methodologies in linear logic and process algebra
Preface to special issue: behavioural types
On the computability of a construction of Brownian motion
Quasi-metric spaces and point-free geometry
A homotopy-theoretic model of function extensionality in the effective topos
An Imperative Language Based on Distributive Categories
Information flow safety in multiparty sessions
Adversarial scheduling in discrete models of social dynamics
Wadge-like reducibilities on arbitrary quasi-Polish spaces
The Expressive Power Of Urgent, Lazy And Busy-Waiting Actions In Timed Processes
The GA-SA model and its application to predicting the potential of the solar power industry
Liveness and boundedness analysis of Petri net synthesis
Initial algebras and terminal coalgebras in many-sorted sets
Breaking symmetries
Making abstract models complete
The Logic of Linear Functors
A foundation for synthetic algebraic geometry
Building Domains from Graph Models
Pushout Complements for Partly Total Algebras
A special issue on categorical algebras and computation in celebration of John Power's 60th birthday, part II
The costructure-cosemantics adjunction for comodels for computational effects
Denotational semantics for guarded dependent type theory
Linear pattern matching of compressed terms and polynomial rewriting
The algebraic lambda calculus
On the building of affine retractions
On asynchrony in name-passing calculi
Constructing Gröbner bases for Noetherian rings
A Proof-Irrelevant Model of Martin-Löf's Logical Framework
The long exact sequence of homotopy n -groups
Integral categories and calculus categories
From type theory to setoids and back
An empirical comparison of sales time series for online and offline channels for commodities in China
Hidden-Markov program algebra with iteration
Implicit exchange in multiplicative proofnets
Type safe incremental rebinding
Horizontal and Vertical Structuring of Typed Graph Transformation Systems
Classical isomorphisms of types
Behavioural reasoning for conditional equations
The geometry of Bayesian programming
A doctrinal approach to modal/temporal Heyting logic and non-determinism in processes
Martin Hofmann's contributions to type theory: Groupoids and univalence
Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
Full abstraction for expressiveness: history, myths and facts
On a measurement-free quantum lambda calculus with classical control
Borel ranks and Wadge degrees of context free omega-languages
A (machine-oriented) logic based on pattern matching
Bounded polymorphism in session types
Category-based constraint logic
Separating minimal valuations, point-continuous valuations, and continuous valuations
A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes
Context-preserving XQuery fusion
Preserving consistency in geometric modeling with graph transformations
Hofmann-Mislove type definitions of non-Hausdorff spaces
Effective metric model theory
An algebraic semantics of event-based architectures
On universal algebra over nominal sets
Diagrammatic logic applied to a parameterisation process
Program extraction in exact real arithmetic
Complexity of propositional projection temporal logic with star
Probability, valuations, hyperspace: Three monads on top and the support as a morphism
Relations among quantum processes: bisimilarity and congruence
A generalization of the Takeuti-Gandy interpretation
BetaEta-Complete Models for System F
A Cartesian closed extension of the category of locales
Intuitionistic Model Constructions and Normalization Proofs
Coercions in a polymorphic type system
Shuffles and concatenations in the construction of graphs
On merging two trust-networks in one with bipolar preferences
Material dialogues for first-order logic in constructive type theory: extended version
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
On planarity of graphs in homotopy type theory
Structured Transition Systems with Parametric Observations: Observational Congruences and Minimal Realizations
Imaginary groups: lazy monoids and reversible computation
Pre-Adjunctions in Order Enriched Categories
Schnorr dimension
A classification of bisimilarities for general Markov decision processes
Bisimulations for non-deterministic labelled Markov processes
Constructive forcing, CPS translations and witness extraction in Interactive realizability
Reversible combinatory logic
Probability in quantum computation and quantum computational logics: a survey
A Note on the Structure of Bilattices
A linear linear lambda-calculus
Equational properties of fixed-point operations in cartesian categories: An overview
Wheels - on division by zero
Set-syllogistics meet combinatorics
Computing with relational machines
Interactive and automated proofs for graph transformations
A note on accelerated Turing machines
The role of linearity in sharing analysis
Efficient computation in rational-valued P systems
Spaces of Maximal Points
Transition And Cancellation In Concurrency And Branching Time
A Universality Theorem for PCF With Recursive Types, Parallel-Or and Exists
A semiring-based trace semantics for processes with applications to information leakage analysis
Indexed and fibered structures for partial and total correctness assertions
A construction of free dcpo-cones
Editors' note: bibliometrics and the curators of orthodoxy
Computations with oracles that measure vanishing quantities
Concurrent Computing Machines And Physical Space-Time
The biequivalence of locally cartesian closed categories and Martin-Löf type theories
Collections, sets and types
Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions
On the number of fixed points of a combinator in lambda calculus
Randomised algorithms for isomorphisms of simple types
A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed Traces
Introduction to linear bicategories
Cut rules and explicit substitutions
Reducibility of domain representations and Cantor-Weihrauch domain representations
Towards a typed Geometry of Interaction
Enhanced coalgebraic bisimulation
A formalism-local framework for general probabilistic theories, including quantum theory
Injective types in univalent mathematics
Parametric Algebraic Specifications with Gentzen Formulas - from Quasi-Freeness to Free Functor Semantics
Unique decomposition categories, Geometry of Interaction and combinatory logic
A judgmental reconstruction of modal logic
Semantics-based software watermarking by abstract interpretation
Renormalisation and computation II: time cut-off and the Halting Problem
Singular value automata and approximate minimization
Calibrating word problems of groups via the complexity of equivalence relations
Divergences on monads for relational program logics
Partial metrisability of continuous posets
Robust attitude tracking control scheme for a multi-body spacecraft using a radial basis function network and terminal sliding mode
A positive set theory with equality revisited
Foreword To Special Issue: The Difference Between Concurrent And Sequential Computation
Computation Algebras
Observational interpretation of Casl specifications
Graph rewriting for the pi-calculus
Computable soft separation axioms
General synthetic domain theory - a logical approach
Abstract machines, optimal reduction, and streams
Realizability interpretation of PA by iterated limiting PCA
Variations on Realizability: Realizing the Propositional Axiom of Choice
Implicit computation complexity in higher-order programming languages: A Survey in Memory of Martin Hofmann
Autostability spectra for decidable structures
Bunched polymorphism
Products and projective limits of continuous valuations on T0 spaces
The small-community phenomenon in networks
Preface - MSCS
Game characterizations for the number of quantifiers
A Remark on the Theory of Semi-Functors
Quantum programming languages: survey and bibliography
Synthetic topology in Homotopy Type Theory for probabilistic programming
Non-disclosure for distributed mobile code
Clocked lambda calculus
Preface to special issue: EXPRESS 2011
Continuous-time quantum walks on the threshold network model
Categorical logic of Names and Abstraction in Action Calculi
Developments in computational models: introduction
Strictifying and taming directed paths in Higher Dimensional Automata
Solos In Concert
ℳ-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
Coalgebraic modal logic of finite rank
Loops, ditopology and deadlocks
Selection functions, bar recursion and backward induction
Modelling general recursion in type theory
Model theory of exponentials on Lie algebras
Disintegration and Bayesian inversion via string diagrams
A logical approach to abstract algebra
Types and typechecking for Communicating Quantum Processes
On the size complexity of universal accepting hybrid networks of evolutionary processors
Combining termination proofs in model transformation systems
Non-commutative logic II: sequent calculus and phase semantics
On the existence of n but not n + 1 easy combinators
A logical framework combining model and proof theory
Invariants of Inversive 2-Structures on Groups of Labels
Investigation of Concurrent Processes by Means of Homotopy Functors
On the expressive power of recursion, replication and iteration in process calculi
Kan injectivity in order-enriched categories
Special issue on homotopy type theory 2019 vol. 2
Unitary invariants of qubit systems
Processes and unfoldings: concurrent computations in adhesive categories
Topical categories of domains
Introduction to special issue on domain theory
Dagger extension theorem
A set-theoretic approach to algebraic L-domains
Proof systems for lattice theory
Preface to the special issue: Computing with infinite data: topological and logical foundations
A representation of proper BC domains based on conjunctive sequent calculi
On light logics, uniform encodings and polynomial time
Witness algebra and anyon braiding
Datatype Laws without Signatures
A computational view of implicit coercions in type theory
A typed, algebraic, computational lambda-calculus
Quantifying information flow in cryptographic systems
Statistical properties of simple types
Corrigenda for 'Connected limits, familial representability and Artin glueing'
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs
Computation with classical sequents
Isomorphism of intersection and union types
Comparing the Medvedev and Turing degrees of Π 0 1 classes
Dynamical systems: stability and simulability
On the computational complexity of the Dirichlet Problem for Poisson's Equation
Towards a descriptive theory of cb0-spaces
Absolutely non-computable predicates and functions in analysis
Termination in a π-calculus with subtyping
Traces for coalgebraic components
Equational Axioms for Regular Sets
The true concurrency of differential interaction nets
On the concept of probability
A duality between proof systems for cyclic term graphs
Convenient antiderivatives for differential linear categories
From lambda to pi; or, Rediscovering continuations
On asymptotic divergency in equivalential logics
Very Abstract Specifications: A Formalism Independent Approach
Weakest preconditions in fibrations
A formal proof of Pick's Theorem
Preface to Special Issue: LSFA 2019 and 2020
Random reals and Lipschitz continuity
Multiple-Labelled Transition Systems for nominal calculi and their logics
Projections for Polymorphic First-Order Strictness Analysis
Automatic differentiation for ML-family languages: Correctness via logical relations
CaSPiS: a calculus of sessions, pipelines and services
Resource convertibility and ordered commutative monoids
Dynamic game semantics
Minimisation and minimal realisation in Span(Graph)
On recursive operations over logic LTS
The Scott model of PCF in univalent type theory
A comparison of concepts from computable analysis and effective descriptive set theory
Combinatorial laplacians and positivity under partial transpose
Weak Inclusion Systems
Comparative uncertainty: theory and automation
Completeness of Category-Based Equational Deduction
On session types and polynomial time
RealLib: An efficient implementation of exact real arithmetic
Semi-pullbacks for stochastic relations over analytic spaces
Two-domain DNA strand displacement
A general proof certification framework for modal logic
The combinator M and the Mockingbird lattice
Preface to special issue: LSFA 2017 and 2018
Weighted synchronous automata
Wb-sober spaces and the core-coherence of dcpo models
Three extensional models of type theory
Monoidal-closed categories of tree automata
Structural non-interference in elementary and trace nets
An intuitionistic set-theoretical model of fully dependent CC
Some Monoidal Closed Categories of Stable Domains and Event Structures
Fixed point logics and definable topological properties
Syntax and models of Cartesian cubical type theory
Sheaf Semantics for Concurrent Interacting Objects
A note on coalgebras and presheaves
Parametric polymorphism and operational equivalence
First order in Ludics
A Categorial Approach to the Semantics of Argumentation
Univalent categories and the Rezk completion
A formal study of Bernstein coefficients and polynomials
On Banach spaces of sequences and free linear logic exponential modality
What is a categorical model of the differential and the resource λ-calculi?
The algebra of multirelations
Realisability semantics of parametric polymorphism, general references and recursive types
Elementary fibrations of enriched groupoids
A type system for Discretionary Access Control
Essential and relational models
Closed reduction: explicit substitutions without alpha-conversion
Debate on the concept of probability, and conclusions to this special issue on developments of the concepts of randomness, statistics and probability
A Theory of Mixin Modules: Algebraic Laws and Reduction Semantics
Equational theorem proving for clauses over strings
Quantum computation and quantum information
A linear logic framework for multimodal logics
m-Algebraic lattices in formal concept analysis
The impact of models of a physical oracle on computational power
The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
Process discovery and Petri nets
An axiomatics and a combinatorial model of creation/annihilation operators
Characteristic formulae for fixed-point semantics: a general framework
Truth, modality and intersubjectivity
Two-layered logics for probabilities and belief functions over Belnap-Dunn logic
Multisets, heaps, bags, families: What is a multiset?
A statistical mechanical interpretation of algorithmic information theory III: composite systems and fixed points
Embedding theorems for LTL and its variants
Implementing the cylindrical algebraic decomposition within the Coq system
Infinitary affine proofs
Algebraic High-Level Net Transformation Systems
GADTs are not (Even partial) functors
A Note on Recursive Functions
Introduction to special issue: Physics and computer science - quantum computation and other approaches
Multidimensional infinite data in the language Lucid
A quantum random number generator certified by value indefiniteness
Noncommutative network models
Fusion in Relational Structures and the Verification of Monadic Second-Order Properties
Linear logic and polynomial time
Topological and Limit-Space Subcategories of Countably-Based Equilogical Spaces
String diagram rewrite theory II: Rewriting with symmetric monoidal structure
A rewriting calculus for cyclic higher-order term graphs
Using groups for investigating rewrite systems
Differentiable causal computations via delayed trace (extended version)
String diagram rewrite theory III: Confluence with and without Frobenius
The set of maximal points of an $\boldsymbol{\omega}$ -domain need not be a $\boldsymbol{G}_{\boldsymbol{\delta}}$ -set
Bayesian theory based software reliability demonstration test method for safety critical software
Multi-level dynamo and opinion spreading
Minimal Realization in Bicategories of Automata
Paths, tree homomorphisms and disequalities for -clauses
Elementary structures in process theory (1): Sets with renaming
What should a generic object be?
Theory and applications of explicit substitutions: Introduction
Security monitor inlining and certification for multithreaded Java
Coalgebraic logic over general measurable spaces - a survey
Denotational semantics for a program logic of objects
Local fibred right adjoints are polynomial
A concrete model for a typed linear algebraic lambda calculus
Asymptotic information leakage under one-try attacks
Mackey-complete spaces and power series - a topological model of differential linear logic
Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013
A Formalism for the Specification of Essentially Algebraic Structures in 2-Categories
Weak bisimulations for the Giry monad
Decidability of regular language genus computation
Computation over algebraic structures and a classification of undecidable problems
Essential and density topologies on s2-continuous posets
Modular correspondence between dependent type theories and categories including pretopoi and topoi
Modal dependent type theory and dependent right adjoints
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC)
Coinductive predicates and final sequences in a fibration
Encoding hybridized institutions into first-order logic
Dilations and information flow axioms in categorical probability
Comparing the globalness of bipartite unitary operations: delocalisation power, entanglement cost and entangling power
Constructive sheaf models of type theory
Two-dimensional proof-structures and the exchange rule
Free Heyting algebra endomorphisms: Ruitenburg's Theorem and beyond
Some reasons for generalising domain theory
Rogers semilattices of punctual numberings
Permutation classes and polyomino classes with excluded submatrices
Monadic translation of classical sequent calculus
Uniform regular enumerations
Execution time of λ-terms via denotational semantics and intersection types
Dependent types and explicit substitutions: a meta-theoretical development
Coordination and mobility in CoreLime
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs
Preface to Locus Solum
Expansion trees with cut
Automata theory based on unsharp quantum logic
The discrete versus continuous controversy in physics
The method of the Yu-Ding Theorem and its application
Stratified polymorphism and primitive recursion
Quantum walks and elliptic integrals
Two-stage submodular maximization problem beyond nonnegative and monotone
Principal filters definable by parameters in E bT
Ordered combinatory algebras and realizability
Algebra of Constructsion II: An Algebraic Approach to Martin-Löf Theory and the Calculus of Constructions
Preface to Special Issue devoted to the memory of Sauro Tulipani
Preface: Special issue on objects and services
Quotienting the delay monad by weak bisimilarity
A filter model for mobile processes
Light logics and higher-order processes
On the complexity of inductive definitions
Addressed term rewriting systems: application to a typed object calculus
Quantum multiparty communication complexity and circuit lower bounds
Two-level type theory and applications - ERRATUM
Proof-relevant π-calculus: a constructive account of concurrency and causality
Modal and mixed specifications: key decision problems and their complexities
Logical characterizations of algebraic circuit classes over integral domains
Reo: a channel-based coordination model for component composition
Quantification of integrity
Parameterized complexity of weighted team definability
The sequential topology on ℕ ℕ ℕ is not regular
Strong normalisation in two Pure Pattern Type Systems
Symmetric Monoidal and Cartesian Double Categories as a Semantic Framework for Tile Logic
On the non-sequential nature of the interval-domain model of real-number computation
Deciding reachability problems in Turing-complete fragments of Mobile Ambients
Specifying Peirce's law in classical realizability
Stably compact spaces
Open-graphs and monoidal theories
Converging from branching to linear metrics on Markov chains
On Varieties and Covarieties in a Category
Linear logic in normed cones: probabilistic coherence spaces and beyond
D-oids: A Model for Dynamic Data-Types
Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting
Obsessional Experiments For Linear Logic Proof-Nets
Type-based termination of recursive definitions
A New Constructive Logic: Classical Logic
Algebraic spans
A ground-complete axiomatisation of finite-state processes in a generic process algebra
Action Semantics Reasoning about Functional Programs
Natural deduction via graphs: formal definition and computation rules
Introduction: computability of the physical
E-Unification based on Generalized Embedding
Sequent combinators: a Hilbert system for the lambda calculus
A liberal type system for functional logic programs
Triposes as a generalization of localic geometric morphisms
Monad compositions II: Kleisli strength
Locus Solum: From the rules of logic to the logic of rules
On the axiomatisability of priority
Research on digital predistortion based on adaptive algorithms
Chu I: Cofree Equivalences, Dualities and *-Autonomous Categories
Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search
Theory and applications of subtyping: Introduction
Geometry of Interaction and Linear Combinatory Algebras
Girard Quantaloids
Deriving session and union types for objects
Preface to special issue: EXPRESS 2010
Finitary monads on the category of posets
Taming the wild ant-lion; a counterexample to a conjecture of Böhm
Hoare Semigroups
Categorical Concepts for Parameterized Partial Specifications
Robust stability analysis of a class of uncertain neutral T-S fuzzy systems with time delay
Relating operational and denotational semantics for input/output effects
A step-indexed Kripke model of hidden state
A univalent formalization of the p -adic numbers