| A quantum algorithm to approximate the linear structures of Boolean functions |
5 |
| Brouwer's fixed-point theorem in real-cohesive homotopy type theory |
5 |
| Polygraphs of finite derivation type |
4 |
| Subexponentials in non-commutative linear logic |
3 |
| On the expressiveness of pi-calculus for encoding mobile ambients |
3 |
| Proof-relevant pi-calculus: a constructive account of concurrency and causality |
3 |
| Autostability spectra for decidable structures |
3 |
| Calibrating word problems of groups via the complexity of equivalence relations |
3 |
| Quotienting the delay monad by weak bisimilarity |
2 |
| Cellular automata over generalized Cayley graphs |
2 |
| Disintegration and Bayesian inversion via string diagrams |
2 |
| Strategic port graph rewriting: an interactive modelling framework |
2 |
| An introduction to differential linear logic: proof-nets, models and antiderivatives |
2 |
| Execution time of lambda-terms via denotational semantics and intersection types |
2 |
| A homotopy-theoretic model of function extensionality in the effective topos |
2 |
| Expansion trees with cut |
2 |
| Syllogistic logic with Most |
1 |
| Coinductive predicates and final sequences in a fibration |
1 |
| Validating Brouwer's continuity principle for numbers using named exceptions |
1 |
| Limits in categories of Vietoris coalgebras |
1 |
| The computational power of timed P systems with active membranes using promoters |
1 |
| A generalised quantifier theory of natural language in categorical compositional distributional semantics with bialgebras |
1 |
| Denotational semantics of recursive types in synthetic guarded domain theory |
1 |
| The quantum walk search algorithm: factors affecting efficiency |
1 |
| On geometry of interaction for polarized linear logic |
1 |
| Integral categories and calculus categories |
1 |
| Natural models of homotopy type theory |
1 |
| The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics |
1 |
| Optimal enforcement of (timed) properties with uncontrollable events |
1 |
| Newton series, coinductively: a comparative study of composition |
0 |
| A resource aware semantics for a focused intuitionistic calculus |
0 |
| Reasoning about knowledge and messages in asynchronous multi-agent systems |
0 |
| Converging from branching to linear metrics on Markov chains |
0 |
| A second note on the feasibility of generalized universal composability |
0 |
| Definability in the local structure of the omega-Turing degrees |
0 |
| Domains of commutative C*-subalgebras |
0 |
| Finding small counterexamples for abstract rewriting properties |
0 |
| Convergence in infinitary term graph rewriting systems is simple |
0 |
| Expressing additives using multiplicatives and subexponentials |
0 |
| Recognizable languages of arrows and cospans |
0 |
| Non-size increasing graph rewriting for natural language processing |
0 |
| A linear/producer/consumer model of classical linear logic |
0 |
| Linear pattern matching of compressed terms and polynomial rewriting |
0 |
| Multi-focused cut elimination |
0 |
| Interactive and automated proofs for graph transformations |
0 |
| Geometry of resource interaction and Taylor-Ehrhard-Regnier expansion: a minimalist approach |
0 |
| Semantics-based software watermarking by abstract interpretation |
0 |
| Nonflatness and totality |
0 |
| On Banach spaces of sequences and free linear logic exponential modality |
0 |
| Plugging-in proof development environments using Locks in LF |
0 |
