431 results on '"Dal Lago, Ugo"'
Search Results
2. Circuit Width Estimation via Effect Typing and Linear Dependency
3. Towards logical foundations for probabilistic computation
4. Implicit recursion-theoretic characterizations of counting classes
5. On counting propositional logic and Wagner's hierarchy
6. On Measure Quantifiers in First-Order Arithmetic
7. Decomposing Probabilistic Lambda-Calculi
8. Effectful Normal Form Bisimulation
9. On Model-Checking Higher-Order Effectful Programs
10. Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
11. On Probabilistic Term Rewriting
12. Preface to the special issue on metric and differential semantics
13. On Higher-Order Probabilistic Subrecursion
14. Probabilistic Termination by Monadic Affine Sized Typing
15. Metric Reasoning About -Terms: The General Case
16. On sharing, memoization, and polynomial time
17. Towards logical foundations for probabilistic computation
18. Foundations of Software Science and Computation Structures : 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings
19. Effectful Normal Form Bisimulation
20. Applicative Bisimulation and Quantum λ-Calculi
21. On Applicative Similarity, Sequentiality, and Full Abstraction
22. On Equivalences, Metrics, and Polynomial Time
23. On Dynamic Lifting and Effect Typing in Circuit Description Languages
24. Towards a logical foundation of randomized computation
25. On the Lattice of Program Metrics
26. Contextual Behavioural Metrics
27. Open Higher-Order Logic
28. Computation by interaction for space-bounded functional programming
29. Higher-order interpretations and program complexity
30. Measurements in Proof Nets as Higher-Order Quantum Circuits
31. On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi
32. Probabilistic Recursion Theory and Implicit Computational Complexity
33. On Probabilistic Term Rewriting
34. A higher-order characterization of probabilistic polynomial time
35. Tidy: Symbolic Verification of Timed Cryptographic Protocols
36. Open Higher-Order Logic
37. On the Lattice of Program Metrics
38. Complexity Analysis in Presence of Control Operators and Higher-Order Functions
39. A Higher-Order Characterization of Probabilistic Polynomial Time
40. A Short Introduction to Implicit Computational Complexity
41. Multi types and reasonable space
42. On Feller continuity and full abstraction
43. Reasonable Space for the λ-Calculus, Logarithmically
44. Curry and Howard Meet Borel
45. Type Inference for Sublinear Space Functional Programming
46. Derivational Complexity Is an Invariant Cost Model
47. Functional Programming in Sublinear Space
48. Preface
49. On Constructor Rewrite Systems and the Lambda-Calculus
50. Bounded Linear Logic, Revisited
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.