yusuke1997/dblp-id-title huggingface dataset:
Approaching and leave-taking: Negotiating contact in computer-mediated communication
Ink: Increasing Worker Agency to Reduce Friction in Hiring Crowd Workers
Assisted Shifting of Electricity Use: A Long-Term Study of Managing Residential Heating
Token+constraint systems for tangible interaction with digital information
A new operational representation of dependencies in Event Structures
Revisiting Call-by-value Böhm trees in light of their Taylor expansion
Optimal controller synthesis for timed systems
The Third Trick
Expressiveness of Metric modalities for continuous time
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
Reasoning with Finite Sets and Cardinality Constraints in SMT
Safety and Liveness of Quantitative Properties and Automata
Predicate Abstraction with Under-Approximation Refinement
DRAT and Propagation Redundancy Proofs Without New Variables
Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems
A Note on Shortest Developments
On the Nielsen-Schreier Theorem in Homotopy Type Theory
Query learning of derived ωω\omega-tree languages in polynomial time
Some observations on the logical foundations of inductive theorem proving
On two-variable guarded fragment logic with expressive local Presburger constraints
On the Satisfiability of Local First-Order Logics with Data
A theory of Automated Market Makers in DeFi
Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach
LNL polycategories and doctrines of linear logic
Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
Data-Aware Hybrid Tableaux
Deciding Confluence and Normal Form Properties of Ground Term Rewrite Systems Efficiently
Residuality and Learning for Nondeterministic Nominal Automata
Capturing the polynomial hierarchy by second-order revised Krom logic
A new characterization of complete Heyting and co-Heyting algebras
Interpretation of Inaccessible Sets in Martin-Löf Type Theory with One Mahlo Universe
Fully Abstract Encodings of $\lambda$-Calculus in HOcore through Abstract Machines
A Sound Algorithm for Asynchronous Session Subtyping and its Implementation
Representing Continuous Functions between Greatest Fixed Points of Indexed Containers
Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees
Normalisation Control in Deep Inference via Atomic Flows
Modalities in homotopy type theory
On the Taylor expansion of λ-terms and the groupoid structure of their rigid approximants
A first-order logic characterization of safety and co-safety languages
Free complete Wasserstein algebras
Geometric Model Checking of Continuous Space
Weak Simplicial Bisimilarity and Minimisation for Polyhedral Model Checking
Normalizing the Taylor expansion of non-deterministic {\lambda}-terms, via parallel reduction of resource vectors
Stabilized profunctors and stable species of structures
Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics
Classical Control, Quantum Circuits and Linear Logic in Enriched Category Theory
Axiomatizing Maximal Progress and Discrete Time
Relational ⋆⋆\star-Liftings for Differential Privacy
The Rice-Shapiro theorem in Computable Topology
A Galois connection between Turing jumps and limits
Controlling a random population
The sequential functionals of type (ι→ι) n →ι form a dcpo for all n ∈ N
The Complexity of Enriched Mu-Calculi
Classical System of Martin-Lof's Inductive Definitions is not Equivalent to Cyclic Proofs
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems
Specification and Verification of Timing Properties in Interoperable Medical Systems
Streamability of nested word transductions
A realizability semantics for inductive formal topologies, Church's Thesis and Axiom of Choice
Uniqueness of directed complete posets based on Scott closed set lattices
Constructive Canonicity of Inductive Inequalities
Resource Usage Analysis for the p-Calculus
Strong normalization for applied lambda calculi
Proving Noninterference by a Fully Complete Translation to the Simply Typed Lambda-Calculus
Globular: an online proof assistant for higher-dimensional rewriting
Z-stability in Constructive Analysis
Algorithms for Omega-Regular Games with Imperfect Information
Advanced Model Consistency Restoration with Higher-Order Short-Cut Rules
A Load-Buffer Semantics for Total Store Ordering
A Rational Deconstruction of Landin's SECD Machine with the J Operator
2-adjoint equivalences in homotopy type theory
On the enumeration of closures and environments with an application to random generation
Playing Safe, Ten Years Later
A model of actors and grey failures
Coalgebras for Bisimulation of Weighted Automata over Semirings
Rigorous Function Calculi in Ariadne
Strong negation in the theory of computable functionals TCF
A Scalable Algorithm for Decentralized Actor Termination Detection
A Strategy for Dynamic Programs: Start over and Muddle through
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
Overlap Algebras: a Constructive Look at Complete Boolean Algebras
FTMPST: Fault-Tolerant Multiparty Session Types
Fixed point combinators as fixed points of higher-order fixed point generators
Continuity of Functional Transducers: A Profinite Study of Rational Functions
Context-Sensitive Languages, Rational Graphs and Determinism
Parameterized Model-checking of Discrete-Timed Networks and Symmetric-Broadcast Systems
Distribution Bisimilarity via the Power of Convex Algebras
Tarski's influence on computer science
Equivalence checking for weak bi-Kleene algebra
SAT-Inspired Higher-Order Eliminations
Solvability = Typability + Inhabitation
Boolean proportions
A Few Notes on Formal Balls
Pre-measure spaces and pre-integration spaces in predicative Bishop-Cheng measure theory
Weihrauch-completeness for layerwise computability
The Data Complexity of Description Logic Ontologies
Call-by-name Gradual Type Theory
On the Expressiveness and Monitoring of Metric Temporal Logic
An operational interpretation of coinductive types
Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
The Big-O Problem
An extensible equality checking algorithm for dependent type theories
Computably Based Locally Compact Spaces
Coherence for Frobenius pseudomonoids and the geometry of linear proofs
Adaptive Non-linear Pattern Matching Automata
Decidability for Sturmian words
On Free ω-Continuous and Regular Ordered Algebras
Visibly Tree Automata with Memory and Constraints
On the Unprovability of Circuit Size Bounds in Intuitionistic $\mathsf{S}^1_2$
Coalgebraic Satisfiability Checking for Arithmetic μ-Calculi
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence
Decreasing Diagrams for Confluence and Commutation
Presburger Arithmetic with algebraic scalar multiplications
Inductive and Coinductive Topological Generation with Church's thesis and the Axiom of Choice
Asynchronous Session-Based Concurrency: Deadlock-freedom in Cyclic Process Networks
A Normalizing Intuitionistic Set Theory with Inaccessible Sets
A syntactic approach to continuity of T-definable functionals
Enumerating Answers to First-Order Queries over Databases of Low Degree
Moving a Derivation Along a Derivation Preserves the Spine in Adhesive Categories
On properties of B-terms
On the Expressiveness of the Ambient Logic
Uniform Interpolants in EUF: Algorithms using DAG-representations
The principle of pointfree continuity
Fair Asynchronous Session Subtyping
Coinductive Formal Reasoning in Exact Real Arithmetic
One-Clock Priced Timed Games with Negative Weights
Computability in Basic Quantum Mechanics
Worst-Case Input Generation for Concurrent Programs under Non-Monotone Resource Metrics
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
General recursion via coinductive types
Sharing proofs with predicative theories through universe-polymorphic elaboration
Distances between States and between Predicates
Comparator automata in quantitative verification
Transforming structures by set interpretations
Definable isomorphism problem
Collaboration vs. choreography conformance in BPMN
FlexFringe: Modeling Software Behavior by Learning Probabilistic Automata
Regular tree languages in low levels of the Wadge Hierarchy
Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
On open well-filtered spaces
Operations on Fixpoint Equation Systems
Local Redundancy in SAT: Generalizations of Blocked Clauses
Categorifying computable reducibilities
HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems
Higher Order Automatic Differentiation of Higher Order Functions
On Sub-Propositional Fragments of Modal Logic
Deciding Equations in the Time Warp Algebra
Elementary Quotient Completions, Church's Thesis, and Partioned Assemblies
Feedback computability on Cantor space
History-deterministic Timed Automata
A Cubical Language for Bishop Sets
Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features
Theory of higher order interpretations and application to Basic Feasible Functions
Interpolating Between Choices for the Approximate Intermediate Value Theorem
Determinisability of register and timed automata
A Logic for Monitoring Dynamic Networks of Spatially-distributed Cyber-Physical Systems
Convexity via Weak Distributive Laws
An extended type system with lambda-typed lambda-expressions
Modular Path Queries with Arithmetic
On the Semantic Expressiveness of Iso- and Equi-Recursive Types
Coinductive Streams in Monoidal Categories
Extended Stone Duality via Monoidal Adjunctions
Reasoning About Bounds in Weighted Transition Systems
TSO Games - On the decidability of safety games under the total store order semantics (extended LMCS version with appendix)
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
Coalgebraic Automata Theory: Basic Results
A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
Continuous Regular Functions
On the algebraic structure of Weihrauch degrees
The Church Synthesis Problem with Parameters
Mixin Composition Synthesis based on Intersection Types
On completeness and parametricity in the realizability semantics of System F
A coherent differential PCF
Modular coinduction up-to for higher-order languages via first-order transition systems
Inhabitation for Non-idempotent Intersection Types
Proof Theory of Riesz Spaces and Modal Riesz Spaces
Normalisation by Evaluation for Type Theory, in Type Theory
Sculptures in Concurrency
On sets of terms having a given intersection type
A proof system for graph (non)-isomorphism verification
Bounded variation and the strength of Helly's selection theorem
Scalar and Vectorial mu-calculus with Atoms
Probabilistic Algorithmic Knowledge
A Functional (Monadic) Second-Order Theory of Infinite Trees
Multi-Objective Model Checking of Markov Decision Processes
Instance reducibility and Weihrauch degrees
Reachability for infinite time Turing machines with long tapes
Guarded and Unguarded Iteration for Generalized Processes
Galois connecting call-by-value and call-by-name
Towards a Minimal Stabilizer ZX-calculus
A generalization of a theorem of Hurewicz for quasi-Polish spaces
Designing Equilibria in Concurrent Games with Social Welfare and Temporal Logic Constraints
Proof complexity of positive branching programs
Complexity Hierarchies and Higher-order Cons-free Term Rewriting
A note on first-order spectra with binary relations
Adding Negation to Lambda Mu
Event Structures for Petri nets with Persistence
Point-free Construction of Real Exponentiation
Modal Logics of Topological Relations
Sum and Tensor of Quantitative Effects
Monadic Second Order Logic with Measure and Category Quantifiers
Logical compactness and constraint satisfaction problems
Behavioural equivalences for timed systems
Multi-Structural Games and Beyond
Faithful (meta-)encodings of programmable strategies into term rewriting systems
On the Descriptive Complexity of Groups without Abelian Normal Subgroups
Relating Reversible Petri Nets and Reversible Event Structures, categorically
Timeout Asynchronous Session Types: Safe Asynchronous Mixed-Choice For Timed Interactions
Sound approximate and asymptotic probabilistic bisimulations for PCTL
Improved Algorithms for Parity and Streett objectives
Failure of Normalization in Impredicative Type Theory with Proof-Irrelevant Propositional Equality
Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners
Enumerating Independent Linear Inferences
Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests
A proof of strong normalisation using domain theory
What Monads Can and Cannot Do with a Few Extra Pages
The Complexity of Bisimulation and Simulation on Finite Systems
Proper Functors and Fixed Points for Finite Behaviour
On Presburger arithmetic extended with non-unary counting quantifiers
Model Theory and Proof Theory of Coalgebraic Predicate Logic
Semantics of Separation-Logic Typing and Higher-order Frame Rules for Algol-like Languages
String Diagrams for Premonoidal Categories
A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
Regular Tree Algebras
A cone-theoretic barycenter existence theorem
Extending the theory of Owicki and Gries with a logic of progress
Multi-representation associated to the numbering of a subbasis and formal inclusion relations
Direct spectra of Bishop spaces and their limits
Foundations of regular coinduction
Minimization of visibly pushdown automata is NP-complete
Computation Against a Neighbour: Addressing Large-Scale Distribution and Adaptivity with Functional Programming and Scala
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence
Impure Simplicial Complexes: Complete Axiomatization
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
Enumeration and updates for conjunctive linear algebra queries through expressibility
On the Home-Space Problem for Petri Nets and its Ackermannian Complexity
Zeta Functions and the (Linear) Logic of Markov Processes
Universal Algebraic Methods for Constraint Satisfaction Problems
Model-checking problems as a basis for parameterized intractability
Life is Random, Time is Not: Markov Decision Processes with Window Objectives
Covariance and Controvariance: a fresh look at an old issue (a primer in advanced type systems for learning functional programmers)
Linear Abadi and Plotkin Logic
Hilbert's Tenth Problem in Coq (Extended Version)
Offline and Online Use of Interval and Set-Based Approaches for Control and State Estimation: A Selection of Methodological Approaches and Their Application
A topological interpretation of three Leibnizian principles within the functional extensions
Existence of strongly proper dyadic subbases
Logic Meets Algebra: the Case of Regular Languages
Signatures and Induction Principles for Higher Inductive-Inductive Types
Congruence Closure Modulo Groups
Simply typed convertibility is TOWER-complete even for safe lambda-terms
Linear Encodings of Bounded LTL Model Checking
Axiomatizing Hybrid XPath with Data
On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory
Random Deterministic Automata With One Added Transition
Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
Monoidal Width
Stubborn Set Reduction for Two-Player Reachability Games
Simulation by Rounds of Letter-to-Letter Transducers
Complete Call-by-Value Calculi of Control Operators II: Strong Termination
Soundness in negotiations
The Sierpinski Object in the Scott Realizability Topos
MacroSwarm: A Field-based Compositional Framework for Swarm Programming
Constant-delay enumeration for SLP-compressed documents
A Finite-Model-Theoretic View on Propositional Proof Complexity
A Note on the Topologicity of Quantale-Valued Topological Spaces
The Size-Change Principle for Mixed Inductive and Coinductive types
On the consistency of stronger lower bounds for NEXP
Interactive Small-Step Algorithms I: Axiomatization
From Logic to Biology via Physics: a survey
Logical relations for coherence of effect subtyping
Games for Bisimulations and Abstraction
Semi-Continuous Sized Types and Termination
Boundedness in languages of infinite words
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
Aspects of algebraic Algebras
On the Compositionality of Quantitative Information Flow
The Data Complexity of Ontology-Mediated Queries with Closed Predicates
From Thin Concurrent Games to Generalized Species of Structures (Extended Version)
Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
Regular Separability of One Counter Automata
Differentials and distances in probabilistic coherence spaces
Token Games and History-Deterministic Quantitative-Automata
On the decidability and complexity of Metric Temporal Logic over finite words
Generalised Mermin-type non-locality arguments
A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
Architectures in parametric component-based systems: Qualitative and quantitative modelling
Bootstrapping Inductive and Coinductive Types in HasCASL
Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge
Recursion Schemes, the MSO Logic, and the U quantifier
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
A new coinductive confluence proof for infinitary lambda calculus
Output-sensitive Information flow analysis
Datatype defining rewrite systems for naturals and integers
Fixed Points Theorems for Non-Transitive Relations
Canonicity and homotopy canonicity for cubical type theory
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
Formalising the Double-Pushout Approach to Graph Transformation
Complexity theory for spaces of integrable functions
A Near-Optimal Parallel Algorithm for Joining Binary Relations
Lambda-RBAC: Programming with Role-Based Access Control
Compatibility Properties of Synchronously and Asynchronously Communicating Components
Derivatives on Graphs for the Positive Calculus of Relations with Transitive Closure
The π-Calculus is Behaviourally Complete and Orbit-Finitely Executable
Modal Functional (Dialectica) Interpretation
Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers
Algebraic Pattern Matching in Join Calculus
On the Expressive Power of Higher-Order Pushdown Systems
Call-by-Value Termination in the Untyped lambda-Calculus
Computability of Data-Word Transductions over Different Data Domains
Optimizing tree decompositions in MSO
Strongly-Normalizing Higher-Order Relational Queries
Conformance Relations and Hyperproperties for Doping Detection in Time and Space
Are there Hilbert-style Pure Type Systems?
Coaxioms: flexible coinductive definitions by inference systems
From Proof Nets to the Free *-Autonomous Category
Approximate reasoning for real-time probabilistic processes
Multiparty testing preorders
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems
From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata
On the Succinctness of Atoms of Dependency
Distributed controller synthesis for deadlock avoidance
Definability and Interpolation within Decidable Fixpoint Logics
A Truly Concurrent Semantics for Reversible CCS
Higher-Order Asynchronous Effects
On the incomputability of computable dimension
First-order queries on classes of structures with bounded expansion
Discovering ePassport Vulnerabilities using Bisimilarity
Decomposition Strategies and Multi-shot ASP Solving for Job-shop Scheduling
Disjunctive bases: normal forms and model theory for modal logics
An enriched view on the extended finitary monad-Lawvere theory correspondence
Light Logics and the Call-by-Value Lambda Calculus
An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets
Thin Games with Symmetry and Concurrent Hyland-Ong Games
Foundations of probability-raising causality in Markov decision processes
Ticking clocks as dependent right adjoints: Denotational semantics for clocked type theory
The Power-Set Construction for Tree Algebras
A modular construction of type theories
A First-Order Complete Temporal Logic for Structured Context-Free Languages
Preservation theorems for Tarski's relation algebra
Computably regular topological spaces
Conjunctive Queries with Free Access Patterns under Updates
LLF 𝒫 : a logical framework for modeling external evidence, side conditions, and proof irrelevance using monads
The Algebraic Intersection Type Unification Problem
Higher-dimensional automata modeling shared-variable systems
Topological Scott Convergence Theorem
Boolean basis, formula size, and number of modal operators
Bounded Reachability Problems are Decidable in FIFO Machines
Internalising modified realisability in constructive type theory
Range (Rényi) Entropy Queries and Partitioning
A revised completeness result for the simply typed λμ-calculus using realizability semantics
Abstract Completion, Formalized
Linear Dependent Type Theory for Quantum Programming Languages
The Theory of Traces for Systems with Nondeterminism, Probability, and Termination
Linear Programs with Conjunctive Database Queries
Completions of Kleene's second model
Convexity and Order in Probabilistic Call-by-Name FPC
Causal Unfoldings and Disjunctive Causes
Disjoint-union partial algebras
Register Games
On the Axiomatisability of Parallel Composition
Computing with Infinite Objects: the Gray Code Case
Subspace-Invariant AC00^0 Formulas
Branching Bisimilarity of Normed BPA Processes as a Rational Monoid
Characterising memory in infinite games
On Nominal Syntax and Permutation Fixed Points
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
Combinatorial Conversion and Moment Bisimulation for Stochastic Rewriting Systems
Bisimilarity in fresh-register automata
On The Axioms Of $\mathcal{M},\mathcal{N}$-Adhesive Categories
Kleene Theorem for Higher-Dimensional Automata
A Recursive Approach to Solving Parity Games in Quasipolynomial Time
Almost periodic functions, constructively
Coherent Presentations of Monoidal Categories
Compiling With Classical Connectives
Computing the Width of Non-deterministic Automata
Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types
Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended version)
BDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs
Crash-Stop Failures in Asynchronous Multiparty Session Types
The Many-Worlds Calculus
Tight Polynomial Worst-Case Bounds for Loop Programs
Presentable signatures and initial semantics
Generic Trace Semantics via Coinduction
Parametric updates in parametric timed automata
Quantum Control in the Unitary Sphere: Lambda-S1 and its Categorical Model
Inducing syntactic cut-elimination for indexed nested sequents
A Formal Model for Polarization under Confirmation Bias in Social Networks
Elgot Algebras
A Theory of Formal Choreographic Languages
A Ghost at ω 1
Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space
Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
Deterministic pushdown automata can compress some normal sequences
Extending set functors to generalised metric spaces
Statman's Hierarchy Theorem
Applicable Mathematics in a Minimal Computational Theory of Sets
Algebraic coherent confluence and higher globular Kleene algebras
A theory of transaction parallelism in blockchains
Lifting Coalgebra Modalities and MELL Model Structure to Eilenberg-Moore Categories
On the commutativity of the powerspace constructions
Timed Session Types