| Nome |
# |
|
On probabilistic term rewriting, file e1dcb336-9408-7715-e053-1705fe0a6cc9
|
125
|
|
On the Versatility of Open Logical Relations: Continuity, Automatic Differentiation, and a Containment Theorem, file e1dcb336-b795-7715-e053-1705fe0a6cc9
|
74
|
|
On Measure Quantifiers in First-Order Arithmetic, file e1dcb338-634f-7715-e053-1705fe0a6cc9
|
74
|
|
The Space of Interaction, file e1dcb338-2f2f-7715-e053-1705fe0a6cc9
|
69
|
|
Decomposing Probabilistic Lambda-Calculi, file e1dcb336-c40a-7715-e053-1705fe0a6cc9
|
64
|
|
Intersection types and (positive) almost-sure termination, file e1dcb338-581f-7715-e053-1705fe0a6cc9
|
60
|
|
The machinery of interaction, file e1dcb336-6ff2-7715-e053-1705fe0a6cc9
|
53
|
|
Computation by interaction for space-bounded functional programming, file e1dcb338-8ba0-7715-e053-1705fe0a6cc9
|
50
|
|
(Leftmost-outermost) beta reduction is invariant, indeed, file e1dcb32d-d2f4-7715-e053-1705fe0a6cc9
|
46
|
|
On continuation-passing transformations and expected cost analysis, file e1dcb338-7e3b-7715-e053-1705fe0a6cc9
|
45
|
|
The geometry of parallelism: Classical, probabilistic, and quantum effects, file e1dcb338-3860-7715-e053-1705fe0a6cc9
|
44
|
|
Probabilistic termination by monadic affine sized typing, file e1dcb338-300d-7715-e053-1705fe0a6cc9
|
42
|
|
The (In)Efficiency of interaction, file e1dcb338-40d9-7715-e053-1705fe0a6cc9
|
40
|
|
Differential logical relations, part II increments and derivatives, file e1dcb33a-0f5e-7715-e053-1705fe0a6cc9
|
31
|
|
On higher-order cryptography, file e1dcb336-b9ce-7715-e053-1705fe0a6cc9
|
25
|
|
The geometry of Bayesian programming, file e1dcb339-3d7e-7715-e053-1705fe0a6cc9
|
24
|
|
Differential logical relations, Part I: The simply-typed case, file e1dcb333-acbb-7715-e053-1705fe0a6cc9
|
23
|
|
A Relational Theory of Effects and Coeffects, file 0dc47b5a-d55b-457a-9c0f-7da02b6b0d96
|
21
|
|
Multi Types and Reasonable Space, file 90527d59-f2da-4ea9-b3b4-48786eadffed
|
21
|
|
Curry and Howard Meet Borel, file 9a08d3ef-dc35-4608-81b3-09e4fb5fd436
|
21
|
|
A Recursion-Theoretic Characterization of the Probabilistic Class PP, file e1dcb338-3c7b-7715-e053-1705fe0a6cc9
|
21
|
|
On Counting Propositional Logic and Wagner's Hierarchy, file e1dcb339-45cc-7715-e053-1705fe0a6cc9
|
20
|
|
Effectful applicative similarity for call-by-name lambda calculi, file 0bdd5224-7577-45dd-afc3-7abca5c32c6f
|
18
|
|
On the termination problem for probabilistic higher-order recursive programs, file e1dcb336-be0d-7715-e053-1705fe0a6cc9
|
16
|
|
On the Taylor expansion of probabilistic λ-terms, file e1dcb334-6e77-7715-e053-1705fe0a6cc9
|
14
|
|
On the Lattice of Program Metrics, file 951bf3d3-f206-4ad1-a541-67826573b415
|
13
|
|
Resource transition systems and full abstraction for linear higher-order effectful programs, file e1dcb338-618b-7715-e053-1705fe0a6cc9
|
13
|
|
Effectful program distancing, file 18c6a59b-3885-4615-b1bd-b11e6d1c5056
|
12
|
|
On Counting Propositional Logic and Wagner's Hierarchy, file 9fb5f0d0-d93f-4c9a-b6eb-048a2bf39b5e
|
10
|
|
Solvability in a probabilistic setting, file e1dcb337-9944-7715-e053-1705fe0a6cc9
|
10
|
|
Reasonable Space for the Lambda-Calculus, Logarithmically, file 1fe0f457-89a5-4c2f-9865-34bf60591fa7
|
6
|
|
On coinduction and quantum lambda calculi, file e1dcb32d-d4c7-7715-e053-1705fe0a6cc9
|
6
|
|
Light logics and higher-order processes, file e1dcb32e-6448-7715-e053-1705fe0a6cc9
|
6
|
|
Open Higher-Order Logic, file 47d9c511-2ef7-4ba9-9d7a-cc9d09bf030e
|
5
|
|
On Quantitative Algebraic Higher-Order Theories, file f74fda57-2a73-4fbb-b104-90a0f9e4c026
|
5
|
|
On Feller Continuity and Full Abstraction, file 60fae8cb-ba68-4843-8a56-69a3f22a8a2d
|
4
|
|
On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments, file 8759c952-4a70-4db4-8958-4f300a64cc06
|
4
|
|
On Higher-Order Probabilistic Subrecursion, file 09d506c9-9086-4305-8fea-2e6dbb248853
|
3
|
|
On the termination problem for probabilistic higher-order recursive programs, file 79c9c9f3-65f4-49d1-a0a2-b2800db1f0f9
|
3
|
|
Tidy: Symbolic Verification of Timed Cryptographic Protocols, file a7c1de35-34ad-4c90-becc-51ef4435cf87
|
3
|
|
null, file e1dcb32c-2a7a-7715-e053-1705fe0a6cc9
|
3
|
|
Computation by interaction for space-bounded functional programming, file e1dcb32d-d420-7715-e053-1705fe0a6cc9
|
3
|
|
On the termination problem for probabilistic higher-order recursive programs, file e1dcb333-ed9b-7715-e053-1705fe0a6cc9
|
3
|
|
On sharing, memoization, and polynomial time, file e1dcb32d-1c3a-7715-e053-1705fe0a6cc9
|
2
|
|
On Bisimilarity in Lambda Calculi with Continuous Probabilistic Choice, file e1dcb334-8537-7715-e053-1705fe0a6cc9
|
2
|
|
On randomised strategies in the λ-calculus, file e1dcb336-92ad-7715-e053-1705fe0a6cc9
|
2
|
|
Differential logical relations, part II increments and derivatives, file e1dcb339-4803-7715-e053-1705fe0a6cc9
|
2
|
|
On coinductive equivalences for higher-order probabilistic functional programs, file e1dcb32c-dc1f-7715-e053-1705fe0a6cc9
|
1
|
|
Derivational Complexity is an Invariant Cost Model, file e1dcb32c-e917-7715-e053-1705fe0a6cc9
|
1
|
|
A lambda-calculus foundation for universal probabilistic programming, file e1dcb32f-afc2-7715-e053-1705fe0a6cc9
|
1
|
|
The Geometry of Bayesian Programming, file e1dcb333-cd10-7715-e053-1705fe0a6cc9
|
1
|
|
Probabilistic termination by monadic affine sized typing, file e1dcb334-386e-7715-e053-1705fe0a6cc9
|
1
|
|
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs, file e1dcb334-8112-7715-e053-1705fe0a6cc9
|
1
|
|
Effectful applicative similarity for call-by-name lambda calculi, file eaf36720-62d6-4717-bb21-c9f246ac8225
|
1
|
| Totale |
1.168 |