New pages

14:4014:40, 11 December 2025 W211/M25Shan (hist | edit) [880 bytes] Jacques (talk | contribs) (Created page with "Yafei Yang and Chung-chieh Shan Developing quantum programs requires not only running them on quantum hardware but also simulating them on classical hardware. Because the semantics of a quantum program can be defined in terms of complex state vectors, it can in principle be simulated using any implementation of probabilistic or weighted programming that supports complex or at least negative weights. In this study, we compile a high-level quantum programming language to...")

20:1320:13, 21 November 2025 WG211/M25Barke (hist | edit) [1,280 bytes] Jacques (talk | contribs) (Created page with "Toward Trustworthy LLM Generation: From Verifiable Proofs to Reliable Agents Verifiable programming provides a concrete foundation for trustworthy LLM generation. This talk introduces DeepProof-32B, a 32-billion-parameter reasoning model designed for program verification and trained with reinforcement learning from verifiable rewards, achieving state-of-the-art performance among open models. The first part distills lessons from building models that can reason about thei...")

17:4717:47, 19 November 2025 WG211/M25Steuwer (hist | edit) [782 bytes] Jacques (talk | contribs) (Created page with "E-Graphs are a core data structure used in automatic reasoning and program optimization. They space-efficiently represent a set of equivalent terms. However, representing programs with bindings in e-graphs using existing techniques quickly defeats the efficiency purpose in many practical applications, as the e-graph represents alpha-equivalent terms many times. In this talk, I am going to present our work on Slotted E-Graphs that augment E-Graphs with a build-in notion...")

17:5117:51, 10 November 2025 WG211/M25Murase (hist | edit) [793 bytes] Bernd (talk | contribs) (Created page with "Kiselyov et al. introduced the notion of refined environment classifiers, which ensure scope-safe code generation with mutable state by annotating code types with *classifiers* that record the scoping information of code fragments. While their proposal was developed for a two-level, combinator-based code-generation language, we adapt their idea to quasi-quotation-based multi-stage programming in the style of MetaML. The resulting language guarantees scope-safe code gene...") Tag: Visual edit
17:5017:50, 10 November 2025 WG211/M25Lundquist (hist | edit) [0 bytes] Bernd (talk | contribs) (Created page with "Kiselyov et al. introduced the notion of refined environment classifiers, which ensure scope-safe code generation with mutable state by annotating code types with *classifiers* that record the scoping information of code fragments. While their proposal was developed for a two-level, combinator-based code-generation language, we adapt their idea to quasi-quotation-based multi-stage programming in the style of MetaML. The resulting language guarantees scope-safe code ge...")

17:0717:07, 7 November 2025 WG211/M25Yallop (hist | edit) [760 bytes] Jacques (talk | contribs) (Created page with "(joint work with Guillaume Allais, Edwin Brady, Nathan Corbyn and Ohad Kammar) We present a new design for an algebraic simplification library structured around concepts from universal algebra: theories, models, homomorphisms, and universal properties of free algebras and free extensions of algebras. The library's dependently typed interface guarantees that both built-in and user-defined simplification modules are terminating, sound, and complete with respect to a well...")

18:2518:25, 3 November 2025 WG211/M25Kammar (hist | edit) [492 bytes] Jacques (talk | contribs) (Created page with "I will describe work in progress implementing SMTLIB bindings in Idris 2. The bindings are well-scoped and intrinsically typed, and support holes and type-and-scope-safe splicing of query fragments. Since SMTLIB describes upwards of 20 different combinations of features, this is an instance of the Expression Problem. To work around it, we develop the modular abstract syntax trees (MAST) library. It provides generic, type and scope safe traversals of splicing of code frag...")

19:2319:23, 31 October 2025 WG211/M25Carette (hist | edit) [552 bytes] Jacques (talk | contribs) (Created page with "Notions of derivative abound in functional programming. An obvious question arises: what about integrals? It turns out that folds are the analogous concept. Pursuing the analogy leads us to a proper notion of "definite fold" corresponding to definite integrals (and sums and products and ...). Many concepts are needed along the way (Route, Pointed type, etc). In return, incremental and parallel versions of fold arise naturally. The correct notion of indefinite fold is a l...")

Navigation menu