![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Functional Programming, Volume 31
Volume 31, 2021
- Graham Hutton:
PhD Abstracts. e1 - Oleg Kiselyov
, Shin-Cheng Mu
, Amr Sabry
:
Not by equations alone: Reasoning with extensible effects. e2 - Kristoffer Just Arndal Andersen
, Ilya Sergey:
Protocol combinators for modeling, testing, and execution of distributed systems. e3 - Martin Elsman
, Niels Hallenberg:
Integrating region memory management and tag-free generational garbage collection. e4 - Joachim Breitner, Antal Spector-Zabusky
, Yao Li
, Christine Rizkallah, John Wiegley, Joshua M. Cohen
, Stephanie Weirich:
Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code. e5 - Thomas Van Strydonck
, Frank Piessens, Dominique Devriese
:
Linear capabilities for fully abstract compilation of separation-logic-verified code. e6 - Akimasa Morihata
:
Lambda calculus with algebraic simplification for reduction parallelisation: Extended study. e7 - Andrea Vezzosi
, Anders Mörtberg, Andreas Abel:
Cubical Agda: A dependently typed programming language with univalence and higher inductive types. e8 - Lau Skorstengaard, Dominique Devriese
, Lars Birkedal:
StkTokens: Enforcing well-bracketed control flow and stack encapsulation using linear capabilities. e9 - Martin Erwig
, Prashant Kumar:
Explainable dynamic programming. e10 - Jonathan Sterling
:
Higher order functions and Brouwer's thesis. e11 - Andrzej Filinski
:
Proof-directed program transformation: A functional account of efficient regular expression matching. e12
- Tomas Petricek
:
Composable data visualizations. e13
- Graham Hutton:
PhD Abstracts. e14
- Jeremy Gibbons
:
How to design co-programs. e15
- Shriram Krishnamurthi:
What is an education paper? e16
- Reynald Affeldt
, Jacques Garrigue, David Nowak, Takafumi Saikawa:
A trustful monad for axiomatic reasoning with probability and nondeterminism. e17 - Robert Sison
, Toby Murray:
Verified secure compilation for mixed-sensitivity concurrent programs. e18 - Bhargav Shivkumar, Jeffrey C. Murphy, Lukasz Ziarek:
Real-time MLton: A Standard ML runtime for real-time functional programs. e19 - Jeremy G. Siek
, Peter Thiemann, Philip Wadler:
Blame and coercion: Together again for the first time. e20 - Max S. New
, Daniel R. Licata, Amal Ahmed:
Gradual type theory. e21 - Guillaume Allais
, Robert Atkey
, James Chapman
, Conor McBride
, James McKinna
:
A type- and scope-safe universe of syntaxes with binding: their semantics and proofs. e22
- Peter Achten
:
Segments: An alternative rainfall problem. e23
- Nicola Botta
, Nuria Brede
, Patrik Jansson
, Tim Richter
:
Extensional equality preservation and verified generic programming. e24 - Liam O'Connor
, Zilin Chen
, Christine Rizkallah
, Vincent Jackson, Sidney Amani, Gerwin Klein, Toby Murray, Thomas Sewell, Gabriele Keller:
Cogent: uniqueness types and certifying compilation. e25 - Nuria Brede
, Nicola Botta
:
On the correctness of monadic backward induction. e26 - Weihao Qu
, Marco Gaboardi, Deepak Garg
:
Relational cost analysis in a functional-imperative setting. e27 - Xuejing Huang
, Jinxu Zhao, Bruno C. d. S. Oliveira:
Taming the Merge Operator. e28
- Richard S. Bird
, Shin-Cheng Mu
:
A greedy algorithm for dropping digits. e29
- Jeremy G. Siek
, Tianyu Chen:
Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi. e30
- Shin-Cheng Mu
, Tsung-Ju Chiang:
Longest segment of balanced parentheses: an exercise in program inversion in a segment problem. e31
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.