User contributions for Jacques
From WG 2.11
Jump to navigationJump to search
12 October 2026
- 18:3318:33, 12 October 2026 diff hist +861 WG211/M26Schedule →Schedule
- 18:1618:16, 12 October 2026 diff hist +350 WG211/M26Schedule →Schedule
9 October 2026
- 20:5120:51, 9 October 2026 diff hist +985 N WG211/M26Balaci Created page with "Executable code often takes priority over documentation in software development. One inherent problem is knowledge duplication in code and documentation. Can we avoid that by generating everything? What would such a process look like? This talk will discuss exploratory work in Drasil, a software generation framework for complete scientific software artifacts fit for humans, where we define "complete" as containing all software artifacts normally contained in a code repo..." current
- 20:5120:51, 9 October 2026 diff hist +47 WG211/M26Schedule →Talks
- 20:0820:08, 9 October 2026 diff hist +484 N WG211/M26Mullanix Created page with "Proof assistants based off of dependent types all use roughly the same core calculi, but use a variety of implementation strategies for their front-ends. To compare and constrast the performance of these systems, we have developed \emph{Panbench}, an extensible DSL for generating programs of increasing size for Agda 2, Rocq, Lean 4, and Idris 2. In this talk, I will discuss the design of the Panbench DSL, and detail a refinement of tagless embeddings used to encode it in..." current
- 20:0820:08, 9 October 2026 diff hist +114 WG211/M26Schedule →Talks
7 October 2026
- 20:2720:27, 7 October 2026 diff hist +39 WG211/M26Schedule →Talks
- 20:2520:25, 7 October 2026 diff hist +345 WG211/M26Schedule →Group excursion
- 20:2120:21, 7 October 2026 diff hist +45 WG211/M26Schedule →Registration fee Tag: Visual edit
- 20:2020:20, 7 October 2026 diff hist +377 WG211/M26Schedule →Group dinners
- 20:1320:13, 7 October 2026 diff hist −148 WG211/M26Schedule No edit summary Tag: Visual edit
2 September 2026
24 August 2026
- 21:0421:04, 24 August 2026 diff hist +67 WG211/M26Schedule →Guests and Observers
- 21:0021:00, 24 August 2026 diff hist +289 WG211/M26Schedule →Travel
21 August 2026
- 17:2917:29, 21 August 2026 diff hist +47 WG211/M26Schedule →Travel
- 17:1817:18, 21 August 2026 diff hist +1,165 WG211/M26Schedule →Travel Tag: Visual edit
13 June 2026
12 June 2026
- 21:5221:52, 12 June 2026 diff hist +375 WG211/M26Schedule →Accommodation
- 21:4921:49, 12 June 2026 diff hist −1 WG211/M26Schedule →Accommodation
- 21:4821:48, 12 June 2026 diff hist +1 WG211/M26Schedule →Travel
- 21:4821:48, 12 June 2026 diff hist −1 WG211/M26Schedule →Venue
- 21:4621:46, 12 June 2026 diff hist +664 WG211/M26Schedule →Venue Tag: Visual edit
5 June 2026
- 19:1519:15, 5 June 2026 diff hist +2,057 N WG211/M26Schedule Created page with "= IFIP Working Group 2.11, Twenty-sixth Meeting = == October 13-16, 2026, Niagara-on-the-Lake, Ontario, Canada == The meeting will be held on the (outskirts of) Niagara-on-the-Lake, in the middle of the Niagara region wine country, hosted by [mailto:carette@mcmaster.ca Jacques Carette]. The meeting is planned for 3.5 days, with a half day on October 16. More details, program, and registration information will be appearing on this page in the next few weeks. === Venue..."
- 17:4917:49, 5 June 2026 diff hist +11 Main Page →Current Activity
- 17:4717:47, 5 June 2026 diff hist +78 Main Page →Past Activity
11 December 2025
- 14:4014:40, 11 December 2025 diff hist +880 N W211/M25Shan 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..." current
10 December 2025
- 15:2915:29, 10 December 2025 diff hist 0 N File:WG211 M25 Shan.pdf No edit summary current
- 15:2915:29, 10 December 2025 diff hist +120 WG211/M25Schedule →Talks current
- 15:2615:26, 10 December 2025 diff hist +66 N File:WG211 M25 Group Photo.jpg Pictures of all the people who attended this meeting current
- 15:2515:25, 10 December 2025 diff hist +68 WG211/M25Schedule →IFIP Working Group 2.11, Twenty-fifth Meeting
3 December 2025
- 06:3706:37, 3 December 2025 diff hist −6 WG211/M25Schedule →Schedule
- 06:3606:36, 3 December 2025 diff hist +351 WG211/M25Schedule →Schedule
2 December 2025
- 16:5516:55, 2 December 2025 diff hist +16 WG211/M25Schedule →Schedule
- 16:5516:55, 2 December 2025 diff hist +340 WG211/M25Schedule →Schedule
- 13:0413:04, 2 December 2025 diff hist −36 WG211/M25Schedule →Schedule
1 December 2025
- 18:0018:00, 1 December 2025 diff hist +35 WG211/M25Schedule →Schedule
- 17:5917:59, 1 December 2025 diff hist +368 WG211/M25Schedule →Talks and Schedule
21 November 2025
- 20:1420:14, 21 November 2025 diff hist +120 WG211/M25Schedule →Arrivals and departures of attendants
- 20:1320:13, 21 November 2025 diff hist +1,280 N WG211/M25Barke 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..." current
- 20:1220:12, 21 November 2025 diff hist +98 WG211/M25Schedule →Talks and Schedule
19 November 2025
- 17:5117:51, 19 November 2025 diff hist +207 WG211/M25Schedule →Arrivals and departures of attendants
- 17:4717:47, 19 November 2025 diff hist +782 N WG211/M25Steuwer 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..." current
- 17:4617:46, 19 November 2025 diff hist −1 WG211/M25Schedule →Talks and Schedule
- 17:4617:46, 19 November 2025 diff hist +65 WG211/M25Schedule →Talks and Schedule
12 November 2025
10 November 2025
- 21:3121:31, 10 November 2025 diff hist +71 WG211/M25Schedule →Talks and Schedule
- 21:2921:29, 10 November 2025 diff hist +157 WG211/M25Schedule →Guests and Observers
7 November 2025
- 17:0717:07, 7 November 2025 diff hist +760 N WG211/M25Yallop 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..." current
- 17:0717:07, 7 November 2025 diff hist +88 WG211/M25Schedule →Talks and Schedule
3 November 2025
- 18:2518:25, 3 November 2025 diff hist +492 N WG211/M25Kammar 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..." current
