| 6176 | Lower Bounds for Monotone Span Programs (10.7146/brics.v1i46.21596) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6177 | Synthesizing Distinguishing Formulae for Real Time Systems (10.7146/brics.v1i48.21594) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6178 | Bisimulations, Games, and Logic (10.7146/brics.v1i6.21664) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6179 | An Optimal O(log log n) Time Parallel Algorithm for Detectin… (10.7146/brics.v2i11.19514) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6180 | The Girard Translation Extended with Recursion (10.7146/brics.v2i13.19882) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6181 | Basic Action Theory (10.7146/brics.v2i25.19927) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6182 | An n log n Algorithm for Online BDD Refinement (10.7146/brics.v2i29.19931) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6183 | From Branching to Linear Metric Domains (and back) (10.7146/brics.v2i30.19933) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6184 | Trust in the lambda-calculus (10.7146/brics.v2i31.19934) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6185 | Efficient Inference of Object Types (10.7146/brics.v2i32.19935) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6186 | Type Inference with Nonstructural Subtyping (10.7146/brics.v2i33.19936) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6187 | Non-primitive Recursive Function Definitions (10.7146/brics.v2i36.19939) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6188 | Experiments with ZF Set Theory in HOL and Isabelle (10.7146/brics.v2i37.19940) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6189 | A Fully Abstract Denotational Model for Observational Congru… (10.7146/brics.v2i40.19942) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6190 | Eta-Expansion Does The Trick (10.7146/brics.v2i41.21673) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6191 | Automated Logical Verification based on Trace Abstractions (10.7146/brics.v2i53.19954) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6192 | Behavioural Equivalence for Infinite Systems—Partially Decid… (10.7146/brics.v2i55.19956) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6193 | Topological Aspects of Traces (10.7146/brics.v2i57.19958) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6194 | On the Finitary Bisimulation (10.7146/brics.v2i59.19960) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6195 | A Communication Complexity Proof that Symmetric Functions ha… (10.7146/brics.v3i1.19502) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6196 | Semantics-Based Compiling: A Case Study in Type-Directed Par… (10.7146/brics.v3i13.19976) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6197 | Comparing Transition Systems with Independence and Asynchron… (10.7146/brics.v3i18.19980) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6198 | Thunks and the lambda-Calculus (10.7146/brics.v3i19.19981) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6199 | Back to Direct Style II: First-Class Continuations (10.7146/brics.v3i20.19982) | References ORCID License | 22.58 | 1 | 1601-5355 |
| 6200 | An Equational Axiomatization for Multi-Exit Iteration (10.7146/brics.v3i22.19985) | References ORCID License | 22.58 | 1 | 1601-5355 |