output
20002026
most citedQuantum attacks on Bitcoin, and how to protect against them

225 citations

researchers with a paper here
collaborating institutions
Showing cs.PLShow all

19 papers · 1 filter

cs.PL2026

Proving and Computing: The Infinite Pigeonhole Principle and Countable Choice

Zena M. Ariola, Paul Downen, Hugo Herbelin

Structural recursion is a common technique used by programmers in modern languages and is taught to introductory computer science students. But what about its dual, structural core…

cs.PL2025★ 5 cited

Operational methods in semantics

Roberto M. Amadio

The focus of these lecture notes is on abstract models and basic ideas and results that relate to the operational semantics of programming languages largely conceived. The approach…

cs.PL2025★ 1 cited

AdapTT: Functoriality for Dependent Type Casts

Arthur Adjedj, Meven Lennon-Bertrand, Thibaut Benjamin +1

The ability to cast values between related types is a leitmotiv of many flavors of dependent type theory, such as observational type theories, subtyping, or cast calculi for gradua…

cs.PL2024

PoTo: A Hybrid Andersen's Points-to Analysis for Python

Ingkarat Rak-amnouykit, Ana Milanova, Guillaume Baudart +2

As Python is increasingly being adopted for large and complex programs, the importance of static analysis for Python (such as type inference) grows. Unfortunately, static analysis…

cs.PL2024★ 3 cited

Guard Analysis and Safe Erasure Gradual Typing: a Type System for Elixir

Giuseppe Castagna, Guillaume Duboc

We formalize a new type system for Elixir, a dynamically typed functional programming language of growing popularity that runs on the Erlang virtual machine. Our system combines gr…

cs.PL2024★ 2 cited

Inference Plans for Hybrid Particle Filtering

Ellie Y. Cheng, Eric Atkinson, Guillaume Baudart +2

Advanced probabilistic programming languages (PPLs) using hybrid particle filtering combine symbolic exact inference and Monte Carlo methods to improve inference performance. These…