[Scheme24] Challenges in the Design and Implementation of Teaching Languages for EDSLs
ACM SIGPLAN
[Scheme24] Challenges in the Design and Implementation of Teaching Languages for EDSLs
1:00:55
[Scheme24] Tutorial on Program Transformations
ACM SIGPLAN
[Scheme24] Tutorial on Program Transformations
1:28:19
[Scheme24] Nocksche and Nocko
ACM SIGPLAN
[Scheme24] Nocksche and Nocko
27:27
[Scheme24] Beyond SICP - Design and Implementation of a Notional Machine for Scheme
ACM SIGPLAN
[Scheme24] Beyond SICP - Design and Implementation of a Notional Machine for Scheme
31:44
[Scheme24] A Teaching Language for Specification
ACM SIGPLAN
[Scheme24] A Teaching Language for Specification
30:01
[Scheme24] An Implementation of a Visual Stepper in the GRASP Programming System
ACM SIGPLAN
[Scheme24] An Implementation of a Visual Stepper in the GRASP Programming System
23:06
[Scheme24] Scheme on WebAssembly: It is happening!
ACM SIGPLAN
[Scheme24] Scheme on WebAssembly: It is happening!
57:12
[FProPer24] HVM2: Iteraction Combinator Evaluator
ACM SIGPLAN
[FProPer24] HVM2: Iteraction Combinator Evaluator
1:01:23
[FProPer24] Functional Sparse Tensor Compilation
ACM SIGPLAN
[FProPer24] Functional Sparse Tensor Compilation
27:39
[FProPer24] Fusing Gathers with Integer Linear Programming
ACM SIGPLAN
[FProPer24] Fusing Gathers with Integer Linear Programming
41:05
[FProPer24] A comparison of OpenCL, CUDA, and HIP as compilation targets for a functional array(…)
ACM SIGPLAN
[FProPer24] A comparison of OpenCL, CUDA, and HIP as compilation targets for a functional array(…)
43:28
[FProPer24] Ribbit with Memory Morphisms
ACM SIGPLAN
[FProPer24] Ribbit with Memory Morphisms
50:37
[FProPer24] Tail Modulo Async/Await
ACM SIGPLAN
[FProPer24] Tail Modulo Async/Await
29:36
[FProPer24] From C to Comonads to Climate: A Functional Programmer's Journey in Array Programming(…)
ACM SIGPLAN
[FProPer24] From C to Comonads to Climate: A Functional Programmer's Journey in Array Programming(…)
1:30:57
[Erlang24] Controlled Scheduling of Concurrent Elixir Programs
ACM SIGPLAN
[Erlang24] Controlled Scheduling of Concurrent Elixir Programs
30:09
[Erlang24] The Benefits of Tierless Elixir/Potato for Engineering IoT Systems
ACM SIGPLAN
[Erlang24] The Benefits of Tierless Elixir/Potato for Engineering IoT Systems
40:27
[Erlang24] Elixir-powered Low-income Animal Shelter Support: an Experience Report from Conception(…)
ACM SIGPLAN
[Erlang24] Elixir-powered Low-income Animal Shelter Support: an Experience Report from Conception(…)
24:01
[Erlang24] Is this really a refactoring? Automated equivalence checking for Erlang projects
ACM SIGPLAN
[Erlang24] Is this really a refactoring? Automated equivalence checking for Erlang projects
25:42
[Erlang24] Erlang on TOAST: Generating Erlang Stubs with Inline TOAST Monitors
ACM SIGPLAN
[Erlang24] Erlang on TOAST: Generating Erlang Stubs with Inline TOAST Monitors
30:41
[Erlang24] Erla+: Translating TLA+ Models into Executable Actor-Based Implementations
ACM SIGPLAN
[Erlang24] Erla+: Translating TLA+ Models into Executable Actor-Based Implementations
23:35
[Erlang24] Same same but different: A Comparative Analysis of Static Type Checkers in Erlang
ACM SIGPLAN
[Erlang24] Same same but different: A Comparative Analysis of Static Type Checkers in Erlang
29:14
[Erlang24] Unsafe Impedance: safe languages and safe by design software
ACM SIGPLAN
[Erlang24] Unsafe Impedance: safe languages and safe by design software
32:41
[miniKanren24] To Be or Not To Be: Adding Integrity Constraints to stableKanren to Make a Decision
ACM SIGPLAN
[miniKanren24] To Be or Not To Be: Adding Integrity Constraints to stableKanren to Make a Decision
28:45
[miniKanren24] Six Ways to Implement Divisibility by Three in miniKanren
ACM SIGPLAN
[miniKanren24] Six Ways to Implement Divisibility by Three in miniKanren
15:34
[miniKanren24] Improving stableKanren’s Backward Compatibility
ACM SIGPLAN
[miniKanren24] Improving stableKanren’s Backward Compatibility
22:38
[miniKanren24] typedKanren: Statically Typed Relational Programming with Exhaustive Matching in(…)
ACM SIGPLAN
[miniKanren24] typedKanren: Statically Typed Relational Programming with Exhaustive Matching in(…)
30:05
[miniKanren24] Hosted miniKanren: Reconciling Optimizing Compilation and Extensibility
ACM SIGPLAN
[miniKanren24] Hosted miniKanren: Reconciling Optimizing Compilation and Extensibility
55:48
[miniKanren24] A Relational Solver for Constraint-based Type Inference
ACM SIGPLAN
[miniKanren24] A Relational Solver for Constraint-based Type Inference
16:40
[miniKanren24] Between Functional and Relational
ACM SIGPLAN
[miniKanren24] Between Functional and Relational
28:40
[miniKanren24] Relational Reactive Programming: miniKanren for the Web
ACM SIGPLAN
[miniKanren24] Relational Reactive Programming: miniKanren for the Web
29:37
[miniKanren24] High-Performance Logic Programming on Servers, Clusters, and GPUs
ACM SIGPLAN
[miniKanren24] High-Performance Logic Programming on Servers, Clusters, and GPUs
57:10
[FARM24] A Progressive-Adaptive Music Generator (PAMG): An Approach to Interactive Procedural(…)
ACM SIGPLAN
[FARM24] A Progressive-Adaptive Music Generator (PAMG): An Approach to Interactive Procedural(…)
43:18
[FARM24] Demo: Functional Sound Design
ACM SIGPLAN
[FARM24] Demo: Functional Sound Design
16:18
[FARM24] Diffusion-Based Sound Synthesis in Music Production
ACM SIGPLAN
[FARM24] Diffusion-Based Sound Synthesis in Music Production
22:37
[FARM24] Demo: A Geometric Approach to Generate Musical Rhythmic Patterns in Haskell
ACM SIGPLAN
[FARM24] Demo: A Geometric Approach to Generate Musical Rhythmic Patterns in Haskell
24:56
[FARM24] The Maquette Monad
ACM SIGPLAN
[FARM24] The Maquette Monad
29:31
[FARM24] Demo: Composable Compositions in Tonart
ACM SIGPLAN
[FARM24] Demo: Composable Compositions in Tonart
24:37
[FARM24] From Konnakol to Live Coding
ACM SIGPLAN
[FARM24] From Konnakol to Live Coding
21:11
[FARM24] Trane: Musical Janet on the Web
ACM SIGPLAN
[FARM24] Trane: Musical Janet on the Web
21:09
[FARM24] Functional Curves and Surfaces: Algebraic Geometry Inspired Visuals in Hydra
ACM SIGPLAN
[FARM24] Functional Curves and Surfaces: Algebraic Geometry Inspired Visuals in Hydra
22:33
[FARM24] Bridging art and mathematics with Tessella: a Scala functional library for regular(…)
ACM SIGPLAN
[FARM24] Bridging art and mathematics with Tessella: a Scala functional library for regular(…)
22:20
[FARM24] Using Functional Reactive Programming for Robotic Art
ACM SIGPLAN
[FARM24] Using Functional Reactive Programming for Robotic Art
25:56
[ICFP24] ICFP Contest Results
ACM SIGPLAN
[ICFP24] ICFP Contest Results
25:37
[ICFP24] Functional Programming in Financial Markets (Experience Report)
ACM SIGPLAN
[ICFP24] Functional Programming in Financial Markets (Experience Report)
18:38
[ICFP24] Alice or Bob?: Process polymorphism in choreographies
ACM SIGPLAN
[ICFP24] Alice or Bob?: Process polymorphism in choreographies
16:20
[ICFP24] A Coq Mechanization of JavaScript Regular Expression Semantics
ACM SIGPLAN
[ICFP24] A Coq Mechanization of JavaScript Regular Expression Semantics
16:48
[ICFP24] Blame-correct Support for Receiver Properties in Recursively-Structured Actor Contracts
ACM SIGPLAN
[ICFP24] Blame-correct Support for Receiver Properties in Recursively-Structured Actor Contracts
16:41
[ICFP24] The Functional, the Imperative, and the Sudoku: Getting Good, Bad, and Ugly to Get Along(…)
ACM SIGPLAN
[ICFP24] The Functional, the Imperative, and the Sudoku: Getting Good, Bad, and Ugly to Get Along(…)
17:49
[ICFP24] Sound Borrow-Checking for Rust via Symbolic Semantics
ACM SIGPLAN
[ICFP24] Sound Borrow-Checking for Rust via Symbolic Semantics
15:40
[ICFP24] Beyond Trees: Calculating Graph-Based Compilers (Functional Pearl)
ACM SIGPLAN
[ICFP24] Beyond Trees: Calculating Graph-Based Compilers (Functional Pearl)
20:06
[ICFP24] Double-Ended Bit-Stealing for Algebraic Data Types
ACM SIGPLAN
[ICFP24] Double-Ended Bit-Stealing for Algebraic Data Types
19:11
[ICFP24] A Two-Phase Infinite/Finite Low-Level Memory Model: Reconciling Integer–Pointer Casts,(…)
ACM SIGPLAN
[ICFP24] A Two-Phase Infinite/Finite Low-Level Memory Model: Reconciling Integer–Pointer Casts,(…)
16:21
[ICFP24] Oxidizing OCaml with Modal Memory Management
ACM SIGPLAN
[ICFP24] Oxidizing OCaml with Modal Memory Management
17:11
[ICFP24] Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement(…)
ACM SIGPLAN
[ICFP24] Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement(…)
17:40
[ICFP24] Synchronous Programming with Refinement Types
ACM SIGPLAN
[ICFP24] Synchronous Programming with Refinement Types
17:56
[ICFP24] Contextual Typing
ACM SIGPLAN
[ICFP24] Contextual Typing
18:32
[ICFP24] The Long Way to Deforestation: A Type Inference and Elaboration Technique for Removing(…)
ACM SIGPLAN
[ICFP24] The Long Way to Deforestation: A Type Inference and Elaboration Technique for Removing(…)
18:22
[ICFP24] Refinement Types from Light to Deep Verification
ACM SIGPLAN
[ICFP24] Refinement Types from Light to Deep Verification
1:00:26
[ICFP24] Remembering Alan Jeffrey
ACM SIGPLAN
[ICFP24] Remembering Alan Jeffrey
26:07
[ICFP24] Contract Lenses: Reasoning about Bidirectional Programs via Calculation
ACM SIGPLAN
[ICFP24] Contract Lenses: Reasoning about Bidirectional Programs via Calculation
15:46
[ICFP24] CCLemma: E-Graph Guided Lemma Discovery for Inductive Equational Proofs
ACM SIGPLAN
[ICFP24] CCLemma: E-Graph Guided Lemma Discovery for Inductive Equational Proofs
19:43
[ICFP24] Level-p-complexity of Boolean functions using thinning, memoization, and polynomials
ACM SIGPLAN
[ICFP24] Level-p-complexity of Boolean functions using thinning, memoization, and polynomials
17:04
[ICFP24] Story of Your Lazy Function’s Life: A Bidirectional Demand Semantics for Mechanized Cost(…)
ACM SIGPLAN
[ICFP24] Story of Your Lazy Function’s Life: A Bidirectional Demand Semantics for Mechanized Cost(…)
19:49
[ICFP24] Specification and Verification for Unrestricted Algebraic Effects and Handling
ACM SIGPLAN
[ICFP24] Specification and Verification for Unrestricted Algebraic Effects and Handling
19:32
[ICFP24] Refinement Composition Logic
ACM SIGPLAN
[ICFP24] Refinement Composition Logic
16:55
[ICFP24] Almost-Sure Termination by Guarded Refinement
ACM SIGPLAN
[ICFP24] Almost-Sure Termination by Guarded Refinement
13:53
[ICFP24] Snapshottable stores
ACM SIGPLAN
[ICFP24] Snapshottable stores
19:00
[ICFP24] Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic(…)
ACM SIGPLAN
[ICFP24] Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic(…)
20:04
[ICFP24] Student Research Competition
ACM SIGPLAN
[ICFP24] Student Research Competition
28:23
[ICFP24] Knuth–Morris–Pratt illustrated (JFP Functional Pearls)
ACM SIGPLAN
[ICFP24] Knuth–Morris–Pratt illustrated (JFP Functional Pearls)
18:28
[ICFP24] Compiled, Extensible, Multi-language DSLs (Functional Pearl)
ACM SIGPLAN
[ICFP24] Compiled, Extensible, Multi-language DSLs (Functional Pearl)
18:51
[ICFP24] Deriving with Derivatives: Optimizing Incremental Fixpoints for Higher-Order Flow Analysis
ACM SIGPLAN
[ICFP24] Deriving with Derivatives: Optimizing Incremental Fixpoints for Higher-Order Flow Analysis
17:07
[ICFP24] A Safe Low-level Language for Computer Algebra and its Formally Verified Compiler
ACM SIGPLAN
[ICFP24] A Safe Low-level Language for Computer Algebra and its Formally Verified Compiler
18:50
[ICFP24] Capabilities for Control
ACM SIGPLAN
[ICFP24] Capabilities for Control
1:04:20
[ICFP24] Memorial for D. Turner & Arvind
ACM SIGPLAN
[ICFP24] Memorial for D. Turner & Arvind
50:11
[ICFP24] Example-Based Reasoning About the Realizability Of Polymorphic Programs
ACM SIGPLAN
[ICFP24] Example-Based Reasoning About the Realizability Of Polymorphic Programs
15:28
[ICFP24] On the Operational Theory of the CPS-calculus: Towards a Theoretical Foundation for IRs
ACM SIGPLAN
[ICFP24] On the Operational Theory of the CPS-calculus: Towards a Theoretical Foundation for IRs
15:45
[ICFP24] A correct-by-construction conversion from lambda calculus to combinatory logic (JFP(…)
ACM SIGPLAN
[ICFP24] A correct-by-construction conversion from lambda calculus to combinatory logic (JFP(…)
18:36
[ICFP24] Call-By-Unboxed-Value
ACM SIGPLAN
[ICFP24] Call-By-Unboxed-Value
16:23
[ICFP24] Functional Pearl: Grokking the Sequent Calculus
ACM SIGPLAN
[ICFP24] Functional Pearl: Grokking the Sequent Calculus
17:39
[ICFP24] Static Blame for gradual typing
ACM SIGPLAN
[ICFP24] Static Blame for gradual typing
18:30
[ICFP24] Dependent Ghosts Have a Reflection for Free
ACM SIGPLAN
[ICFP24] Dependent Ghosts Have a Reflection for Free
16:51
[ICFP24] Gradual Indexed Inductive Types
ACM SIGPLAN
[ICFP24] Gradual Indexed Inductive Types
17:03
[ICFP24] Closure-Free Functional Programming in a Two-Level Type Theory
ACM SIGPLAN
[ICFP24] Closure-Free Functional Programming in a Two-Level Type Theory
16:37
[ICFP24] Normalization by evaluation for modal dependent type theory
ACM SIGPLAN
[ICFP24] Normalization by evaluation for modal dependent type theory
18:43
[ICFP24] How to Bake a Quantum Π
ACM SIGPLAN
[ICFP24] How to Bake a Quantum Π
16:52
[ICFP24] Algebraic effects and handlers for arrows
ACM SIGPLAN
[ICFP24] Algebraic effects and handlers for arrows
15:30
[ICFP24] Abstract Interpreters: a Monadic Approach to Modular Verification
ACM SIGPLAN
[ICFP24] Abstract Interpreters: a Monadic Approach to Modular Verification
18:44
[ICFP24] Parallel Algebraic Effect Handlers
ACM SIGPLAN
[ICFP24] Parallel Algebraic Effect Handlers
18:33
[ICFP24] Abstracting Effect Systems for Algebraic Effect Handlers
ACM SIGPLAN
[ICFP24] Abstracting Effect Systems for Algebraic Effect Handlers
19:21
[ICFP24] Requirements are All You Need
ACM SIGPLAN
[ICFP24] Requirements are All You Need
1:02:19
[TyDe24] Towards Type-Directed API Search for Mainstream Languages
ACM SIGPLAN
[TyDe24] Towards Type-Directed API Search for Mainstream Languages
27:23
[TyDe24] Term Search in Rust
ACM SIGPLAN
[TyDe24] Term Search in Rust
20:19
[TyDe24] Typed, Concise, Nanopass (pick 3) (Extended Abstract)
ACM SIGPLAN
[TyDe24] Typed, Concise, Nanopass (pick 3) (Extended Abstract)
22:45
[TyDe24] Normalizable types
ACM SIGPLAN
[TyDe24] Normalizable types
23:16
[TyDe24] First-class Algebraic Presentations with Elaborator Reflection (Extended Abstract)
ACM SIGPLAN
[TyDe24] First-class Algebraic Presentations with Elaborator Reflection (Extended Abstract)
20:01
[TyDe24] Modal Mu-Calculus for Free in Agda
ACM SIGPLAN
[TyDe24] Modal Mu-Calculus for Free in Agda
19:31
[TyDe24] Type-level Property Based Testing
ACM SIGPLAN
[TyDe24] Type-level Property Based Testing
20:02
[TyDe24] How Novices Perceive Interactive Theorem Provers (Extended Abstract)
ACM SIGPLAN
[TyDe24] How Novices Perceive Interactive Theorem Provers (Extended Abstract)
22:55
[TyDe24] Dependent Types to Push Corners of the Property-based Testing (Extended Abstract)
ACM SIGPLAN
[TyDe24] Dependent Types to Push Corners of the Property-based Testing (Extended Abstract)
20:36