From fiona.blackett at strath.ac.uk Mon Nov 3 17:21:40 2025 From: fiona.blackett at strath.ac.uk (Fiona Blackett) Date: Mon, 3 Nov 2025 17:21:40 +0000 Subject: [msp-interest] [MSP101] - Talk Rescheduled Message-ID: Hello all, Today's talk been rescheduled for Tuesday, Nov 4th at 4pm, in the same room. Here is the new zoom: https://strath.zoom.us/j/89751765924?pwd=HBoxqa8U3VeWPyt8Xbal8BYdzlRmUT.1 (Meeting ID: 897 5176 5924, Password: whiteboard) Cheers, Fiona -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.strath.ac.uk/archives/msp-interest/attachments/20251103/70ab105c/attachment.html From dilsat.yuksel at strath.ac.uk Fri Nov 7 16:37:11 2025 From: dilsat.yuksel at strath.ac.uk (Dilsat Yuksel) Date: Fri, 7 Nov 2025 16:37:11 +0000 Subject: [msp-interest] =?windows-1253?q?__=5BMSP101=5D_Ohad_Kammar=3A_Modular_abstract_?= =?windows-1253?q?syntax_trees_=28MAST=29_=96_substitution_tensors_with_se?= =?windows-1253?q?cond-class_sorts=28LT1414a=2C_1pm_Mon_10-Nov=29?= Message-ID: Hello, On Monday, the MSP101 talk will be given by Ohad Kammar (University of Edinburgh). See the details of the talk below. Best, Dilsat ********************************************************************** Date: Monday, 10 November at 13:00 Room: LT1414a, Livingstone Tower Zoom link: https://strath.zoom.us/j/82143788147?pwd=dMy8sftupiQ8eEiIqLzodkMra6RTfn.1 (Meeting ID 821 4378 8147, passcode whiteboard) Live stream on Youtube: https://www.youtube.com/@msp.strathclyde Speaker: Ohad Kammar (University of Edinburgh) Title: Modular abstract syntax trees (MAST) ? substitution tensors with second-class sorts Abstract: We adapt Fiore, Plotkin, and Turi's treatment of abstract syntax with binding, substitution, and holes to account for languages with second-class sorts. These situations include programming calculi such as the Call-by-Value ?-calculus (CBV) and Levy's Call-by-Push-Value (CBPV). Prohibiting second-class sorts from appearing in variable contexts means the presheaf of variables is no longer a left-unit for Fiore et al's substitution tensor product. We generalised their development to associative and right-unital skew monoidal categories. We reuse much of the development through skew bicategorical arguments. In ongoing work, we replace the skew monoidal structure with ordinary monoidal structure by recourse to substitution modules instead of substitution monoids. We apply the resulting theory in two scenarios. We employ the mathematical theory to circumvent the expression problem when proving substitution lemmata for varieties of CBV denotational semantics modularly. We employ a computational implementation of the theory to circumvent the expression problem when implementing intrinsically-typed foreign-function interfaces for the 29 theories of SMTLIB. Joint work with Marcelo Fiore, Kajetan Granops, Mihail-Codrin Iftode, Georg Moser, and Sam Staton. ********************************************************************** -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.strath.ac.uk/archives/msp-interest/attachments/20251107/978410f4/attachment.html From fredrik.nordvall-forsberg at strath.ac.uk Wed Nov 12 16:15:23 2025 From: fredrik.nordvall-forsberg at strath.ac.uk (Fredrik Nordvall Forsberg) Date: Wed, 12 Nov 2025 16:15:23 +0000 Subject: [msp-interest] Fwd: Fwd: Talk In-Reply-To: References: Message-ID: <8d5c535f-49bf-4b6a-a7d1-7edc8d490c2c@strath.ac.uk> Dear all, I have been asked to forward the below talk announcement by MSP alumnus Bruno. Personally I'm looking forward to it! Best wishes, Fred ---------- Forwarded message --------- From: *Neil Ghani* Date: Wed, Nov 12, 2025 at 2:06?PM Subject: Fwd: Talk To: Riu Sakamoto Dear All Kodamai is hosting the following talk this Friday 14 November at 4pm UK time in the general area of Category Theory and AI. If you are interested, please contact neil at kodamai.com for the online url *Speaker: Bruno Gavranovic* *TensorType: Implementing and extending Deep Learning with Types* Category theory has seen a rise in applications in deep learning, bringing with it ideas and tools from functional programming and dependent type theory. However, implementing these ideas in practice faces significant friction because successful neural network frameworks only exist in dynamically typed languages such as Python. Attempts to implement these ideas in statically-typed languages have struggled with expressiveness and ergonomics, typically only replicating what exists without imagining what can be. In this talk, I will introduce TensorType, a tensor processing framework implemented in Idris 2 aiming to demonstrate that ergonomics and rigor need not be at odds. TensorType provides tensor operations checked at compile-time while enabling fundamentally new capabilities: tensors that branch and recurse instead of being confined to rectangular shapes. I will walk through the design choices behind TensorType, showcase how containers power its core abstractions, and explore strange new worlds it enables. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.strath.ac.uk/archives/msp-interest/attachments/20251112/5d3f6bff/attachment.html From fiona.blackett at strath.ac.uk Thu Nov 13 15:03:56 2025 From: fiona.blackett at strath.ac.uk (Fiona Blackett) Date: Thu, 13 Nov 2025 15:03:56 +0000 Subject: [msp-interest] [MSP101] Clemens Kupke: Graph Games with Infinite Plays (1pm Mon 17/11, 1414a) Message-ID: Hello all, Next Monday Clemens will be giving an MSP101 talk, titled Graph Games with Infinite Plays Cheers, Fiona Blackett ---------------------------------------------------------------------------------------------- Date, time and place: Monday 17th November, 1:00 pm, Livingstone Tower room LT1414a Speaker: Clemens Kupke (MSP) Title: Graph Games with Infinite Plays Zoom Link: https://strath.zoom.us/j/82143788147?pwd=dMy8sftupiQ8eEiIqLzodkMra6RTfn.1 Meeting ID: 821 4378 8147 Password: whiteboard Abstract: In this 101 I am planning to discuss 2-player graph games with infinite plays. At first we will focus on games with "trivial" acceptance conditions where a player either loses or wins all infinite plays. As motivating example I will present the games that characterize least and greatest fixpoints of monotone operators. After that we will explore why those games are too simple for reasoning about alternating fixpoints and move to parity games, a type of graph game that captures the full expressive power of the modal mu calculus. Time permitting I will explain how to prove that parity games are (memoryless) determined and how one can compute winning regions of a given parity game. ---------------------------------------------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.strath.ac.uk/archives/msp-interest/attachments/20251113/09e3b461/attachment.html