Media Summary: Coalgebra is a young research field that grew out of the Theory B community in the late 90's. It started out as a mathematical ... Staging with Class: A Specification for Typed Template Haskell Ningning Xie, Matthew Pickering, Andres Loh, Nicolas Wu, Jeremy ... Certifying Derivation of State Machines from Coroutines Mirai Ikebuchi, Andres Erbsen, and Adam Chlipala (National Institute of ...

Popl 22 Tutorial Data Driven - Detailed Analysis & Overview

Coalgebra is a young research field that grew out of the Theory B community in the late 90's. It started out as a mathematical ... Staging with Class: A Specification for Typed Template Haskell Ningning Xie, Matthew Pickering, Andres Loh, Nicolas Wu, Jeremy ... Certifying Derivation of State Machines from Coroutines Mirai Ikebuchi, Andres Erbsen, and Adam Chlipala (National Institute of ... Provably Correct, Asymptotically Efficient, Higher-Order Reverse-Mode Automatic Differentiation Faustyna Krawiec, Simon Peyton ... Subcubic Certificates for CFL Reachability Dmitry Chistikov, Rupak Majumdar, and Philipp Schepper (University of Warwick, UK; ... Extending Intel-x86 Consistency and Persistency: Formalising the Semantics of Intel-x86 Memory Types and Non-temporal Stores ...

Connectivity Graphs: A Method for Proving Deadlock Freedom Based on Separation Logic Jules Jacobs, Stephanie Balzer, and ... Truly Stateless, Optimal Dynamic Partial Order Reduction Michalis Kokologiannakis, Iason Marmanis, Vladimir Gladstein, and ... Bottom-Up Synthesis of Recursive Functional Programs using Angelic Execution Anders Miltner, Adrian Trejo Nuñez, Ana Brendel ... Safe, Modular Packet Pipeline Programming Devon Loehr and David Walker (Princeton University, USA; Princeton University, ...

Photo Gallery

[POPL'22] Tutorial: Data-driven program analysis
[POPL'22] Dependently-Typed Data Plane Programming
[POPL'22] Coalgebra for the working programming languages researcher
[POPL'22] Staging with Class: A Specification for Typed Template Haskell
[POPL'22] Certifying Derivation of State Machines from Coroutines
[POPL'22] Provably Correct, Asymptotically Efficient, Higher-Order Reverse-Mode Automatic
[POPL'22] Subcubic Certificates for CFL Reachability
[POPL'22] Extending Intel-x86 Consistency and Persistency: Formalising the Semantics of In
[POPL'22] Connectivity Graphs: A Method for Proving Deadlock Freedom Based on Separation L
[POPL'22] Truly Stateless, Optimal Dynamic Partial Order Reduction
[POPL'22] Bottom-Up Synthesis of Recursive Functional Programs using Angelic Execution
[POPL'22] Oblivious Algebraic Data Types
View Detailed Profile
[POPL'22] Tutorial: Data-driven program analysis

[POPL'22] Tutorial: Data-driven program analysis

POPL

[POPL'22] Dependently-Typed Data Plane Programming

[POPL'22] Dependently-Typed Data Plane Programming

Dependently-Typed

[POPL'22] Coalgebra for the working programming languages researcher

[POPL'22] Coalgebra for the working programming languages researcher

Coalgebra is a young research field that grew out of the Theory B community in the late 90's. It started out as a mathematical ...

[POPL'22] Staging with Class: A Specification for Typed Template Haskell

[POPL'22] Staging with Class: A Specification for Typed Template Haskell

Staging with Class: A Specification for Typed Template Haskell Ningning Xie, Matthew Pickering, Andres Loh, Nicolas Wu, Jeremy ...

[POPL'22] Certifying Derivation of State Machines from Coroutines

[POPL'22] Certifying Derivation of State Machines from Coroutines

Certifying Derivation of State Machines from Coroutines Mirai Ikebuchi, Andres Erbsen, and Adam Chlipala (National Institute of ...

[POPL'22] Provably Correct, Asymptotically Efficient, Higher-Order Reverse-Mode Automatic

[POPL'22] Provably Correct, Asymptotically Efficient, Higher-Order Reverse-Mode Automatic

Provably Correct, Asymptotically Efficient, Higher-Order Reverse-Mode Automatic Differentiation Faustyna Krawiec, Simon Peyton ...

[POPL'22] Subcubic Certificates for CFL Reachability

[POPL'22] Subcubic Certificates for CFL Reachability

Subcubic Certificates for CFL Reachability Dmitry Chistikov, Rupak Majumdar, and Philipp Schepper (University of Warwick, UK; ...

[POPL'22] Extending Intel-x86 Consistency and Persistency: Formalising the Semantics of In

[POPL'22] Extending Intel-x86 Consistency and Persistency: Formalising the Semantics of In

Extending Intel-x86 Consistency and Persistency: Formalising the Semantics of Intel-x86 Memory Types and Non-temporal Stores ...

[POPL'22] Connectivity Graphs: A Method for Proving Deadlock Freedom Based on Separation L

[POPL'22] Connectivity Graphs: A Method for Proving Deadlock Freedom Based on Separation L

Connectivity Graphs: A Method for Proving Deadlock Freedom Based on Separation Logic Jules Jacobs, Stephanie Balzer, and ...

[POPL'22] Truly Stateless, Optimal Dynamic Partial Order Reduction

[POPL'22] Truly Stateless, Optimal Dynamic Partial Order Reduction

Truly Stateless, Optimal Dynamic Partial Order Reduction Michalis Kokologiannakis, Iason Marmanis, Vladimir Gladstein, and ...

[POPL'22] Bottom-Up Synthesis of Recursive Functional Programs using Angelic Execution

[POPL'22] Bottom-Up Synthesis of Recursive Functional Programs using Angelic Execution

Bottom-Up Synthesis of Recursive Functional Programs using Angelic Execution Anders Miltner, Adrian Trejo Nuñez, Ana Brendel ...

[POPL'22] Oblivious Algebraic Data Types

[POPL'22] Oblivious Algebraic Data Types

Oblivious Algebraic

[POPL'22] Safe, Modular Packet Pipeline Programming

[POPL'22] Safe, Modular Packet Pipeline Programming

Safe, Modular Packet Pipeline Programming Devon Loehr and David Walker (Princeton University, USA; Princeton University, ...