- A Categorical Programming Language Tatsuya Hagino Sat 29 November 2025
- CoreDPPL: Towards a Sound Composition of Differentiation, ODE Solving, and Probabilistic Programming Oscar Eriksson Anders rAgren Thuné Johannes Borgstrøm David Broman Sat 05 April 2025
- Linearization via Rewriting (Long Version) Ugo Dal Lago Federico Olimpieri Sun 09 March 2025
- Substructural Parametricity C.~B. Aberlé Chris Martens Frank Pfenning Sun 09 March 2025
- Denotational Semantics for Probabilistic and Concurrent Programs Noam Zilberstein Daniele Gorla Alexandra Silva Sun 09 March 2025
- Bounded First-Class Universe Levels in Dependent Type Theory Jonathan Chan Stephanie Weirich Mon 03 March 2025
- Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back Kevin Batz Joost-Pieter Katoen Francesca Randone Tobias Winkler Mon 03 March 2025
- A Comprehensive Survey of the Lean 4 Theorem Prover: Architecture, Applications, and Advances Xichen Tang Tue 25 February 2025
- Corecursive Coding of High Computational Derivatives and Power Series Jerzy Karczmarczuk Wed 29 January 2025
- Quantifier Elimination and Craig Interpolation: The Quantitative Way (Technical Report) Kevin Batz Joost-Pieter Katoen Nora Orhan Wed 29 January 2025
- A Primal-Dual Perspective on Program Verification Algorithms (Extended Version) Takeshi Tsukada Hiroshi Unno Oded Padon Sharon Shoham Mon 06 January 2025
- Algebraic Tools for Computing Polynomial Loop Invariants (Extended Version) Erdenebayar Bayarmagnai Fatemeh Mohammadi Rémi Prébet Mon 06 January 2025
- On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus Naoki Kobayashi Mon 25 November 2024
- On Computational Indistinguishability and Logical Relations Ugo Dal Lago Zeinab Galal Giulia Giusti Sat 26 October 2024
- Catamorphic Abstractions for Constrained Horn Clause Satisfiability Emanuele De Angelis Fabio Fioravanti Alberto Pettorossi Maurizio Proietti Tue 24 September 2024
- PolyHorn: A Polynomial Horn Clause Solver Krishnendu Chatterjee Amir Kafshdar Goharshady Ehsan Kafshdar Goharshady Mehrdad Karrabi Milad Saadat Đorđe Žikelić Wed 14 August 2024
- Grokking the Sequent Calculus (Functional Pearl) David Binder Marco Tzschentke Marius Muller Klaus Ostermann Thu 27 June 2024
- The Relational Machine Calculus Chris Barrett Daniel Castle Willem Heijltjes Wed 22 May 2024
- Concurrent Games over Relational Structures: The Origin of Game Comonads Yoàv Montacute Glynn Winskel Wed 22 May 2024
- Stream Types Joseph W. Cutler Christopher Watson Emeka Nkurumeh Phillip Hilliard Harrison Goldstein Caleb Stanford Benjamin C. Pierce Fri 05 April 2024
- Equational Bit-Vector Solving via Strong Grøbner Bases Jiaxin Song Hongfei Fu Charles Zhang Sun 03 March 2024
- Theoretical foundations for programmatic reinforcement learning Guruprerana Shabadi Nathanael Fijalkow Théo Matricon Tue 20 February 2024
- A faster FPRAS for NFA Kuldeep S. Meel Sourav Chakraborty Umang Mathur Fri 22 December 2023
- WikiCoder: Learning to Write Knowledge-Powered Code Théo Matricon Nathanael Fijalkow Gaetan Margueritte Thu 23 November 2023
- Polynomial Time and Dependent Types Robert Atkey Thu 16 November 2023
- Syntactically and semantically regular languages of lambda-terms coincide through logical relations Vincent Moreau Lê Thành Dũng Nguyên Thu 16 November 2023
- Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence Vasileios Koutavas Yu-Yang Lin Nikos Tzevelekos Mon 06 November 2023
- Reflections on Termination of Linear Loops Shaowei Zhu Zachary Kincaid Sun 05 November 2023
- On Learning Polynomial Recursive Programs Alex Buna-Marginean Vincent Cheval Mahsa Shirmohammadi James Worrell Thu 26 October 2023
- Making Logical Relations More Relatable (Proof Pearl) Emmanuel Suárez Acevedo Stephanie Weirich Thu 28 September 2023
- A Deductive Verification Infrastructure for Probabilistic Programs Philipp Schrøer Kevin Batz Benjamin Lucien Kaminski Joost-Pieter Katoen Christoph Matheja Fri 15 September 2023
- Accelerating package expansion in Rust through development of a semantic versioning tool Tomasz Nowak Michał Staniewski Mieszko Grodzicki Bartosz Smolarczyk Wed 30 August 2023
- Automated Sensitivity Analysis for Probabilistic Loops Marcel Moosbrugger Julian Mullner Laura Kovács Mon 28 August 2023
- Saturating automata for game semantics Alex Dixon Andrzej S. Murawski Tue 25 July 2023
- Newtonian Program Analysis of Probabilistic Programs Di Wang Thomas Reps Sun 23 July 2023
- Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs Julian Mullner Marcel Moosbrugger Laura Kovács Fri 21 July 2023
- Exact Bayesian Inference for Loopy Probabilistic Programs Lutz Klinkenberg Christian Blumenthal Minghsuai Chen Joost-Pieter Katoen Wed 19 July 2023
- Exact Bayesian Inference on Discrete Models via Probability Generating Functions: A Probabilistic Programming Approach Fabian Zaiser Andrzej S. Murawski Luke Ong Mon 29 May 2023
- Simply typed convertibility is TOWER-complete even for safe lambda-terms Lê Thành Dũng Nguy~ên Wed 24 May 2023
- Central Submonads and Notions of Computation TItouan Carette Louis Lemonnier Vladimir Zamdzhiev Fri 28 April 2023
- Weak Similarity in Higher-Order Mathematical Operational Semantics Henning Urbat Stelios Tsampas Sergey Goncharov Stefan Milius Lutz Schrøder Fri 28 April 2023
- ømegaPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs Mathieu Huot Alexander K. Lew Vikash K. Mansinghka Sam Staton Fri 28 April 2023
- Automatic Amortized Resource Analysis with Regular Recursive Types Jessie Grosen David M. Kahn Jan Hoffmann Fri 28 April 2023
- Deterministic stream-sampling for probabilistic programming: semantics and verification Fredrik Dahlqvist Alexandra Silva William Smith Fri 28 April 2023
- Making Concurrency Functional Glynn Winskel Mon 17 April 2023
- Scaling Neural Program Synthesis with Distribution-based Search Nathanael Fijalkow Guillaume Lagarde Théo Matricon Kevin Ellis Pierre Ohlmann Akarsh Potta Thu 30 March 2023
- Asynchronous Multiparty Session Type Implementability is Decidable -- Lessons Learned from Message Sequence Charts Felix Stutz Mon 27 February 2023
- A compositional theory of digital circuits Dan R. Ghica George Kaye David Sprunger Mon 20 February 2023
- Languages With Decidable Learning: A Meta-Theorem Paul Krogmeier P. Madhusudan Mon 20 February 2023
- The Marriage of Effects and Rewrites Ezra e. k. Cooper Thu 09 February 2023
- Exact Probabilistic Inference Using Generating Functions Lutz Klinkenberg Mingshuai Chen Joost-Pieter Katoen Tobias Winkler Thu 09 February 2023
- The Functional Machine Calculus Willem Heijltjes Sat 24 December 2022
- The Functional Machine Calculus II: Semantics Chris Barrett Willem Heijltjes Guy McCusker Tue 29 November 2022
- Completeness in static analysis by abstract interpretation, a personal point of view David Monniaux Mon 28 November 2022
- A Simple, Yet Effective Approach to Finding Biases in Code Generation Spyridon Mouselinos Mateusz Malinowski Henryk Michalewski Fri 04 November 2022
- Higher-Order MSL Horn Constraints Jerome Jochems Eddie Jones Steven Ramsay Sat 29 October 2022
- Strong Normalization for the Calculus of Constructions Chris Casinghino Tue 25 October 2022
- Verifying Catamorphism-Based Contracts using Constrained Horn Clauses Emanuele De Angelis Fabio Fioravanti Alberto Pettorossi Maurizio Proietti Fri 16 September 2022
- Long-Term Mentoring for Computer Science Researchers Emily Ruppel Sihang Liu Elba Garza Sukyoung Ryu Alexandra Silva Talia Ringer Mon 29 August 2022
- Neural Networks in Imandra: Matrix Representation as a Verification Choice Remi Desmartin Grant Passmore Ekaterina Komendantskaya Thu 21 July 2022
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic Beniamino Accattoli Thu 02 June 2022
- This is the Moment for Probabilistic Loops Marcel Moosbrugger Miroslav Stankovič Ezio Bartocci Laura Kovács Fri 22 April 2022
- The Safe Lambda Calculus William Blum C. -H. Luke Ong Thu 31 March 2022
- An Overview of the HFL Model Checking Project Naoki Kobayashi Tue 14 September 2021
- Reducing Higher-order Recursion Scheme Equivalence to Coinductive Higher-order Constrained Horn Clauses Jerome Jochems Mon 13 September 2021
- On non-structural subtype entailment Aleksy Schubert Tue 07 September 2021
- A Survey of the Proof-Theoretic Foundations of Logic Programming Dale Miller Tue 07 September 2021
- Decidable Verification of Uninterpreted Programs Umang Mathur P. Madhusudan Mahesh Viswanathan Mon 02 August 2021
- Idris 2: Quantitative Type Theory in Practice Edwin Brady Tue 11 May 2021
- A Review of Formal Methods applied to Machine Learning Caterina Urban Antoine Miné Thu 08 April 2021
- Complete trace models of state and control Guilhem Jaber Andrzej S. Murawski Fri 22 January 2021
- Leafy Automata for Higher-Order Concurrency Alex Dixon Ranko Lazić Andrzej S. Murawski Igor Walukiewicz Fri 22 January 2021
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond Rupak Majumdar Ramanathan S. Thinniyam Georg Zetzsche Fri 22 January 2021
- Verifying Liveness Properties of ML Programs M. M. Lester R. P. Neatherway C. -H. L. Ong S. J. Ramsay Sun 27 December 2020
- Strongly-Normalizing Higher-Order Relational Queries Wilmer Ricciotti James Cheney Sun 13 December 2020
- Describing the syntax of programming languages using conjunctive and Boolean grammars Alexander Okhotin Sun 13 December 2020
- A Modern Compiler for the French Tax Code Denis Merigoux Raphael Monat Jonathan Protzenko Mon 23 November 2020
- Context-Bounded Verification of Liveness Properties for Multithreaded Shared-Memory Programs Pascal Baumann Rupak Majumdar Ramanathan S. Thinniyam Georg Zetzsche Thu 12 November 2020
- Type safety of rewrite rules in dependent types Frédéric Blanqui Wed 04 November 2020
- Relatively Complete Verification of Probabilistic Programs Kevin Batz Benjamin Lucien Kaminski Joost-Pieter Katoen Christoph Matheja Fri 30 October 2020
- Syntax and Semantics of Cedille Aaron Stump Chris Jenkins Sun 25 October 2020
- On the Termination Problem for Probabilistic Higher-Order Recursive Programs Naoki Kobayashi Ugo Dal Lago Charles Grellois Wed 07 October 2020
- Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates Emanuele De Angelis Fabio Fioravanti Alberto Pettorossi Maurizio Proietti Tue 06 October 2020
- Normalization by Evaluation for Call-by-Push-Value and Polarized Lambda-Calculus Andreas Abel Christian Sattler Mon 14 September 2020
- Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations Jingyi Wang Yican Sun Hongfei Fu Amir Kafshdar Goharshady Krishnendu Chatterjee Mon 10 August 2020
- Inductive Reachability Witnesses Ali Asadi Krishnendu Chatterjee Hongfei Fu Amir Kafshdar Goharshady Mohammad Mahdavi Sat 01 August 2020
- Dependent Pearl: Normalization by realizability Pierre-Évariste Dagand Lionel Rieg Gabriel Scherer Tue 28 July 2020
- A report on the first virtual PLDI conference Alastair F. Donaldson Sat 25 July 2020
- Smart Choices and the Selection Monad Martin Abadi Gordon Plotkin Tue 21 July 2020
- Generating Functions for Probabilistic Programs Lutz Klinkenberg Kevin Batz Benjamin Lucien Kaminski Joost-Pieter Katoen Joshua Moerman Tobias Winkler Tue 14 July 2020
- Monads and ``do'' notation in the Wolfram Language Kacper Topolnicki Wed 20 May 2020
- Gems of Corrado Böhm Henk P. Barendregt Wed 20 May 2020
- A Domain Semantics for Higher-Order Recursive Processes Ryan Kavanagh Wed 13 May 2020
- Dynamic IFC Theorems for Free Maximilian Algehed Jean-Philippe Bernardy Catalin Hritcu Wed 13 May 2020
- The Imandra Automated Reasoning System (system description) Grant Olney Passmore Simon Cruanes Denis Ignatovich Dave Aitken Matt Bray Elijah Kagan Kostya Kanishev Ewen Maclean Nicola Mometto Sat 25 April 2020
- Decidability and Synthesis of Abstract Inductive Invariants Francesco Ranzato Wed 08 April 2020
- Polynomial Invariant Generation for Non-deterministic Recursive Programs Krishnendu Chatterjee Hongfei Fu Amir Kafshdar Goharshady Ehsan Kafshdar Goharshady Tue 07 April 2020
- QED at Large: A Survey of Engineering of Formally Verified Software Talia Ringer Karl Palmskog Ilya Sergey Milos Gligoric Zachary Tatlock Sat 21 March 2020
- Decomposing Probabilistic Lambda-calculi Ugo Dal Lago Giulio Guerrieri Willem Heijltjes Tue 03 March 2020
- A proof of strong normalisation using domain theory Thierry Coquand Arnaud Spiwack Sat 08 February 2020
- Modular coinduction up-to for higher-order languages via first-order transition systems Jean-Marie Madiot Damien Pous Davide Sangiorgi Thu 30 January 2020
- Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages Sebastian Ullrich Leonardo de Moura Thu 30 January 2020
- Tabled Typeclass Resolution Daniel Selsam Sebastian Ullrich Leonardo de Moura Tue 14 January 2020
- Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming Sebastian Ullrich Leonardo de Moura Wed 01 January 2020
- A Simple Differentiable Programming Language Martin Abadi Gordon Plotkin Wed 13 November 2019
- A Type-Based HFL Model Checking Algorithm Youkichi Hosoi Naoki Kobayashi Takeshi Tsukada Thu 29 August 2019
- Lemma Generation for Horn Clause Satisfiability: A Preliminary Study Emanuele De Angelis Fabio Fioravanti Alberto Pettorossi Maurizio Proietti Wed 21 August 2019
- Bidirectional Typing Joshua Dunfield Neel Krishnaswami Mon 19 August 2019
- The far side of the cube Dan R. Ghica Wed 14 August 2019
- An Introduction to Logical Relations Lau Skorstengaard Mon 29 July 2019
- Loop Summarization with Rational Vector Addition Systems (extended version) Jake Silverman Zachary Kincaid Sat 20 July 2019
- Generating Correctness Proofs with Neural Networks Alex Sanchez-Stern Yousef Alhessi Lawrence Saul Sorin Lerner Sat 20 July 2019
- The Mathematical Specification of the Statebox Language Statebox Team Fabrizio Genovese Wed 19 June 2019
- Dijkstra Monads for All Kenji Maillard Danel Ahman Robert Atkey Guido Martinez Catalin Hritcu Exequiel Rivas Éric Tanter Fri 07 June 2019
- Verifying Asynchronous Interactions via Communicating Session Automata Julien Lange Nobuko Yoshida Tue 28 May 2019
- An experiment with denotational semantics Blikle Andrzej Fri 10 May 2019
- Linear Haskell: practical linearity in a higher-order polymorphic language Jean-Philippe Bernardy Mathieu Boespflug Ryan R. Newton Simon Peyton Jones Arnaud Spiwack Tue 30 April 2019
- On the Termination Problem for Probabilistic Higher-Order Recursive Programs Naoki Kobayashi Ugo Dal Lago Charles Grellois Fri 15 March 2019
- Normalisation by Traversals C. -H. Luke Ong Fri 21 December 2018
- DroidStar: Callback Typestates for Android Classes A. Radhakrishna N. V. Lewchenko S. Meier S. Mover K. Chaitanya Sripada D. Zufferey B.-Y. E. Chang P. Černý Sat 31 March 2018
Library Size: 13G (120 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
