194 results on '"C.-H. Luke Ong"'
Search Results
2. Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial Solving.
3. Diagonalisation SGD: Fast & Convergent SGD for Non-Differentiable Models via Reparameterisation and Smoothing.
4. Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothing.
5. CycleQ: an efficient basis for cyclic equational reasoning.
6. Guaranteed bounds for posterior inference in universal probabilistic programming.
7. Supermartingales, Ranking Functions and Probabilistic Lambda Calculus.
8. Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere.
9. The Difference λ-Calculus: A Language for Difference Categories.
10. Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties.
11. Collapsible Pushdown Parity Games.
12. Change Actions: Models of Generalised Differentiation.
13. HoCHC: A Refutationally Complete and Semantically Invariant System of Higher-order Logic Modulo Theories.
14. Fixing Incremental Computation - Derivatives of Fixpoints, and the Recursive Semantics of Datalog.
15. Typed Meta-interpretive Learning of Logic Programs.
16. The Extended Theory of Trees and Algebraic (Co)datatypes.
17. Species, Profunctors and Taylor Expansion Weighted by SMCC: A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs.
18. InterpChecker: Reducing State Space via Interpolations - (Competition Contribution).
19. ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States.
20. CycleQ: An Efficient Basis for Cyclic Equational Reasoning.
21. Automata, Logic and Games for the λ-Calculus.
22. Generalised species of rigid resource terms.
23. Quantitative semantics of the lambda calculus: Some generalisations of the relational model.
24. More effective interpolations in software model checking.
25. ML and Extended Branching VASS.
26. Collapsible Pushdown Parity Games.
27. The Difference Lambda-Calculus: A Language for Difference Categories.
28. Verifying Liveness Properties of ML Programs.
29. Densities of almost-surely terminating probabilistic programs are differentiable almost everywhere.
30. Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties.
31. Higher-order constrained horn clauses for verification.
32. Plays as Resource Terms via Non-idempotent Intersection Types.
33. On Hierarchical Communication Topologies in the \pi -calculus.
34. Unboundedness and downward closures of higher-order pushdown automata.
35. Collapsible Pushdown Automata and Recursion Schemes.
36. Polynomial Probabilistic Invariants and the Optional Stopping Theorem.
37. Fragments of ML Decidable by Nested Data Class Memory Automata.
38. Weak and Nested Class Memory Automata.
39. Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach.
40. Nondeterminism in Game Semantics via Sheaves.
41. TravMC2: higher-order model checking for alternating parity tree automata.
42. A type-directed abstraction refinement approach to higher-order model checking.
43. Compositional higher-order model checking via ω-regular games over Böhm trees.
44. Defunctionalization of Higher-Order Constrained Horn Clauses.
45. Fixing Incremental Computation: Derivatives of Fixpoints, and the Recursive Semantics of Datalog.
46. Automatic Verification of Erlang-Style Concurrency.
47. Safety Verification of Asynchronous Pushdown Systems with Shaped Stacks.
48. Two-Level Game Semantics, Intersection Types, and Recursion Schemes.
49. Hector: An Equivalence Checker for a Higher-Order Fragment of ML.
50. A traversal-based algorithm for higher-order model checking.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.