default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLogical Methods in Computer Science, Volume 16
Volume 16, Number 1, 2020
- Anupam Das
:
On the logical complexity of cyclic arithmetic. - Egbert Rijke, Michael Shulman, Bas Spitters:
Modalities in homotopy type theory. - Delia Kesner, Pierre Vial:
Non-idempotent types for classical calculi in natural deduction style. - Sean Tull:
A Categorical Reconstruction of Quantum Theory. - Étienne André, Didier Lime, Nicolas Markey:
Language Preservation Problems in Parametric Timed Automata. - Robert Furber, Radu Mardare, Matteo Mio:
Probabilistic logics based on Riesz spaces. - Max S. New, Daniel R. Licata:
Call-by-name Gradual Type Theory. - Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder:
Efficient and Modular Coalgebraic Partition Refinement. - Marcelo Arenas, Martin Muñoz, Cristian Riveros:
Descriptive Complexity for Counting Complexity Classes. - Ambrus Kaposi, András Kovács:
Signatures and Induction Principles for Higher Inductive-Inductive Types. - Lukasz Czajka:
An operational interpretation of coinductive types. - Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith:
Undecidability of a weak version of MSO+U. - Francesco Ciraulo, Michele Contente:
Overlap Algebras: a Constructive Look at Complete Boolean Algebras. - Olivier Gauwin, Anca Muscholl, Michael Raskin:
Minimization of visibly pushdown automata is NP-complete. - Giuseppe Castagna:
Covariance and Controvariance: a fresh look at an old issue (a primer in advanced type systems for learning functional programmers). - Achim Blumensath:
Regular Tree Algebras. - Alexi Block Gorman, Philipp Hieronymi, Elliot Kaplan, Ruoyu Meng, Erik Walsberg, Zihe Wang, Ziqin Xiong, Hongru Yang:
Continuous Regular Functions. - Iosif Petrakis:
McShane-Whitney extensions in constructive analysis. - Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho:
On Nominal Syntax and Permutation Fixed Points. - Pawel Parys:
Recursion Schemes, the MSO Logic, and the U quantifier. - Manuel Bodirsky, Johannes Greiner:
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems. - Chuangjie Xu:
A syntactic approach to continuity of T-definable functionals. - Jörg Endrullis, Jan Willem Klop, Roy Overbeek:
Decreasing Diagrams for Confluence and Commutation. - Michaël Cadilhac, Olivier Carton, Charles Paperman:
Continuity of Functional Transducers: A Profinite Study of Rational Functions. - Wojciech Kazana, Luc Segoufin:
First-order queries on classes of structures with bounded expansion. - Bart Jacobs, Abraham Westerbaan:
Distances between States and between Predicates. - Lê Thành Dung Nguyên:
Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix. - Olivier Bournez, Amaury Pouly:
A Universal Ordinary Differential Equation. - Alexander A. Semenov, Ilya V. Otpuschennikov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov:
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems. - Mathys Rennela, Sam Staton:
Classical Control, Quantum Circuits and Linear Logic in Enriched Category Theory. - Lukasz Czajka:
A new coinductive confluence proof for infinitary lambda calculus. - Thomas Colcombet, Daniela Petrisan:
Automata Minimization: a Functorial Approach.
Volume 16, Number 2, 2020
- Willem Conradie, Salih Durhan, Guido Sciavicco:
An Integrated First-Order Theory of Points and Intervals over Linear Orders (Part II). - Merlin Carl, Benjamin G. Rin, Philipp Schlicht:
Reachability for infinite time Turing machines with long tapes. - G. Michele Pinna:
Representing Dependencies in Event Structures. - Amir M. Ben-Amram, Geoff W. Hamilton:
Tight Polynomial Worst-Case Bounds for Loop Programs. - Ludwig Staiger:
On the incomputability of computable dimension. - Karoliina Lehtinen, Udi Boker:
Register Games. - Ulrik Buchholtz, Kuen-Bang Hou (Favonia):
Cellular Cohomology in Homotopy Type Theory. - Mirai Ikebuchi, Keisuke Nakano:
On properties of B-terms. - Davide Basile, Maurice H. ter Beek, Rosario Pugliese:
Synthesis of Orchestrations and Choreographies: Bridging the Gap between Supervisory Control and Coordination of Services. - Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi:
Trace Refinement in Labelled Markov Decision Processes. - Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart:
Completeness of the ZX-Calculus. - Jan Bydzovsky, Jan Krajícek, Igor C. Oliveira:
Consistency of circuit lower bounds with bounded theories. - Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. - Andreas Abel, Thierry Coquand:
Failure of Normalization in Impredicative Type Theory with Proof-Irrelevant Propositional Equality.
Volume 16, Number 3, 2020
- Andrew Polonsky:
Fixed point combinators as fixed points of higher-order fixed point generators. - Axel Kerinec, Giulio Manzonetto, Michele Pagani:
Revisiting Call-by-value Böhm trees in light of their Taylor expansion. - Matthew Frank:
Interpolating Between Choices for the Approximate Intermediate Value Theorem. - Eric Goubault, Samuel Mimram:
Directed Homotopy in Non-Positively Curved Spaces. - Nicolas Behr, Vincent Danos, Ilias Garnier:
Combinatorial Conversion and Moment Bisimulation for Stochastic Rewriting Systems. - Nicolas Behr, Pawel Sobocinski:
Rule Algebras for Adhesive Categories. - Diego Figueira, Anirban Majumdar, M. Praveen:
Playing with Repetitions in Data Words Using Energy Games. - Willem Conradie, Alessandra Palmigiano:
Constructive Canonicity of Inductive Inequalities. - Jan Krajícek:
A limitation on the KPT interpolation. - G. A. Kavvos:
Dual-Context Calculi for Modal Logic. - Pawel Parys:
On the Expressive Power of Higher-Order Pushdown Systems. - Tom de Jong, Jaap van Oosten:
The Sierpinski Object in the Scott Realizability Topos. - Paul Downen, Zena M. Ariola:
Compiling With Classical Connectives. - Rob van Glabbeek, Bas Luttik, Linda Spaninks:
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence. - Hendrik Pieter Barendregt:
Gems of Corrado Böhm. - Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing:
Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership. - Thomas Powell:
A unifying framework for continuity and complexity in higher types. - Laura Bocchi, Hernán C. Melgratti, Emilio Tuosto:
On Resolving Non-determinism in Choreographies. - Jan Friso Groote, Tim A. C. Willemse:
A symmetric protocol to establish service level agreements.
Volume 16, Number 4, 2020
- Giorgio Audrito, Jacob Beal, Ferruccio Damiani, Danilo Pianini, Mirko Viroli:
Field-based Coordination with the Share Operator. - Naoki Kobayashi, Ugo Dal Lago, Charles Grellois:
On the Termination Problem for Probabilistic Higher-Order Recursive Programs. - Jan Kretínský, Tobias Meggendorfer:
Of Cores: A Partial-Exploration Framework for Markov Decision Processes. - Alain Finkel, M. Praveen:
Verification of Flat FIFO Systems. - Hernán C. Melgratti, Claudio Antares Mezzina, Irek Ulidowski:
Reversing Place Transition Nets. - Anupam Das, Colin Riba:
A Functional (Monadic) Second-Order Theory of Infinite Trees. - Flavio Corradini, Andrea Morichetta, Andrea Polini, Barbara Re, Francesco Tiezzi:
Collaboration vs. choreography conformance in BPMN. - Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard:
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. - Olivier Carton, Luc Boasson:
Transfinite Lyndon words. - Mathys Rennela:
Convexity and Order in Probabilistic Call-by-Name FPC. - Stefan Hetzl, Jannik Vierling:
Clause Set Cycles and Induction. - Matthias Weber:
An extended type system with lambda-typed lambda-expressions. - Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour:
Life is Random, Time is Not: Markov Decision Processes with Window Objectives. - Emmanuel Hainry, Romain Péchoux:
Theory of higher order interpretations and application to Basic Feasible Functions. - Wen Kokke, J. Garrett Morris, Philip Wadler:
Towards Races in Linear Logic. - Johannes Åman Pohjola:
Psi-Calculi Revisited: Connectivity and Compositionality. - Bassel Mannaa, Rasmus Ejlers Møgelberg, Niccolò Veltri:
Ticking clocks as dependent right adjoints: Denotational semantics for clocked type theory. - Chong Shen, Xiaoyong Xi, Xiaoquan Xu, Dongsheng Zhao:
On open well-filtered spaces. - Miriam Backens, Simon Perdrix, Quanlong Wang:
Towards a Minimal Stabilizer ZX-calculus.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-03 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
