default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Functional Programming, Volume 29
Volume 29, 2019
- Graham Hutton:
PhD Abstracts. e1
- Yong Kiam Tan, Magnus O. Myreen, Ramana Kumar, Anthony C. J. Fox, Scott Owens
, Michael Norrish:
The verified CakeML compiler backend. e2 - Tom Schrijvers, Bruno C. d. S. Oliveira, Philip Wadler, Koar Marntirosian:
COCHIS: Stable and coherent implicits. e3 - Ben Greenman, Asumu Takikawa, Max S. New, Daniel Feltey, Robert Bruce Findler, Jan Vitek, Matthias Felleisen:
How to evaluate the performance of gradual type systems. e4 - Kwanghoon Choi, Byeong-Mo Chang:
A theory of RPC calculi for client-server model. e5
- Olivier Danvy:
Folding left and right over Peano numbers. e6
- Álvaro García-Pérez, Pablo Nogueira:
The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus. e7
- Richard S. Bird:
How to find a fake coin. e8
- Tiark Rompf, Nada Amin:
A SQL to C compiler in 500 lines of code. e9
- Graham Hutton:
PhD Abstracts. e10
- David Darais, David Van Horn:
Constructive Galois Connections. e11
- Oleksandr Manzyuk, Barak A. Pearlmutter, Alexey Andreyevich Radul, David R. Rush, Jeffrey Mark Siskind:
Perturbation confusion in forward automatic differentiation of higher-order functions. e12
- Saverio Perugini:
Emerging languages: An alternative approach to teaching programming languages. e13
- Yanpeng Yang, Bruno C. d. S. Oliveira:
Pure iso-type systems. e14 - Yannick Forster, Ohad Kammar, Sam Lindley, Matija Pretnar:
On the expressive power of user-defined effects: Effect handlers, monadic reflection, delimited control. e15 - Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, Pierre-Yves Strub:
A relational logic for higher-order programs. e16 - Atsushi Igarashi, Peter Thiemann, Yuya Tsuda, Vasco T. Vasconcelos, Philip Wadler:
Gradual session types. e17
- Roger B. Dannenberg:
Review of "The Haskell School of Music: from Signals to Symphonies, " by Paul Hudak and Donya Quick, Cambridge University Press, 2018. e18
- Andreas Abel, Guillaume Allais, Aliya Hameer, Brigitte Pientka, Alberto Momigliano, Steven Schäfer, Kathrin Stark:
POPLMark reloaded: Mechanizing proofs by logical relations. e19
- Makoto Hamana:
How to prove decidability of equational theories with second-order computation analyser SOL. e20
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 2024-11-19 20: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:
