JFP 2021
31 papers
- A greedy algorithm for dropping digits
- A trustful monad for axiomatic reasoning with probability and nondeterminism
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
- Blame and coercion: Together again for the first time
- Cogent: uniqueness types and certifying compilation
- Composable data visualizations
- Cubical Agda: A dependently typed programming language with univalence and higher inductive types
- Explainable dynamic programming
- Extensional equality preservation and verified generic programming
- Gradual type theory
- Higher order functions and Brouwer's thesis
- How to design co-programs
- Integrating region memory management and tag-free generational garbage collection
- Lambda calculus with algebraic simplification for reduction parallelisation: Extended study
- Linear capabilities for fully abstract compilation of separation-logic-verified code
- Longest segment of balanced parentheses: an exercise in program inversion in a segment problem
- Not by equations alone: Reasoning with extensible effects
- On the correctness of monadic backward induction
- Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
- PhD Abstracts
- PhD Abstracts
- Proof-directed program transformation: A functional account of efficient regular expression matching
- Protocol combinators for modeling, testing, and execution of distributed systems
- Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code
- Real-time MLton: A Standard ML runtime for real-time functional programs
- Relational cost analysis in a functional-imperative setting
- Segments: An alternative rainfall problem
- StkTokens: Enforcing well-bracketed control flow and stack encapsulation using linear capabilities
- Taming the Merge Operator
- Verified secure compilation for mixed-sensitivity concurrent programs
- What is an education paper?