default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Functional Programming, Volume 35
Volume 35, 2025
- Graham Hutton:
PhD Abstracts. - Brent A. Yorgey
:
You could have invented Fenwick trees. - Reynald Affeldt, Jacques Garrigue, Takafumi Saikawa:
A practical formalization of monadic equational reasoning in dependent-type theory. - Brent A. Yorgey:
Review of "Haskell in Depth" by Vitaly Bragilevsky, Manning Publications, 2021. - Litao Zhou, Yaoda Zhou, Qianyong Wan, Bruno C. d. S. Oliveira:
Recursive subtyping for all. - Jeremy Gibbons:
Turner, Bird, Eratosthenes: An eternal burning thread. - José Nuno Oliveira:
How much is in a square? Calculating functional programs with squares. - Peter Chapman:
Experiences of early assessment to teach functional programming. - Jean-Philippe Bernardy, Patrik Jansson:
Domain-specific tensor languages. - Ralf Hinze, Dan Marsden:
The graphical theory of monads. - Alexander Dinges, Ralf Hinze:
Binary search - think positive. - Kenichi Asai:
OCaml Blockly. - Paul Downen, Zena M. Ariola:
A contextual formalization of structural coinduction. - Júlia Mota, João A. R. Paixão, Lucas Rufino Martelotte:
Point-free calculational proofs and program derivation in linear algebra using a graphical syntax. - Tom Smeding, Matthijs Vákár:
Parallel dual-numbers reverse AD. - Graham Hutton:
PhD Abstracts. - Oliver Westphal, Janis Voigtländer:
Automatically testing console I/O behavior of student submissions in Haskell. - Hangyeol Cho, Woosuk Lee:
Inductive synthesis of structurally recursive functional programs from non-recursive expressions. - Nicolas Chappe, Paul He, Ludovic Henrio, Eleftherios Ioannidis, Yannick Zakowski, Steve Zdancewic:
Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq. - John Charles Kolesar, Ruzica Piskac, William T. Hallahan:
Checking equivalence in a non-strict language. - Wouter Swierstra:
Towards type-directed compiler calculation. - Graham Hutton, Nicolas Wu:
JFP special issue on program calculation. - Daan Leijen, Anton Lorenzen:
Tail recursion modulo context: An equational approach (extended version). - Dariusz Biernacki, James McKinna, Filip Sieczkowski:
Call-by-value and call-by-name: A simple proof of a classic theorem.
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.
last updated on 2025-12-05 22:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
