Conferences · eligible papers
LICS
2022–2026 LIVE
Programming Languages & Formal Methods
2026 · 82 papers
このEditionに反映済みのmain full research papersのみ掲載しています。著者リンクは日本の大学への著者別所属根拠がある場合に限ります。
- A Cartesian Closed Fibration of Higher-Order Regular Languages
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Categorical Account of the Metropolis-Hastings Algorithm
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Categorical Perspective on Constraint Satisfaction: The Wonderland of Adjunctions
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Complete Equational Theory for Real-Clifford+CH Quantum Circuits
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Complexity Bound for Determinisation of Min-Plus Weighted Automata
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Computer Formalisation of the Serre Finiteness Theorem
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Convenient Fibration for Dependently-Typed Probability Theory
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Machine-Independent, Log-Sensitive Space-Cost Measure for the Weak Lambda-Calculus
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Naturally-Colored Translation from LTL to Parity and COCOA
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- A Unified Treatment of the Substitution Tensor for Presheaves, Nominal Sets, Renaming Sets, and so on
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- An Algebraic Approach to Formal System Metatheory
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Automata for MSO over Infinite Trees with Quantification over Borel Sets of Branches
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Axiomatizability of Alexandrov Dynamic Topological Logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Causality in Pure Quantum Computation with Quantum Control
- Cellular Methods in Homotopy Type Theory
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Checking History Determinism for Parity Automata Is in NP
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Classifying 2-Groups in Homotopy Type Theory
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Commutative Algebras of Series
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Complete ω-Regular Supermartingale Certificates
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Complexity Classes Arising from Circuits over Finite Algebraic Structures
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Complexity of Satisfiability in Kochen-Specker Partial Boolean Algebras
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Computation and Size of Interpolants for Hybrid Modal Logics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Constructing Small Monadic Decompositions in Presburger Arithmetic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Constructive Higher Sheaf Models with Applications to Synthetic Mathematics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Contextual MetaML: Syntax and Full Abstraction
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Decidability of Interpretability
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Definitional Proof Irrelevance Made Accessible
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Dicey Games: Shared Sources of Randomness in Distributed Systems
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Differential Tree Automata
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Dynamic Planar Graph Isomorphism Is in DynFO
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Eliminating Reversals from Cubical Type Theories
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Existential Positive Transductions of Sparse Graphs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Fat Cell Structures and Generalized Algebraic Theories
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Fixed-Parameter Tractable Inference for Discrete Probabilistic Programs, via String Diagram Algebraisation
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Forgetting Event Order in Higher-Dimensional Automata
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- From Co-Coverages to Radicals in Complete Lattices
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Generalized Decidability via Brouwer Trees
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Guarded Negation Transitive Closure Logic
Programming Languages & Formal Methods
日本大学: 千葉大学
- Hypersequent Calculi Have Ackermann Complexity
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Interpreting De Finetti’s Theorem in the Category of Integrable Cones
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- LFPL: Revisited and Mechanized
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Layered Automata: A Canonical Model for Automata over Infinite Words
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Lazy Intermediate Representations for Algebraic Effects
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Local Combinatorial Analogues for Bounded VC Dimension
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Low Rank MSO
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Meta-Mathematics of Algebraic Complexity
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Minimization of Streaming Transducers
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Mixing Any Cocktail with Limited Ingredients: On the Structure of Payoff Sets in Multi-Objective POMDPs and Its Impact on Randomised Strategies
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Monads and Distributive Laws in Substructural Contexts
Programming Languages & Formal Methods
日本大学: 総合研究大学院大学
- On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On the Computational Power of Extensional ESO
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- On the Subspace Orbit Problem and the Simultaneous Skolem Problem
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- One Rig to Control Them All
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Oracles Just for Fan: A Robust Computational Interpretation of the Fan Theorem
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- PVASS Reachability Is Decidable
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Problems with Fixpoints of Polynomials of Polynomials
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Quantum Control and General Recursion Beyond the Unitary Case
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Randomness Extraction Fails for Finite-State Dimension
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Reachability in VASS Extended with Integer Counters
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Star Complexity of Parikh Images of Languages over Infinite Alphabets
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Algebra of Iterative Constructions
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Complexity of Downward Closures of Indexed Languages
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Complexity of Nested Reset Counter Systems
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Finite Length Property of the Rado Graph and Friends
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Guarded Fragment with Nested Equivalences
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Logic of Bunched Implications Is Undecidable
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Logic of Intersection Subtyping
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Size of Interpolants in Modal Logics
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The Uniformisation of Monadic Second-Order Logic over Countable Ordinals
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- The ∞-Category of ∞-Categories in Simplicial Type Theory
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Towards Infinite PCSP: A Dichotomy for Monochromatic Cliques
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Unbounded Data Nesting for Loops in Higher-Order Programs
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Verifying Exact Samplers for Continuous Distributions with a Discrete Program Logic
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Well-Quasi-Ordered Classes of Bounded Clique-Width
Programming Languages & Formal Methods
日本大学: 関与なし(対象大学)
- Wiring the π-Calculus to Denotational Semantics
Programming Languages & Formal Methods
日本大学: 東京大学